About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 925.220 | 412843.00 | 491359.00 | 1512.10 | ?FFFTFFTFFFFTFFT | 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.r233-tall-167856419400772.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 MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400772
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679608501935
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 21:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 21:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 21:55:03] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2023-03-23 21:55:04] [INFO ] Transformed 4914 places.
[2023-03-23 21:55:04] [INFO ] Transformed 6913 transitions.
[2023-03-23 21:55:04] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1340 places :
Symmetric choice reduction at 1 with 1340 rule applications. Total rules 1370 place count 3544 transition count 5573
Iterating global reduction 1 with 1340 rules applied. Total rules applied 2710 place count 3544 transition count 5573
Discarding 1172 places :
Symmetric choice reduction at 1 with 1172 rule applications. Total rules 3882 place count 2372 transition count 4401
Iterating global reduction 1 with 1172 rules applied. Total rules applied 5054 place count 2372 transition count 4401
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 5269 place count 2157 transition count 3326
Iterating global reduction 1 with 215 rules applied. Total rules applied 5484 place count 2157 transition count 3326
Applied a total of 5484 rules in 1115 ms. Remains 2157 /4914 variables (removed 2757) and now considering 3326/6913 (removed 3587) transitions.
[2023-03-23 21:55:05] [INFO ] Flow matrix only has 3054 transitions (discarded 272 similar events)
// Phase 1: matrix 3054 rows 2157 cols
[2023-03-23 21:55:05] [INFO ] Computed 505 place invariants in 152 ms
[2023-03-23 21:55:08] [INFO ] Implicit Places using invariants in 3066 ms returned [4, 8, 12, 16, 18, 20, 22, 30, 37, 46, 57, 70, 85, 101, 117, 119, 121, 123, 125, 127, 140, 151, 160, 167, 172, 175, 198, 205, 208, 209, 210, 211, 212, 213, 216, 221, 228, 237, 248, 261, 275, 289, 290, 291, 292, 293, 294, 305, 314, 321, 326, 329, 331, 354, 361, 364, 365, 366, 368, 369, 374, 377, 384, 391, 400, 411, 423, 435, 436, 437, 439, 440, 449, 456, 461, 464, 470, 493, 500, 503, 504, 505, 506, 507, 508, 510, 512, 515, 520, 527, 536, 546, 557, 558, 559, 560, 561, 568, 573, 579, 581, 583, 585, 608, 615, 618, 619, 620, 621, 622, 623, 625, 628, 630, 633, 638, 645, 653, 661, 663, 664, 666, 673, 679, 682, 684, 688, 711, 718, 721, 722, 723, 724, 725, 726, 728, 730, 732, 734, 737, 742, 748, 754, 755, 756, 757, 758, 759, 762, 764, 766, 768, 770, 772, 795, 802, 805, 807, 808, 809, 810, 812, 814, 816, 820, 822, 825, 829, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 873, 880, 883, 884, 885, 886, 887, 888, 890, 893, 895, 898, 900, 902, 904, 907, 908, 910, 911, 912, 914, 919, 921, 923, 925, 927, 950, 952, 956, 959, 960, 961, 962, 963, 964, 966, 968, 970, 972, 974, 976, 978, 981, 982, 983, 984, 985, 986, 988, 990, 992, 994, 996, 998, 1021, 1028, 1032, 1033, 1034, 1035, 1036, 1040, 1042, 1044, 1046, 1048, 1050, 1052, 1055, 1056, 1057, 1058, 1060, 1062, 1064, 1066, 1071, 1073, 1075, 1098, 1105, 1108, 1109, 1110, 1111, 1112, 1113, 1115, 1117, 1119, 1121, 1123, 1125, 1128, 1133, 1135, 1136, 1137, 1138, 1143, 1145, 1147, 1149, 1153, 1176, 1183, 1186, 1187, 1189, 1190, 1191, 1193, 1195, 1200, 1202, 1204, 1207, 1212, 1219, 1220, 1221, 1223, 1224, 1229, 1232, 1234, 1238, 1240, 1242, 1272, 1275, 1276, 1277, 1278, 1279, 1280, 1283, 1285, 1287, 1289, 1292, 1297, 1304, 1313, 1314, 1315, 1316, 1317, 1318, 1325, 1330, 1333, 1335, 1337, 1339, 1362, 1369, 1372, 1373, 1374, 1375, 1376, 1377, 1379, 1381, 1383, 1386, 1391, 1398, 1407, 1418, 1419, 1420, 1421, 1422, 1423, 1432, 1439, 1444, 1447, 1449, 1451, 1474, 1481, 1484, 1485, 1486, 1487, 1488, 1489, 1491, 1493, 1496, 1501, 1508, 1517, 1528, 1541, 1542, 1543, 1544, 1545, 1546, 1557, 1566, 1573, 1578, 1581, 1584, 1607, 1614, 1617, 1620, 1621, 1622, 1624, 1627, 1636, 1643, 1652, 1666, 1679, 1695, 1696, 1697, 1698, 1699, 1712, 1735, 1742, 1747, 1750, 1775, 1779, 1782, 1783, 1784, 1785, 1786, 1787, 1790, 1795, 1802, 1811, 1822, 1835, 1850, 1867, 1868, 1869, 1870, 1871, 1872, 1887, 1900, 1911, 1920, 1927, 1932, 1956]
Discarding 440 places :
Implicit Place search using SMT only with invariants took 3107 ms to find 440 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1717/4914 places, 3326/6913 transitions.
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 144 place count 1573 transition count 3182
Iterating global reduction 0 with 144 rules applied. Total rules applied 288 place count 1573 transition count 3182
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 432 place count 1429 transition count 3038
Iterating global reduction 0 with 144 rules applied. Total rules applied 576 place count 1429 transition count 3038
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 719 place count 1286 transition count 2895
Iterating global reduction 0 with 143 rules applied. Total rules applied 862 place count 1286 transition count 2895
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 880 place count 1268 transition count 2805
Iterating global reduction 0 with 18 rules applied. Total rules applied 898 place count 1268 transition count 2805
Applied a total of 898 rules in 413 ms. Remains 1268 /1717 variables (removed 449) and now considering 2805/3326 (removed 521) transitions.
[2023-03-23 21:55:08] [INFO ] Flow matrix only has 2533 transitions (discarded 272 similar events)
// Phase 1: matrix 2533 rows 1268 cols
[2023-03-23 21:55:08] [INFO ] Computed 65 place invariants in 37 ms
[2023-03-23 21:55:09] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-23 21:55:09] [INFO ] Flow matrix only has 2533 transitions (discarded 272 similar events)
[2023-03-23 21:55:09] [INFO ] Invariant cache hit.
[2023-03-23 21:55:10] [INFO ] State equation strengthened by 974 read => feed constraints.
[2023-03-23 21:55:21] [INFO ] Implicit Places using invariants and state equation in 11699 ms returned []
Implicit Place search using SMT with State Equation took 12719 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1268/4914 places, 2805/6913 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17357 ms. Remains : 1268/4914 places, 2805/6913 transitions.
Support contains 70 out of 1268 places after structural reductions.
[2023-03-23 21:55:22] [INFO ] Flatten gal took : 232 ms
[2023-03-23 21:55:22] [INFO ] Flatten gal took : 138 ms
[2023-03-23 21:55:22] [INFO ] Input system was already deterministic with 2805 transitions.
Support contains 67 out of 1268 places (down from 70) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 32) seen :15
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-23 21:55:23] [INFO ] Flow matrix only has 2533 transitions (discarded 272 similar events)
[2023-03-23 21:55:23] [INFO ] Invariant cache hit.
[2023-03-23 21:55:23] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2023-03-23 21:55:23] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2023-03-23 21:55:26] [INFO ] After 2312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2023-03-23 21:55:26] [INFO ] State equation strengthened by 974 read => feed constraints.
[2023-03-23 21:55:27] [INFO ] After 547ms SMT Verify possible using 974 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 21:55:27] [INFO ] After 3778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 21:55:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-23 21:55:27] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 17 ms returned sat
[2023-03-23 21:55:30] [INFO ] After 2416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-23 21:55:33] [INFO ] After 3182ms SMT Verify possible using 974 Read/Feed constraints in natural domain returned unsat :3 sat :12
[2023-03-23 21:55:34] [INFO ] Deduced a trap composed of 398 places in 644 ms of which 7 ms to minimize.
[2023-03-23 21:55:34] [INFO ] Deduced a trap composed of 297 places in 575 ms of which 1 ms to minimize.
[2023-03-23 21:55:35] [INFO ] Deduced a trap composed of 287 places in 551 ms of which 1 ms to minimize.
[2023-03-23 21:55:36] [INFO ] Deduced a trap composed of 291 places in 562 ms of which 2 ms to minimize.
[2023-03-23 21:55:36] [INFO ] Deduced a trap composed of 297 places in 585 ms of which 3 ms to minimize.
[2023-03-23 21:55:37] [INFO ] Deduced a trap composed of 312 places in 561 ms of which 2 ms to minimize.
[2023-03-23 21:55:38] [INFO ] Deduced a trap composed of 287 places in 547 ms of which 2 ms to minimize.
[2023-03-23 21:55:38] [INFO ] Deduced a trap composed of 309 places in 581 ms of which 2 ms to minimize.
[2023-03-23 21:55:39] [INFO ] Deduced a trap composed of 128 places in 621 ms of which 1 ms to minimize.
[2023-03-23 21:55:40] [INFO ] Deduced a trap composed of 257 places in 586 ms of which 1 ms to minimize.
[2023-03-23 21:55:41] [INFO ] Deduced a trap composed of 156 places in 565 ms of which 1 ms to minimize.
[2023-03-23 21:55:41] [INFO ] Deduced a trap composed of 132 places in 593 ms of which 2 ms to minimize.
[2023-03-23 21:55:42] [INFO ] Deduced a trap composed of 140 places in 604 ms of which 2 ms to minimize.
[2023-03-23 21:55:43] [INFO ] Deduced a trap composed of 140 places in 590 ms of which 2 ms to minimize.
[2023-03-23 21:55:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 10458 ms
[2023-03-23 21:55:44] [INFO ] Deduced a trap composed of 159 places in 601 ms of which 2 ms to minimize.
[2023-03-23 21:55:45] [INFO ] Deduced a trap composed of 199 places in 624 ms of which 1 ms to minimize.
[2023-03-23 21:55:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1483 ms
[2023-03-23 21:55:47] [INFO ] Deduced a trap composed of 361 places in 618 ms of which 1 ms to minimize.
[2023-03-23 21:55:47] [INFO ] Deduced a trap composed of 151 places in 590 ms of which 2 ms to minimize.
[2023-03-23 21:55:48] [INFO ] Deduced a trap composed of 174 places in 588 ms of which 1 ms to minimize.
[2023-03-23 21:55:49] [INFO ] Deduced a trap composed of 197 places in 580 ms of which 1 ms to minimize.
[2023-03-23 21:55:49] [INFO ] Deduced a trap composed of 151 places in 578 ms of which 1 ms to minimize.
[2023-03-23 21:55:50] [INFO ] Deduced a trap composed of 147 places in 637 ms of which 1 ms to minimize.
[2023-03-23 21:55:51] [INFO ] Deduced a trap composed of 141 places in 563 ms of which 1 ms to minimize.
[2023-03-23 21:55:52] [INFO ] Deduced a trap composed of 146 places in 573 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-23 21:55:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 21:55:52] [INFO ] After 25178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 23 out of 1268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1268 transition count 2787
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 1250 transition count 2787
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 1250 transition count 2768
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 1231 transition count 2768
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 1219 transition count 2740
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 1219 transition count 2740
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 98 place count 1219 transition count 2738
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 1217 transition count 2738
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 1210 transition count 2703
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 1210 transition count 2703
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 172 place count 1182 transition count 2675
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 178 place count 1176 transition count 2669
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 1176 transition count 2669
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 1170 transition count 2639
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 1170 transition count 2639
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 2 with 130 rules applied. Total rules applied 326 place count 1170 transition count 3453
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 2 with 130 rules applied. Total rules applied 456 place count 1040 transition count 3453
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 468 place count 1040 transition count 3453
Applied a total of 468 rules in 872 ms. Remains 1040 /1268 variables (removed 228) and now considering 3453/2805 (removed -648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 1040/1268 places, 3453/2805 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 55804 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 55804 steps, saw 23785 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :2
Running SMT prover for 9 properties.
[2023-03-23 21:55:57] [INFO ] Flow matrix only has 3072 transitions (discarded 381 similar events)
// Phase 1: matrix 3072 rows 1040 cols
[2023-03-23 21:55:57] [INFO ] Computed 65 place invariants in 53 ms
[2023-03-23 21:55:57] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 21:55:57] [INFO ] [Real]Absence check using 33 positive and 32 generalized place invariants in 8 ms returned sat
[2023-03-23 21:55:59] [INFO ] After 1368ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-23 21:55:59] [INFO ] State equation strengthened by 1850 read => feed constraints.
[2023-03-23 21:55:59] [INFO ] After 304ms SMT Verify possible using 1850 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 21:55:59] [INFO ] After 2208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 21:56:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 21:56:00] [INFO ] [Nat]Absence check using 33 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-23 21:56:01] [INFO ] After 1769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 21:56:06] [INFO ] After 4106ms SMT Verify possible using 1850 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 21:56:07] [INFO ] Deduced a trap composed of 170 places in 536 ms of which 1 ms to minimize.
[2023-03-23 21:56:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 981 ms
[2023-03-23 21:56:09] [INFO ] Deduced a trap composed of 186 places in 516 ms of which 1 ms to minimize.
[2023-03-23 21:56:10] [INFO ] Deduced a trap composed of 153 places in 530 ms of which 1 ms to minimize.
[2023-03-23 21:56:11] [INFO ] Deduced a trap composed of 180 places in 542 ms of which 1 ms to minimize.
[2023-03-23 21:56:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2150 ms
[2023-03-23 21:56:12] [INFO ] Deduced a trap composed of 81 places in 611 ms of which 1 ms to minimize.
[2023-03-23 21:56:13] [INFO ] Deduced a trap composed of 147 places in 511 ms of which 1 ms to minimize.
[2023-03-23 21:56:13] [INFO ] Deduced a trap composed of 86 places in 553 ms of which 1 ms to minimize.
[2023-03-23 21:56:14] [INFO ] Deduced a trap composed of 77 places in 600 ms of which 1 ms to minimize.
[2023-03-23 21:56:15] [INFO ] Deduced a trap composed of 104 places in 581 ms of which 1 ms to minimize.
[2023-03-23 21:56:15] [INFO ] Deduced a trap composed of 85 places in 591 ms of which 1 ms to minimize.
[2023-03-23 21:56:16] [INFO ] Deduced a trap composed of 101 places in 558 ms of which 4 ms to minimize.
[2023-03-23 21:56:17] [INFO ] Deduced a trap composed of 88 places in 579 ms of which 1 ms to minimize.
[2023-03-23 21:56:17] [INFO ] Deduced a trap composed of 68 places in 573 ms of which 1 ms to minimize.
[2023-03-23 21:56:18] [INFO ] Deduced a trap composed of 81 places in 565 ms of which 1 ms to minimize.
[2023-03-23 21:56:19] [INFO ] Deduced a trap composed of 94 places in 567 ms of which 1 ms to minimize.
[2023-03-23 21:56:20] [INFO ] Deduced a trap composed of 106 places in 573 ms of which 5 ms to minimize.
[2023-03-23 21:56:21] [INFO ] Deduced a trap composed of 98 places in 577 ms of which 1 ms to minimize.
[2023-03-23 21:56:21] [INFO ] Deduced a trap composed of 171 places in 505 ms of which 1 ms to minimize.
[2023-03-23 21:56:24] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 13062 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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-23 21:56:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 21:56:24] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 19 ms.
Support contains 18 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 3453/3453 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1040 transition count 3452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1039 transition count 3452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1039 transition count 3451
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1038 transition count 3451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1037 transition count 3450
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1037 transition count 3450
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1037 transition count 3449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1036 transition count 3449
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 1036 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 1035 transition count 3448
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 1035 transition count 3448
Applied a total of 12 rules in 792 ms. Remains 1035 /1040 variables (removed 5) and now considering 3448/3453 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 805 ms. Remains : 1035/1040 places, 3448/3453 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 57418 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57418 steps, saw 24441 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-23 21:56:29] [INFO ] Flow matrix only has 3067 transitions (discarded 381 similar events)
// Phase 1: matrix 3067 rows 1035 cols
[2023-03-23 21:56:30] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-23 21:56:30] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-23 21:56:30] [INFO ] [Real]Absence check using 33 positive and 32 generalized place invariants in 5 ms returned sat
[2023-03-23 21:56:32] [INFO ] After 1924ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2023-03-23 21:56:32] [INFO ] State equation strengthened by 1850 read => feed constraints.
[2023-03-23 21:56:32] [INFO ] After 491ms SMT Verify possible using 1850 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 21:56:32] [INFO ] After 2915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 21:56:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 21:56:33] [INFO ] [Nat]Absence check using 33 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-23 21:56:35] [INFO ] After 1658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 21:56:38] [INFO ] After 3312ms SMT Verify possible using 1850 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 21:56:40] [INFO ] Deduced a trap composed of 183 places in 537 ms of which 1 ms to minimize.
[2023-03-23 21:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 686 ms
[2023-03-23 21:56:40] [INFO ] Deduced a trap composed of 63 places in 571 ms of which 1 ms to minimize.
[2023-03-23 21:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 718 ms
[2023-03-23 21:56:41] [INFO ] Deduced a trap composed of 177 places in 495 ms of which 1 ms to minimize.
[2023-03-23 21:56:42] [INFO ] Deduced a trap composed of 181 places in 476 ms of which 1 ms to minimize.
[2023-03-23 21:56:43] [INFO ] Deduced a trap composed of 183 places in 481 ms of which 1 ms to minimize.
[2023-03-23 21:56:43] [INFO ] Deduced a trap composed of 169 places in 474 ms of which 0 ms to minimize.
[2023-03-23 21:56:44] [INFO ] Deduced a trap composed of 166 places in 484 ms of which 1 ms to minimize.
[2023-03-23 21:56:45] [INFO ] Deduced a trap composed of 139 places in 487 ms of which 1 ms to minimize.
[2023-03-23 21:56:45] [INFO ] Deduced a trap composed of 129 places in 482 ms of which 2 ms to minimize.
[2023-03-23 21:56:46] [INFO ] Deduced a trap composed of 160 places in 500 ms of which 1 ms to minimize.
[2023-03-23 21:56:46] [INFO ] Deduced a trap composed of 118 places in 510 ms of which 1 ms to minimize.
[2023-03-23 21:56:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5723 ms
[2023-03-23 21:56:48] [INFO ] Deduced a trap composed of 94 places in 533 ms of which 1 ms to minimize.
[2023-03-23 21:56:49] [INFO ] Deduced a trap composed of 74 places in 577 ms of which 1 ms to minimize.
[2023-03-23 21:56:49] [INFO ] Deduced a trap composed of 156 places in 468 ms of which 10 ms to minimize.
[2023-03-23 21:56:50] [INFO ] Deduced a trap composed of 142 places in 505 ms of which 1 ms to minimize.
[2023-03-23 21:56:51] [INFO ] Deduced a trap composed of 91 places in 548 ms of which 1 ms to minimize.
[2023-03-23 21:56:51] [INFO ] Deduced a trap composed of 178 places in 481 ms of which 1 ms to minimize.
[2023-03-23 21:56:52] [INFO ] Deduced a trap composed of 83 places in 547 ms of which 1 ms to minimize.
[2023-03-23 21:56:53] [INFO ] Deduced a trap composed of 78 places in 569 ms of which 1 ms to minimize.
[2023-03-23 21:56:53] [INFO ] Deduced a trap composed of 149 places in 569 ms of which 1 ms to minimize.
[2023-03-23 21:56:54] [INFO ] Deduced a trap composed of 102 places in 551 ms of which 1 ms to minimize.
[2023-03-23 21:56:55] [INFO ] Deduced a trap composed of 82 places in 555 ms of which 1 ms to minimize.
[2023-03-23 21:56:55] [INFO ] Deduced a trap composed of 157 places in 579 ms of which 3 ms to minimize.
[2023-03-23 21:56:56] [INFO ] Deduced a trap composed of 83 places in 563 ms of which 1 ms to minimize.
[2023-03-23 21:56:57] [INFO ] Deduced a trap composed of 97 places in 548 ms of which 5 ms to minimize.
[2023-03-23 21:56:58] [INFO ] Deduced a trap composed of 90 places in 551 ms of which 10 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-23 21:56:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 21:56:58] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 11 ms.
Support contains 18 out of 1035 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1035/1035 places, 3448/3448 transitions.
Applied a total of 0 rules in 113 ms. Remains 1035 /1035 variables (removed 0) and now considering 3448/3448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1035/1035 places, 3448/3448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1035/1035 places, 3448/3448 transitions.
Applied a total of 0 rules in 120 ms. Remains 1035 /1035 variables (removed 0) and now considering 3448/3448 (removed 0) transitions.
[2023-03-23 21:56:58] [INFO ] Flow matrix only has 3067 transitions (discarded 381 similar events)
[2023-03-23 21:56:58] [INFO ] Invariant cache hit.
[2023-03-23 21:56:59] [INFO ] Implicit Places using invariants in 1434 ms returned [8, 236, 283, 302, 348, 395, 406, 447, 481, 516, 553, 559, 571, 585, 598, 775, 776, 827, 848, 871]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1448 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1015/1035 places, 3448/3448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1006 transition count 3439
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1006 transition count 3439
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 997 transition count 3430
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 997 transition count 3430
Applied a total of 36 rules in 138 ms. Remains 997 /1015 variables (removed 18) and now considering 3430/3448 (removed 18) transitions.
[2023-03-23 21:56:59] [INFO ] Flow matrix only has 3049 transitions (discarded 381 similar events)
// Phase 1: matrix 3049 rows 997 cols
[2023-03-23 21:56:59] [INFO ] Computed 45 place invariants in 32 ms
[2023-03-23 21:57:00] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2023-03-23 21:57:00] [INFO ] Flow matrix only has 3049 transitions (discarded 381 similar events)
[2023-03-23 21:57:00] [INFO ] Invariant cache hit.
[2023-03-23 21:57:01] [INFO ] State equation strengthened by 1850 read => feed constraints.
[2023-03-23 21:57:17] [INFO ] Implicit Places using invariants and state equation in 16038 ms returned []
Implicit Place search using SMT with State Equation took 17135 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 997/1035 places, 3430/3448 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18842 ms. Remains : 997/1035 places, 3430/3448 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 436 stabilizing places and 1172 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2)))))))))))'
Support contains 8 out of 1268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1268 transition count 2784
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1247 transition count 2784
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 42 place count 1247 transition count 2767
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 76 place count 1230 transition count 2767
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 1218 transition count 2735
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 1218 transition count 2735
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 100 place count 1218 transition count 2734
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 1217 transition count 2734
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 1212 transition count 2709
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 1212 transition count 2709
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 174 place count 1181 transition count 2678
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 183 place count 1172 transition count 2669
Iterating global reduction 2 with 9 rules applied. Total rules applied 192 place count 1172 transition count 2669
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 201 place count 1163 transition count 2624
Iterating global reduction 2 with 9 rules applied. Total rules applied 210 place count 1163 transition count 2624
Applied a total of 210 rules in 397 ms. Remains 1163 /1268 variables (removed 105) and now considering 2624/2805 (removed 181) transitions.
[2023-03-23 21:57:17] [INFO ] Flow matrix only has 2352 transitions (discarded 272 similar events)
// Phase 1: matrix 2352 rows 1163 cols
[2023-03-23 21:57:17] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-23 21:57:19] [INFO ] Implicit Places using invariants in 1226 ms returned [9, 265, 341, 396, 450, 451, 461, 508, 546, 583, 593, 631, 644, 680, 878, 879, 937, 960, 986]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1243 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1144/1268 places, 2624/2805 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1138 transition count 2618
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1138 transition count 2618
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1132 transition count 2612
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1132 transition count 2612
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 1129 transition count 2597
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 1129 transition count 2597
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 44 place count 1122 transition count 2590
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1115 transition count 2583
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1115 transition count 2583
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 1107 transition count 2543
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 1107 transition count 2543
Applied a total of 74 rules in 313 ms. Remains 1107 /1144 variables (removed 37) and now considering 2543/2624 (removed 81) transitions.
[2023-03-23 21:57:19] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1107 cols
[2023-03-23 21:57:19] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-23 21:57:20] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-23 21:57:20] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:57:20] [INFO ] Invariant cache hit.
[2023-03-23 21:57:21] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 21:57:29] [INFO ] Implicit Places using invariants and state equation in 8611 ms returned []
Implicit Place search using SMT with State Equation took 9700 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1268 places, 2543/2805 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11654 ms. Remains : 1107/1268 places, 2543/2805 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) p1), (AND (NOT p0) (NOT p3) p2 p1), (AND (NOT p0) p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s641 1) (GEQ s646 1)), p3:(AND (NOT (AND (GEQ s518 1) (GEQ s1078 1))) (NOT (AND (GEQ s594 1) (GEQ s606 1)))), p2:(AND (GEQ s594 1) (GEQ s606 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2719 reset in 783 ms.
Product exploration explored 100000 steps with 2719 reset in 659 ms.
Computed a total of 292 stabilizing places and 927 stable transitions
Computed a total of 292 stabilizing places and 927 stable transitions
Detected a total of 292/1107 stabilizing places and 927/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 934 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 270 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 21:57:32] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:57:32] [INFO ] Invariant cache hit.
[2023-03-23 21:57:32] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 21:57:32] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-23 21:57:32] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 21:57:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 201 ms returned sat
[2023-03-23 21:57:33] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-23 21:57:33] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-23 21:57:33] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 21:57:34] [INFO ] After 203ms SMT Verify possible using 854 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-23 21:57:34] [INFO ] Deduced a trap composed of 96 places in 461 ms of which 2 ms to minimize.
[2023-03-23 21:57:35] [INFO ] Deduced a trap composed of 96 places in 479 ms of which 1 ms to minimize.
[2023-03-23 21:57:35] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 1 ms to minimize.
[2023-03-23 21:57:36] [INFO ] Deduced a trap composed of 90 places in 465 ms of which 1 ms to minimize.
[2023-03-23 21:57:36] [INFO ] Deduced a trap composed of 105 places in 465 ms of which 1 ms to minimize.
[2023-03-23 21:57:37] [INFO ] Deduced a trap composed of 91 places in 481 ms of which 1 ms to minimize.
[2023-03-23 21:57:37] [INFO ] Deduced a trap composed of 208 places in 462 ms of which 1 ms to minimize.
[2023-03-23 21:57:38] [INFO ] Deduced a trap composed of 97 places in 472 ms of which 1 ms to minimize.
[2023-03-23 21:57:38] [INFO ] Deduced a trap composed of 94 places in 487 ms of which 1 ms to minimize.
[2023-03-23 21:57:39] [INFO ] Deduced a trap composed of 63 places in 517 ms of which 1 ms to minimize.
[2023-03-23 21:57:40] [INFO ] Deduced a trap composed of 147 places in 490 ms of which 1 ms to minimize.
[2023-03-23 21:57:40] [INFO ] Deduced a trap composed of 146 places in 458 ms of which 1 ms to minimize.
[2023-03-23 21:57:41] [INFO ] Deduced a trap composed of 173 places in 446 ms of which 1 ms to minimize.
[2023-03-23 21:57:41] [INFO ] Deduced a trap composed of 175 places in 444 ms of which 1 ms to minimize.
[2023-03-23 21:57:42] [INFO ] Deduced a trap composed of 190 places in 471 ms of which 1 ms to minimize.
[2023-03-23 21:57:42] [INFO ] Deduced a trap composed of 219 places in 459 ms of which 1 ms to minimize.
[2023-03-23 21:57:43] [INFO ] Deduced a trap composed of 158 places in 447 ms of which 1 ms to minimize.
[2023-03-23 21:57:44] [INFO ] Deduced a trap composed of 183 places in 458 ms of which 1 ms to minimize.
[2023-03-23 21:57:44] [INFO ] Deduced a trap composed of 216 places in 462 ms of which 1 ms to minimize.
[2023-03-23 21:57:45] [INFO ] Deduced a trap composed of 156 places in 447 ms of which 1 ms to minimize.
[2023-03-23 21:57:45] [INFO ] Deduced a trap composed of 230 places in 460 ms of which 1 ms to minimize.
[2023-03-23 21:57:46] [INFO ] Deduced a trap composed of 176 places in 434 ms of which 1 ms to minimize.
[2023-03-23 21:57:46] [INFO ] Deduced a trap composed of 180 places in 438 ms of which 1 ms to minimize.
[2023-03-23 21:57:47] [INFO ] Deduced a trap composed of 228 places in 460 ms of which 1 ms to minimize.
[2023-03-23 21:57:47] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13331 ms
[2023-03-23 21:57:47] [INFO ] After 13747ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-23 21:57:47] [INFO ] After 15063ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1107 transition count 2542
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1106 transition count 2542
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 1104 transition count 2536
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1104 transition count 2536
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1103 transition count 2531
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1103 transition count 2531
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 0 with 136 rules applied. Total rules applied 144 place count 1103 transition count 3455
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 0 with 136 rules applied. Total rules applied 280 place count 967 transition count 3455
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 281 place count 967 transition count 3455
Applied a total of 281 rules in 503 ms. Remains 967 /1107 variables (removed 140) and now considering 3455/2543 (removed -912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 967/1107 places, 3455/2543 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 21:57:48] [INFO ] Flow matrix only has 3057 transitions (discarded 398 similar events)
// Phase 1: matrix 3057 rows 967 cols
[2023-03-23 21:57:48] [INFO ] Computed 46 place invariants in 24 ms
[2023-03-23 21:57:48] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 21:57:48] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 21:57:49] [INFO ] After 796ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 21:57:49] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 21:57:49] [INFO ] After 227ms SMT Verify possible using 1906 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 21:57:49] [INFO ] After 1197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 21:57:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 21:57:49] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 21:57:50] [INFO ] After 894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 21:57:51] [INFO ] After 384ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 21:57:51] [INFO ] Deduced a trap composed of 52 places in 513 ms of which 1 ms to minimize.
[2023-03-23 21:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 787 ms
[2023-03-23 21:57:52] [INFO ] After 1231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-23 21:57:52] [INFO ] After 2374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3455/3455 transitions.
Applied a total of 0 rules in 106 ms. Remains 967 /967 variables (removed 0) and now considering 3455/3455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 967/967 places, 3455/3455 transitions.
Finished random walk after 6781 steps, including 230 resets, run visited all 1 properties in 117 ms. (steps per millisecond=57 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2 (NOT p3))))]
Knowledge based reduction with 19 factoid took 1093 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p1 p3), false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1 p3), false, (AND (NOT p0) p1 p3)]
Support contains 8 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Applied a total of 0 rules in 68 ms. Remains 1107 /1107 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2023-03-23 21:57:53] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1107 cols
[2023-03-23 21:57:53] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-23 21:57:54] [INFO ] Implicit Places using invariants in 997 ms returned []
[2023-03-23 21:57:54] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:57:54] [INFO ] Invariant cache hit.
[2023-03-23 21:57:55] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 21:58:03] [INFO ] Implicit Places using invariants and state equation in 8925 ms returned []
Implicit Place search using SMT with State Equation took 9941 ms to find 0 implicit places.
[2023-03-23 21:58:03] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-23 21:58:03] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:58:03] [INFO ] Invariant cache hit.
[2023-03-23 21:58:05] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11265 ms. Remains : 1107/1107 places, 2543/2543 transitions.
Computed a total of 292 stabilizing places and 927 stable transitions
Computed a total of 292 stabilizing places and 927 stable transitions
Detected a total of 292/1107 stabilizing places and 927/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 (NOT p3)))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 731 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1 p3), false, (AND (NOT p0) p1 p3)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 21:58:06] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:58:06] [INFO ] Invariant cache hit.
[2023-03-23 21:58:06] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 21:58:06] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 22 ms returned sat
[2023-03-23 21:58:06] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 21:58:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-23 21:58:06] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-23 21:58:07] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 21:58:07] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 21:58:07] [INFO ] After 192ms SMT Verify possible using 854 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 21:58:08] [INFO ] Deduced a trap composed of 88 places in 459 ms of which 1 ms to minimize.
[2023-03-23 21:58:08] [INFO ] Deduced a trap composed of 63 places in 486 ms of which 1 ms to minimize.
[2023-03-23 21:58:09] [INFO ] Deduced a trap composed of 202 places in 442 ms of which 1 ms to minimize.
[2023-03-23 21:58:10] [INFO ] Deduced a trap composed of 226 places in 456 ms of which 1 ms to minimize.
[2023-03-23 21:58:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2348 ms
[2023-03-23 21:58:10] [INFO ] After 2605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-23 21:58:10] [INFO ] After 3820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 0 with 137 rules applied. Total rules applied 137 place count 1107 transition count 3458
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 274 place count 970 transition count 3458
Applied a total of 274 rules in 194 ms. Remains 970 /1107 variables (removed 137) and now considering 3458/2543 (removed -915) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 970/1107 places, 3458/2543 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Finished Best-First random walk after 1895 steps, including 7 resets, run visited all 1 properties in 7 ms. (steps per millisecond=270 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 (NOT p3)))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0) p3)), (F (AND p2 (NOT p0) (NOT p3))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3)))), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (OR (AND p1 (NOT p0) p3) (AND p2 (NOT p0) (NOT p3))))]
Knowledge based reduction with 15 factoid took 754 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1 p3), false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1 p3), false, (AND (NOT p0) p1 p3)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1 p3), false, (AND (NOT p0) p1 p3)]
Product exploration explored 100000 steps with 2717 reset in 529 ms.
Product exploration explored 100000 steps with 2721 reset in 561 ms.
Support contains 8 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Applied a total of 0 rules in 71 ms. Remains 1107 /1107 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2023-03-23 21:58:12] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:58:12] [INFO ] Invariant cache hit.
[2023-03-23 21:58:13] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-23 21:58:13] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:58:13] [INFO ] Invariant cache hit.
[2023-03-23 21:58:14] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 21:58:22] [INFO ] Implicit Places using invariants and state equation in 8736 ms returned []
Implicit Place search using SMT with State Equation took 9734 ms to find 0 implicit places.
[2023-03-23 21:58:22] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-23 21:58:22] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 21:58:22] [INFO ] Invariant cache hit.
[2023-03-23 21:58:23] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11077 ms. Remains : 1107/1107 places, 2543/2543 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00 finished in 66967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 1268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1268 transition count 2786
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 1249 transition count 2785
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 1248 transition count 2785
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 40 place count 1248 transition count 2767
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 76 place count 1230 transition count 2767
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 90 place count 1216 transition count 2729
Iterating global reduction 3 with 14 rules applied. Total rules applied 104 place count 1216 transition count 2729
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 104 place count 1216 transition count 2727
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 1214 transition count 2727
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 1208 transition count 2697
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 1208 transition count 2697
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 180 place count 1178 transition count 2667
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 188 place count 1170 transition count 2659
Iterating global reduction 3 with 8 rules applied. Total rules applied 196 place count 1170 transition count 2659
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 204 place count 1162 transition count 2619
Iterating global reduction 3 with 8 rules applied. Total rules applied 212 place count 1162 transition count 2619
Applied a total of 212 rules in 353 ms. Remains 1162 /1268 variables (removed 106) and now considering 2619/2805 (removed 186) transitions.
[2023-03-23 21:58:24] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1162 cols
[2023-03-23 21:58:24] [INFO ] Computed 65 place invariants in 25 ms
[2023-03-23 21:58:25] [INFO ] Implicit Places using invariants in 1021 ms returned [10, 320, 342, 395, 449, 450, 460, 507, 544, 593, 623, 630, 663, 678, 876, 877, 935, 958, 984]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1143/1268 places, 2619/2805 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1135 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1135 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1127 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1127 transition count 2603
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1121 transition count 2573
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1121 transition count 2573
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1116 transition count 2568
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1111 transition count 2563
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1111 transition count 2563
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 1106 transition count 2538
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 1106 transition count 2538
Applied a total of 74 rules in 299 ms. Remains 1106 /1143 variables (removed 37) and now considering 2538/2619 (removed 81) transitions.
[2023-03-23 21:58:26] [INFO ] Flow matrix only has 2266 transitions (discarded 272 similar events)
// Phase 1: matrix 2266 rows 1106 cols
[2023-03-23 21:58:26] [INFO ] Computed 46 place invariants in 36 ms
[2023-03-23 21:58:26] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-23 21:58:26] [INFO ] Flow matrix only has 2266 transitions (discarded 272 similar events)
[2023-03-23 21:58:26] [INFO ] Invariant cache hit.
[2023-03-23 21:58:27] [INFO ] State equation strengthened by 850 read => feed constraints.
[2023-03-23 21:58:36] [INFO ] Implicit Places using invariants and state equation in 9844 ms returned [1098]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10815 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1105/1268 places, 2538/2805 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1105 transition count 2537
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1104 transition count 2537
Applied a total of 2 rules in 77 ms. Remains 1104 /1105 variables (removed 1) and now considering 2537/2538 (removed 1) transitions.
[2023-03-23 21:58:36] [INFO ] Flow matrix only has 2265 transitions (discarded 272 similar events)
// Phase 1: matrix 2265 rows 1104 cols
[2023-03-23 21:58:36] [INFO ] Computed 45 place invariants in 22 ms
[2023-03-23 21:58:37] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-23 21:58:37] [INFO ] Flow matrix only has 2265 transitions (discarded 272 similar events)
[2023-03-23 21:58:37] [INFO ] Invariant cache hit.
[2023-03-23 21:58:38] [INFO ] State equation strengthened by 850 read => feed constraints.
[2023-03-23 21:58:47] [INFO ] Implicit Places using invariants and state equation in 9517 ms returned []
Implicit Place search using SMT with State Equation took 10511 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1104/1268 places, 2537/2805 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23081 ms. Remains : 1104/1268 places, 2537/2805 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s559 1) (GEQ s578 1)) (AND (GEQ s559 1) (GEQ s578 1) (GEQ s270 1) (GEQ s340 1) (GEQ s619 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-01 finished in 23196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1268 transition count 2786
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1249 transition count 2786
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 1249 transition count 2766
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 1229 transition count 2766
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 94 place count 1213 transition count 2726
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 1213 transition count 2726
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 110 place count 1213 transition count 2723
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 1210 transition count 2723
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 124 place count 1202 transition count 2683
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 1202 transition count 2683
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 190 place count 1173 transition count 2654
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 197 place count 1166 transition count 2647
Iterating global reduction 2 with 7 rules applied. Total rules applied 204 place count 1166 transition count 2647
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 211 place count 1159 transition count 2612
Iterating global reduction 2 with 7 rules applied. Total rules applied 218 place count 1159 transition count 2612
Applied a total of 218 rules in 308 ms. Remains 1159 /1268 variables (removed 109) and now considering 2612/2805 (removed 193) transitions.
[2023-03-23 21:58:47] [INFO ] Flow matrix only has 2340 transitions (discarded 272 similar events)
// Phase 1: matrix 2340 rows 1159 cols
[2023-03-23 21:58:47] [INFO ] Computed 65 place invariants in 21 ms
[2023-03-23 21:58:48] [INFO ] Implicit Places using invariants in 1048 ms returned [9, 263, 317, 339, 391, 445, 459, 506, 583, 593, 622, 629, 641, 659, 674, 872, 873, 931, 954, 980]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1139/1268 places, 2612/2805 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1130 transition count 2603
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1130 transition count 2603
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1121 transition count 2594
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1121 transition count 2594
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1115 transition count 2564
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1115 transition count 2564
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1110 transition count 2559
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1105 transition count 2554
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1105 transition count 2554
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1099 transition count 2524
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1099 transition count 2524
Applied a total of 80 rules in 297 ms. Remains 1099 /1139 variables (removed 40) and now considering 2524/2612 (removed 88) transitions.
[2023-03-23 21:58:49] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1099 cols
[2023-03-23 21:58:49] [INFO ] Computed 45 place invariants in 31 ms
[2023-03-23 21:58:50] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-23 21:58:50] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
[2023-03-23 21:58:50] [INFO ] Invariant cache hit.
[2023-03-23 21:58:50] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 21:58:58] [INFO ] Implicit Places using invariants and state equation in 8644 ms returned []
Implicit Place search using SMT with State Equation took 9615 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1099/1268 places, 2524/2805 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11272 ms. Remains : 1099/1268 places, 2524/2805 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s441 1) (GEQ s529 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-02 finished in 11340 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(G((X(X((F(p1)&&p0))) U p2)))))'
Support contains 6 out of 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1246 transition count 2767
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1246 transition count 2767
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 1229 transition count 2722
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 1229 transition count 2722
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 88 place count 1219 transition count 2672
Iterating global reduction 0 with 10 rules applied. Total rules applied 98 place count 1219 transition count 2672
Applied a total of 98 rules in 158 ms. Remains 1219 /1268 variables (removed 49) and now considering 2672/2805 (removed 133) transitions.
[2023-03-23 21:58:59] [INFO ] Flow matrix only has 2400 transitions (discarded 272 similar events)
// Phase 1: matrix 2400 rows 1219 cols
[2023-03-23 21:58:59] [INFO ] Computed 65 place invariants in 30 ms
[2023-03-23 21:59:00] [INFO ] Implicit Places using invariants in 1083 ms returned [11, 287, 341, 363, 418, 474, 475, 486, 537, 577, 617, 627, 659, 666, 680, 698, 715, 918, 919, 977, 1000, 1029]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1096 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1197/1268 places, 2672/2805 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1181 transition count 2656
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1181 transition count 2656
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1165 transition count 2640
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1165 transition count 2640
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1149 transition count 2624
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1149 transition count 2624
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 109 place count 1136 transition count 2559
Iterating global reduction 0 with 13 rules applied. Total rules applied 122 place count 1136 transition count 2559
Applied a total of 122 rules in 172 ms. Remains 1136 /1197 variables (removed 61) and now considering 2559/2672 (removed 113) transitions.
[2023-03-23 21:59:00] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1136 cols
[2023-03-23 21:59:00] [INFO ] Computed 43 place invariants in 24 ms
[2023-03-23 21:59:01] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-23 21:59:01] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
[2023-03-23 21:59:01] [INFO ] Invariant cache hit.
[2023-03-23 21:59:02] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 21:59:10] [INFO ] Implicit Places using invariants and state equation in 9594 ms returned []
Implicit Place search using SMT with State Equation took 10614 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1136/1268 places, 2559/2805 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12041 ms. Remains : 1136/1268 places, 2559/2805 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s456 1) (GEQ s1116 1)) (AND (GEQ s531 1) (GEQ s1108 1))), p0:(AND (GEQ s852 1) (GEQ s1122 1)), p1:(AND (GEQ s531 1) (GEQ s1108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-03 finished in 12248 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)||G(p1))))'
Support contains 3 out of 1268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1268 transition count 2785
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1248 transition count 2785
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 40 place count 1248 transition count 2765
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 1228 transition count 2765
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 95 place count 1213 transition count 2726
Iterating global reduction 2 with 15 rules applied. Total rules applied 110 place count 1213 transition count 2726
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 110 place count 1213 transition count 2723
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 1210 transition count 2723
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 123 place count 1203 transition count 2688
Iterating global reduction 2 with 7 rules applied. Total rules applied 130 place count 1203 transition count 2688
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 186 place count 1175 transition count 2660
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 195 place count 1166 transition count 2651
Iterating global reduction 2 with 9 rules applied. Total rules applied 204 place count 1166 transition count 2651
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 213 place count 1157 transition count 2606
Iterating global reduction 2 with 9 rules applied. Total rules applied 222 place count 1157 transition count 2606
Applied a total of 222 rules in 318 ms. Remains 1157 /1268 variables (removed 111) and now considering 2606/2805 (removed 199) transitions.
[2023-03-23 21:59:11] [INFO ] Flow matrix only has 2334 transitions (discarded 272 similar events)
// Phase 1: matrix 2334 rows 1157 cols
[2023-03-23 21:59:11] [INFO ] Computed 65 place invariants in 29 ms
[2023-03-23 21:59:12] [INFO ] Implicit Places using invariants in 1177 ms returned [9, 263, 317, 339, 391, 446, 447, 457, 504, 541, 578, 588, 617, 624, 636, 654, 669, 867, 929, 952, 978]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 1202 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1136/1268 places, 2606/2805 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1127 transition count 2597
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1127 transition count 2597
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1118 transition count 2588
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1118 transition count 2588
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 1111 transition count 2553
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 1111 transition count 2553
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1105 transition count 2547
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1099 transition count 2541
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1099 transition count 2541
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 1093 transition count 2511
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 1093 transition count 2511
Applied a total of 86 rules in 324 ms. Remains 1093 /1136 variables (removed 43) and now considering 2511/2606 (removed 95) transitions.
[2023-03-23 21:59:12] [INFO ] Flow matrix only has 2239 transitions (discarded 272 similar events)
// Phase 1: matrix 2239 rows 1093 cols
[2023-03-23 21:59:12] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-23 21:59:13] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-23 21:59:13] [INFO ] Flow matrix only has 2239 transitions (discarded 272 similar events)
[2023-03-23 21:59:13] [INFO ] Invariant cache hit.
[2023-03-23 21:59:14] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 21:59:23] [INFO ] Implicit Places using invariants and state equation in 9633 ms returned [1085]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10607 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1268 places, 2511/2805 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1092 transition count 2510
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 2510
Applied a total of 2 rules in 70 ms. Remains 1091 /1092 variables (removed 1) and now considering 2510/2511 (removed 1) transitions.
[2023-03-23 21:59:23] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1091 cols
[2023-03-23 21:59:23] [INFO ] Computed 43 place invariants in 18 ms
[2023-03-23 21:59:24] [INFO ] Implicit Places using invariants in 917 ms returned []
[2023-03-23 21:59:24] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2023-03-23 21:59:24] [INFO ] Invariant cache hit.
[2023-03-23 21:59:25] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 21:59:34] [INFO ] Implicit Places using invariants and state equation in 9767 ms returned []
Implicit Place search using SMT with State Equation took 10687 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1091/1268 places, 2510/2805 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23209 ms. Remains : 1091/1268 places, 2510/2805 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s400 1) (LT s836 1)), p1:(LT s835 1)], nbAcceptance=2, 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 2725 reset in 526 ms.
Product exploration explored 100000 steps with 2724 reset in 583 ms.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Detected a total of 275/1091 stabilizing places and 893/2510 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 441 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 21:59:36] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2023-03-23 21:59:36] [INFO ] Invariant cache hit.
[2023-03-23 21:59:36] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 21:59:36] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 21:59:37] [INFO ] After 1023ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 21:59:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 21:59:37] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 21:59:38] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 21:59:38] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 21:59:38] [INFO ] After 472ms SMT Verify possible using 834 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 21:59:39] [INFO ] Deduced a trap composed of 286 places in 472 ms of which 1 ms to minimize.
[2023-03-23 21:59:39] [INFO ] Deduced a trap composed of 117 places in 453 ms of which 1 ms to minimize.
[2023-03-23 21:59:40] [INFO ] Deduced a trap composed of 91 places in 454 ms of which 1 ms to minimize.
[2023-03-23 21:59:40] [INFO ] Deduced a trap composed of 74 places in 457 ms of which 1 ms to minimize.
[2023-03-23 21:59:41] [INFO ] Deduced a trap composed of 86 places in 444 ms of which 1 ms to minimize.
[2023-03-23 21:59:41] [INFO ] Deduced a trap composed of 72 places in 452 ms of which 1 ms to minimize.
[2023-03-23 21:59:42] [INFO ] Deduced a trap composed of 91 places in 441 ms of which 1 ms to minimize.
[2023-03-23 21:59:42] [INFO ] Deduced a trap composed of 78 places in 434 ms of which 1 ms to minimize.
[2023-03-23 21:59:43] [INFO ] Deduced a trap composed of 100 places in 430 ms of which 1 ms to minimize.
[2023-03-23 21:59:43] [INFO ] Deduced a trap composed of 78 places in 461 ms of which 1 ms to minimize.
[2023-03-23 21:59:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5277 ms
[2023-03-23 21:59:44] [INFO ] After 5837ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-23 21:59:44] [INFO ] After 6880ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2510/2510 transitions.
Free-agglomeration rule (complex) applied 124 times.
Iterating global reduction 0 with 124 rules applied. Total rules applied 124 place count 1091 transition count 3434
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 248 place count 967 transition count 3434
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 249 place count 967 transition count 3434
Applied a total of 249 rules in 254 ms. Remains 967 /1091 variables (removed 124) and now considering 3434/2510 (removed -924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 967/1091 places, 3434/2510 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76904 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76904 steps, saw 32191 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 21:59:47] [INFO ] Flow matrix only has 3044 transitions (discarded 390 similar events)
// Phase 1: matrix 3044 rows 967 cols
[2023-03-23 21:59:47] [INFO ] Computed 43 place invariants in 27 ms
[2023-03-23 21:59:47] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 21:59:47] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 21:59:48] [INFO ] After 1034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 21:59:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 21:59:48] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 21:59:49] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 21:59:49] [INFO ] State equation strengthened by 1882 read => feed constraints.
[2023-03-23 21:59:50] [INFO ] After 1164ms SMT Verify possible using 1882 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 21:59:50] [INFO ] After 1309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-23 21:59:51] [INFO ] After 2413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3434/3434 transitions.
Applied a total of 0 rules in 87 ms. Remains 967 /967 variables (removed 0) and now considering 3434/3434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 967/967 places, 3434/3434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3434/3434 transitions.
Applied a total of 0 rules in 78 ms. Remains 967 /967 variables (removed 0) and now considering 3434/3434 (removed 0) transitions.
[2023-03-23 21:59:51] [INFO ] Flow matrix only has 3044 transitions (discarded 390 similar events)
[2023-03-23 21:59:51] [INFO ] Invariant cache hit.
[2023-03-23 21:59:52] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2023-03-23 21:59:52] [INFO ] Flow matrix only has 3044 transitions (discarded 390 similar events)
[2023-03-23 21:59:52] [INFO ] Invariant cache hit.
[2023-03-23 21:59:53] [INFO ] State equation strengthened by 1882 read => feed constraints.
[2023-03-23 22:00:10] [INFO ] Implicit Places using invariants and state equation in 18512 ms returned []
Implicit Place search using SMT with State Equation took 19600 ms to find 0 implicit places.
[2023-03-23 22:00:11] [INFO ] Redundant transitions in 170 ms returned []
[2023-03-23 22:00:11] [INFO ] Flow matrix only has 3044 transitions (discarded 390 similar events)
[2023-03-23 22:00:11] [INFO ] Invariant cache hit.
[2023-03-23 22:00:12] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21216 ms. Remains : 967/967 places, 3434/3434 transitions.
Graph (trivial) has 1039 edges and 967 vertex of which 16 / 967 are part of one of the 1 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions removed 263 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 648 transitions.
Graph (complete) has 4002 edges and 952 vertex of which 938 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1242.t1445 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 921 transition count 2700
Reduce places removed 84 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 1 with 237 rules applied. Total rules applied 325 place count 837 transition count 2547
Reduce places removed 76 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 2 with 196 rules applied. Total rules applied 521 place count 761 transition count 2427
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 137 rules applied. Total rules applied 658 place count 710 transition count 2341
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 4 with 103 rules applied. Total rules applied 761 place count 668 transition count 2280
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 63 rules applied. Total rules applied 824 place count 642 transition count 2243
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 36 rules applied. Total rules applied 860 place count 624 transition count 2225
Reduce places removed 7 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 7 with 14 rules applied. Total rules applied 874 place count 617 transition count 2218
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 881 place count 610 transition count 2218
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 881 place count 610 transition count 2209
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 899 place count 601 transition count 2209
Discarding 219 places :
Symmetric choice reduction at 9 with 219 rule applications. Total rules 1118 place count 382 transition count 1182
Iterating global reduction 9 with 219 rules applied. Total rules applied 1337 place count 382 transition count 1182
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 185 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 9 with 189 rules applied. Total rules applied 1526 place count 382 transition count 993
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1530 place count 378 transition count 993
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1530 place count 378 transition count 992
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1532 place count 377 transition count 992
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1537 place count 372 transition count 986
Iterating global reduction 11 with 5 rules applied. Total rules applied 1542 place count 372 transition count 986
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1543 place count 371 transition count 985
Iterating global reduction 11 with 1 rules applied. Total rules applied 1544 place count 371 transition count 985
Performed 246 Post agglomeration using F-continuation condition.Transition count delta: 246
Deduced a syphon composed of 246 places in 0 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 11 with 492 rules applied. Total rules applied 2036 place count 125 transition count 739
Drop transitions removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Iterating post reduction 11 with 237 rules applied. Total rules applied 2273 place count 125 transition count 502
Discarding 55 places :
Symmetric choice reduction at 12 with 55 rule applications. Total rules 2328 place count 70 transition count 184
Iterating global reduction 12 with 55 rules applied. Total rules applied 2383 place count 70 transition count 184
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 2419 place count 70 transition count 148
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 2423 place count 66 transition count 130
Iterating global reduction 13 with 4 rules applied. Total rules applied 2427 place count 66 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2429 place count 65 transition count 137
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 13 with 14 rules applied. Total rules applied 2443 place count 65 transition count 123
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 3 rules applied. Total rules applied 2446 place count 65 transition count 120
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 4 rules applied. Total rules applied 2450 place count 62 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2451 place count 61 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2451 place count 61 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2453 place count 60 transition count 118
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2463 place count 50 transition count 68
Iterating global reduction 16 with 10 rules applied. Total rules applied 2473 place count 50 transition count 68
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 2486 place count 50 transition count 55
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 2488 place count 48 transition count 52
Iterating global reduction 17 with 2 rules applied. Total rules applied 2490 place count 48 transition count 52
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 2496 place count 48 transition count 46
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2502 place count 42 transition count 46
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 18 with 13 rules applied. Total rules applied 2515 place count 42 transition count 46
Applied a total of 2515 rules in 910 ms. Remains 42 /967 variables (removed 925) and now considering 46/3434 (removed 3388) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 42 cols
[2023-03-23 22:00:13] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-23 22:00:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 22:00:13] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 22:00:13] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:00:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 22:00:13] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 22:00:13] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:00:13] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 22:00:13] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 11 factoid took 538 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-04 finished in 62902 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))||G(p1)))'
Support contains 6 out of 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1244 transition count 2761
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1244 transition count 2761
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1227 transition count 2716
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1227 transition count 2716
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 1217 transition count 2666
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 1217 transition count 2666
Applied a total of 102 rules in 152 ms. Remains 1217 /1268 variables (removed 51) and now considering 2666/2805 (removed 139) transitions.
[2023-03-23 22:00:14] [INFO ] Flow matrix only has 2394 transitions (discarded 272 similar events)
// Phase 1: matrix 2394 rows 1217 cols
[2023-03-23 22:00:14] [INFO ] Computed 65 place invariants in 35 ms
[2023-03-23 22:00:15] [INFO ] Implicit Places using invariants in 1032 ms returned [11, 287, 341, 418, 474, 475, 485, 536, 575, 615, 625, 657, 664, 678, 696, 713, 916, 917, 975, 998]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1197/1268 places, 2666/2805 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1181 transition count 2650
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1181 transition count 2650
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1165 transition count 2634
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1165 transition count 2634
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1149 transition count 2618
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1149 transition count 2618
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 110 place count 1135 transition count 2548
Iterating global reduction 0 with 14 rules applied. Total rules applied 124 place count 1135 transition count 2548
Applied a total of 124 rules in 168 ms. Remains 1135 /1197 variables (removed 62) and now considering 2548/2666 (removed 118) transitions.
[2023-03-23 22:00:15] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1135 cols
[2023-03-23 22:00:15] [INFO ] Computed 45 place invariants in 29 ms
[2023-03-23 22:00:16] [INFO ] Implicit Places using invariants in 913 ms returned []
[2023-03-23 22:00:16] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
[2023-03-23 22:00:16] [INFO ] Invariant cache hit.
[2023-03-23 22:00:16] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 22:00:26] [INFO ] Implicit Places using invariants and state equation in 9793 ms returned [1122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10721 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1134/1268 places, 2548/2805 transitions.
Applied a total of 0 rules in 35 ms. Remains 1134 /1134 variables (removed 0) and now considering 2548/2548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12111 ms. Remains : 1134/1268 places, 2548/2805 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s667 1) (GEQ s1109 1)), p1:(OR (LT s2 1) (LT s355 1) (LT s356 1) (LT s961 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]]
Stuttering criterion allowed to conclude after 1352 steps with 25 reset in 14 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-05 finished in 12268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 6 out of 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1244 transition count 2757
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1244 transition count 2757
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1228 transition count 2717
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1228 transition count 2717
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 1218 transition count 2667
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 1218 transition count 2667
Applied a total of 100 rules in 150 ms. Remains 1218 /1268 variables (removed 50) and now considering 2667/2805 (removed 138) transitions.
[2023-03-23 22:00:26] [INFO ] Flow matrix only has 2395 transitions (discarded 272 similar events)
// Phase 1: matrix 2395 rows 1218 cols
[2023-03-23 22:00:26] [INFO ] Computed 65 place invariants in 24 ms
[2023-03-23 22:00:27] [INFO ] Implicit Places using invariants in 1178 ms returned [11, 287, 341, 363, 418, 475, 487, 538, 577, 617, 627, 659, 666, 680, 698, 715, 917, 918, 976, 999, 1028]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 1180 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1197/1268 places, 2667/2805 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1182 transition count 2652
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1182 transition count 2652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1167 transition count 2637
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1167 transition count 2637
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1152 transition count 2622
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1152 transition count 2622
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 103 place count 1139 transition count 2557
Iterating global reduction 0 with 13 rules applied. Total rules applied 116 place count 1139 transition count 2557
Applied a total of 116 rules in 168 ms. Remains 1139 /1197 variables (removed 58) and now considering 2557/2667 (removed 110) transitions.
[2023-03-23 22:00:27] [INFO ] Flow matrix only has 2285 transitions (discarded 272 similar events)
// Phase 1: matrix 2285 rows 1139 cols
[2023-03-23 22:00:27] [INFO ] Computed 44 place invariants in 27 ms
[2023-03-23 22:00:28] [INFO ] Implicit Places using invariants in 942 ms returned []
[2023-03-23 22:00:28] [INFO ] Flow matrix only has 2285 transitions (discarded 272 similar events)
[2023-03-23 22:00:28] [INFO ] Invariant cache hit.
[2023-03-23 22:00:29] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 22:00:38] [INFO ] Implicit Places using invariants and state equation in 9814 ms returned [1110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10758 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1138/1268 places, 2557/2805 transitions.
Applied a total of 0 rules in 33 ms. Remains 1138 /1138 variables (removed 0) and now considering 2557/2557 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12289 ms. Remains : 1138/1268 places, 2557/2805 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s859 1)) (AND (GEQ s422 1) (GEQ s1078 1))), p1:(OR (LT s457 1) (LT s472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-08 finished in 12422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1 U (p2||G(p1))) U X(p3)))))'
Support contains 9 out of 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1245 transition count 2758
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1245 transition count 2758
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 1229 transition count 2714
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 1229 transition count 2714
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1221 transition count 2674
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1221 transition count 2674
Applied a total of 94 rules in 138 ms. Remains 1221 /1268 variables (removed 47) and now considering 2674/2805 (removed 131) transitions.
[2023-03-23 22:00:38] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1221 cols
[2023-03-23 22:00:38] [INFO ] Computed 65 place invariants in 27 ms
[2023-03-23 22:00:39] [INFO ] Implicit Places using invariants in 1069 ms returned [11, 287, 341, 363, 418, 474, 475, 485, 536, 575, 615, 625, 657, 664, 678, 696, 979, 1031]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1203/1268 places, 2674/2805 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1189 transition count 2660
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1189 transition count 2660
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1175 transition count 2646
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1175 transition count 2646
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1161 transition count 2632
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1161 transition count 2632
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1148 transition count 2567
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1148 transition count 2567
Applied a total of 110 rules in 170 ms. Remains 1148 /1203 variables (removed 55) and now considering 2567/2674 (removed 107) transitions.
[2023-03-23 22:00:40] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1148 cols
[2023-03-23 22:00:40] [INFO ] Computed 47 place invariants in 28 ms
[2023-03-23 22:00:41] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-23 22:00:41] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
[2023-03-23 22:00:41] [INFO ] Invariant cache hit.
[2023-03-23 22:00:41] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 22:00:51] [INFO ] Implicit Places using invariants and state equation in 10469 ms returned [1135]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11445 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1268 places, 2567/2805 transitions.
Applied a total of 0 rules in 40 ms. Remains 1147 /1147 variables (removed 0) and now considering 2567/2567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12864 ms. Remains : 1147/1268 places, 2567/2805 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s871 1) (GEQ s969 1)) (AND (GEQ s262 1) (GEQ s360 1))), p2:(AND (NOT (AND (GEQ s262 1) (GEQ s360 1))) (LT s898 1)), p1:(LT s898 1), p3:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-10 finished in 13129 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((X(p0)||(p0&&X(p1))))))'
Support contains 3 out of 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1245 transition count 2762
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1245 transition count 2762
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 1229 transition count 2718
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 1229 transition count 2718
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 1220 transition count 2673
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 1220 transition count 2673
Applied a total of 96 rules in 146 ms. Remains 1220 /1268 variables (removed 48) and now considering 2673/2805 (removed 132) transitions.
[2023-03-23 22:00:51] [INFO ] Flow matrix only has 2401 transitions (discarded 272 similar events)
// Phase 1: matrix 2401 rows 1220 cols
[2023-03-23 22:00:51] [INFO ] Computed 65 place invariants in 27 ms
[2023-03-23 22:00:53] [INFO ] Implicit Places using invariants in 1083 ms returned [290, 344, 366, 421, 477, 478, 488, 539, 579, 619, 629, 661, 668, 682, 700, 717, 919, 920, 978, 1001, 1030]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1199/1268 places, 2673/2805 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1184 transition count 2658
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1184 transition count 2658
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1169 transition count 2643
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1169 transition count 2643
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1154 transition count 2628
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1154 transition count 2628
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 103 place count 1141 transition count 2563
Iterating global reduction 0 with 13 rules applied. Total rules applied 116 place count 1141 transition count 2563
Applied a total of 116 rules in 181 ms. Remains 1141 /1199 variables (removed 58) and now considering 2563/2673 (removed 110) transitions.
[2023-03-23 22:00:53] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1141 cols
[2023-03-23 22:00:53] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-23 22:00:54] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-23 22:00:54] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
[2023-03-23 22:00:54] [INFO ] Invariant cache hit.
[2023-03-23 22:00:54] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 22:01:03] [INFO ] Implicit Places using invariants and state equation in 9720 ms returned [1128]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10717 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1140/1268 places, 2563/2805 transitions.
Applied a total of 0 rules in 34 ms. Remains 1140 /1140 variables (removed 0) and now considering 2563/2563 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12176 ms. Remains : 1140/1268 places, 2563/2805 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 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: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s22 1), p1:(OR (AND (GEQ s547 1) (GEQ s1106 1)) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-11 finished in 12337 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 2 out of 1268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1268 transition count 2784
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1247 transition count 2784
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 42 place count 1247 transition count 2764
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 82 place count 1227 transition count 2764
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 98 place count 1211 transition count 2724
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 1211 transition count 2724
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 114 place count 1211 transition count 2721
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 1208 transition count 2721
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 128 place count 1200 transition count 2681
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 1200 transition count 2681
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 192 place count 1172 transition count 2653
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 201 place count 1163 transition count 2644
Iterating global reduction 2 with 9 rules applied. Total rules applied 210 place count 1163 transition count 2644
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 1154 transition count 2599
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 1154 transition count 2599
Applied a total of 228 rules in 310 ms. Remains 1154 /1268 variables (removed 114) and now considering 2599/2805 (removed 206) transitions.
[2023-03-23 22:01:04] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1154 cols
[2023-03-23 22:01:04] [INFO ] Computed 65 place invariants in 26 ms
[2023-03-23 22:01:05] [INFO ] Implicit Places using invariants in 1009 ms returned [9, 263, 317, 339, 391, 446, 447, 457, 504, 541, 578, 588, 617, 624, 636, 654, 669, 867, 868, 926, 949, 975]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1021 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1132/1268 places, 2599/2805 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1122 transition count 2589
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1122 transition count 2589
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1112 transition count 2579
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1112 transition count 2579
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1105 transition count 2544
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1105 transition count 2544
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 1099 transition count 2538
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 1093 transition count 2532
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 1093 transition count 2532
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 1086 transition count 2497
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 1086 transition count 2497
Applied a total of 92 rules in 332 ms. Remains 1086 /1132 variables (removed 46) and now considering 2497/2599 (removed 102) transitions.
[2023-03-23 22:01:05] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
// Phase 1: matrix 2225 rows 1086 cols
[2023-03-23 22:01:05] [INFO ] Computed 43 place invariants in 31 ms
[2023-03-23 22:01:06] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-23 22:01:06] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
[2023-03-23 22:01:06] [INFO ] Invariant cache hit.
[2023-03-23 22:01:07] [INFO ] State equation strengthened by 826 read => feed constraints.
[2023-03-23 22:01:15] [INFO ] Implicit Places using invariants and state equation in 8980 ms returned [1065, 1078]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9987 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1084/1268 places, 2497/2805 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1084 transition count 2495
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1082 transition count 2495
Applied a total of 4 rules in 73 ms. Remains 1082 /1084 variables (removed 2) and now considering 2495/2497 (removed 2) transitions.
[2023-03-23 22:01:15] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
// Phase 1: matrix 2223 rows 1082 cols
[2023-03-23 22:01:15] [INFO ] Computed 41 place invariants in 26 ms
[2023-03-23 22:01:17] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2023-03-23 22:01:17] [INFO ] Flow matrix only has 2223 transitions (discarded 272 similar events)
[2023-03-23 22:01:17] [INFO ] Invariant cache hit.
[2023-03-23 22:01:17] [INFO ] State equation strengthened by 826 read => feed constraints.
[2023-03-23 22:01:25] [INFO ] Implicit Places using invariants and state equation in 8580 ms returned []
Implicit Place search using SMT with State Equation took 9732 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1268 places, 2495/2805 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21460 ms. Remains : 1082/1268 places, 2495/2805 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s400 1) (GEQ s603 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 35 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-13 finished in 21520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 10 out of 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1245 transition count 2758
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1245 transition count 2758
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 1230 transition count 2719
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 1230 transition count 2719
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 1221 transition count 2674
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 1221 transition count 2674
Applied a total of 94 rules in 140 ms. Remains 1221 /1268 variables (removed 47) and now considering 2674/2805 (removed 131) transitions.
[2023-03-23 22:01:25] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1221 cols
[2023-03-23 22:01:25] [INFO ] Computed 65 place invariants in 56 ms
[2023-03-23 22:01:26] [INFO ] Implicit Places using invariants in 1069 ms returned [11, 344, 366, 421, 477, 478, 488, 580, 620, 630, 662, 683, 701, 718, 920, 921, 979, 1002]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1099 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1203/1268 places, 2674/2805 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1189 transition count 2660
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1189 transition count 2660
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1175 transition count 2646
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1175 transition count 2646
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1161 transition count 2632
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1161 transition count 2632
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 96 place count 1149 transition count 2572
Iterating global reduction 0 with 12 rules applied. Total rules applied 108 place count 1149 transition count 2572
Applied a total of 108 rules in 174 ms. Remains 1149 /1203 variables (removed 54) and now considering 2572/2674 (removed 102) transitions.
[2023-03-23 22:01:27] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1149 cols
[2023-03-23 22:01:27] [INFO ] Computed 47 place invariants in 67 ms
[2023-03-23 22:01:28] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2023-03-23 22:01:28] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2023-03-23 22:01:28] [INFO ] Invariant cache hit.
[2023-03-23 22:01:28] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 22:01:38] [INFO ] Implicit Places using invariants and state equation in 10527 ms returned [1136]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11621 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1148/1268 places, 2572/2805 transitions.
Applied a total of 0 rules in 33 ms. Remains 1148 /1148 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13069 ms. Remains : 1148/1268 places, 2572/2805 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s287 1) (AND (GEQ s2 1) (GEQ s634 1) (GEQ s635 1) (GEQ s973 1)) (AND (GEQ s524 1) (GEQ s541 1))), p1:(AND (GEQ s591 1) (GEQ s673 1) (GEQ s676 ...], 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 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-14 finished in 13150 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 1268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1268/1268 places, 2805/2805 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1243 transition count 2756
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1243 transition count 2756
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1226 transition count 2711
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1226 transition count 2711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1216 transition count 2661
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1216 transition count 2661
Applied a total of 104 rules in 143 ms. Remains 1216 /1268 variables (removed 52) and now considering 2661/2805 (removed 144) transitions.
[2023-03-23 22:01:38] [INFO ] Flow matrix only has 2389 transitions (discarded 272 similar events)
// Phase 1: matrix 2389 rows 1216 cols
[2023-03-23 22:01:38] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-23 22:01:40] [INFO ] Implicit Places using invariants in 1046 ms returned [11, 287, 341, 363, 418, 474, 475, 485, 536, 575, 615, 625, 657, 664, 678, 696, 713, 915, 916, 974, 997, 1026]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1194/1268 places, 2661/2805 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1178 transition count 2645
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1178 transition count 2645
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1162 transition count 2629
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1162 transition count 2629
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1146 transition count 2613
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1146 transition count 2613
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 110 place count 1132 transition count 2543
Iterating global reduction 0 with 14 rules applied. Total rules applied 124 place count 1132 transition count 2543
Applied a total of 124 rules in 168 ms. Remains 1132 /1194 variables (removed 62) and now considering 2543/2661 (removed 118) transitions.
[2023-03-23 22:01:40] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1132 cols
[2023-03-23 22:01:40] [INFO ] Computed 43 place invariants in 28 ms
[2023-03-23 22:01:41] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-23 22:01:41] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 22:01:41] [INFO ] Invariant cache hit.
[2023-03-23 22:01:41] [INFO ] State equation strengthened by 826 read => feed constraints.
[2023-03-23 22:01:50] [INFO ] Implicit Places using invariants and state equation in 8993 ms returned [1104, 1119]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9970 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1130/1268 places, 2543/2805 transitions.
Applied a total of 0 rules in 40 ms. Remains 1130 /1130 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11371 ms. Remains : 1130/1268 places, 2543/2805 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 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 (LT s598 1) (LT s1023 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 811 ms.
Product exploration explored 100000 steps with 33333 reset in 832 ms.
Computed a total of 298 stabilizing places and 910 stable transitions
Computed a total of 298 stabilizing places and 910 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 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-15 finished in 13213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2)))))))))))'
[2023-03-23 22:01:52] [INFO ] Flatten gal took : 110 ms
[2023-03-23 22:01:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-23 22:01:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1268 places, 2805 transitions and 12407 arcs took 22 ms.
Total runtime 408749 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1649/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00
BK_STOP 1679608914778
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name MultiCrashLeafsetExtension-PT-S16C05-LTLFireability-00
ltl formula formula --ltl=/tmp/1649/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 1268 places, 2805 transitions and 12407 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.060 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1649/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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:
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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;