About the Execution of LoLa+red for Peterson-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1836.787 | 586976.00 | 705664.00 | 1858.20 | TF?FFFFFFFFFTFTF | 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.r263-smll-167863538400580.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Peterson-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538400580
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 45K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-5-LTLFireability-00
FORMULA_NAME Peterson-COL-5-LTLFireability-01
FORMULA_NAME Peterson-COL-5-LTLFireability-02
FORMULA_NAME Peterson-COL-5-LTLFireability-03
FORMULA_NAME Peterson-COL-5-LTLFireability-04
FORMULA_NAME Peterson-COL-5-LTLFireability-05
FORMULA_NAME Peterson-COL-5-LTLFireability-06
FORMULA_NAME Peterson-COL-5-LTLFireability-07
FORMULA_NAME Peterson-COL-5-LTLFireability-08
FORMULA_NAME Peterson-COL-5-LTLFireability-09
FORMULA_NAME Peterson-COL-5-LTLFireability-10
FORMULA_NAME Peterson-COL-5-LTLFireability-11
FORMULA_NAME Peterson-COL-5-LTLFireability-12
FORMULA_NAME Peterson-COL-5-LTLFireability-13
FORMULA_NAME Peterson-COL-5-LTLFireability-14
FORMULA_NAME Peterson-COL-5-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678846955114
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 02:22:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 02:22:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:22:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 02:22:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 02:22:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 783 ms
[2023-03-15 02:22:38] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 02:22:39] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2023-03-15 02:22:39] [INFO ] Skeletonized 12 HLPN properties in 2 ms. Removed 4 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-5-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1856 steps, including 0 resets, run visited all 10 properties in 56 ms. (steps per millisecond=33 )
[2023-03-15 02:22:39] [INFO ] Flatten gal took : 28 ms
[2023-03-15 02:22:39] [INFO ] Flatten gal took : 5 ms
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 02:22:39] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 106 ms.
[2023-03-15 02:22:39] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 30 places in 12 ms
Reduce places removed 30 places and 60 transitions.
FORMULA Peterson-COL-5-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:22:39] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:22:39] [INFO ] Computed 23 place invariants in 60 ms
[2023-03-15 02:22:40] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-15 02:22:40] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:22:40] [INFO ] Invariant cache hit.
[2023-03-15 02:22:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:22:41] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2023-03-15 02:22:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:22:41] [INFO ] Invariant cache hit.
[2023-03-15 02:22:42] [INFO ] Dead Transitions using invariants and state equation in 1163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2607 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2023-03-15 02:22:42] [INFO ] Flatten gal took : 140 ms
[2023-03-15 02:22:42] [INFO ] Flatten gal took : 173 ms
[2023-03-15 02:22:43] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1001 ms. (steps per millisecond=9 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:22:45] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:22:45] [INFO ] Invariant cache hit.
[2023-03-15 02:22:45] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2023-03-15 02:22:45] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 16 ms returned sat
[2023-03-15 02:22:47] [INFO ] After 1665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:22:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 46 ms returned sat
[2023-03-15 02:22:47] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2023-03-15 02:22:49] [INFO ] After 1538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:22:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:22:50] [INFO ] After 1343ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:22:51] [INFO ] Deduced a trap composed of 37 places in 633 ms of which 8 ms to minimize.
[2023-03-15 02:22:51] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 2 ms to minimize.
[2023-03-15 02:22:52] [INFO ] Deduced a trap composed of 22 places in 890 ms of which 3 ms to minimize.
[2023-03-15 02:22:53] [INFO ] Deduced a trap composed of 15 places in 585 ms of which 1 ms to minimize.
[2023-03-15 02:22:54] [INFO ] Deduced a trap composed of 28 places in 776 ms of which 2 ms to minimize.
[2023-03-15 02:22:54] [INFO ] Deduced a trap composed of 27 places in 723 ms of which 2 ms to minimize.
[2023-03-15 02:22:55] [INFO ] Deduced a trap composed of 164 places in 586 ms of which 2 ms to minimize.
[2023-03-15 02:22:56] [INFO ] Deduced a trap composed of 52 places in 492 ms of which 1 ms to minimize.
[2023-03-15 02:22:56] [INFO ] Deduced a trap composed of 22 places in 620 ms of which 1 ms to minimize.
[2023-03-15 02:22:57] [INFO ] Deduced a trap composed of 75 places in 626 ms of which 2 ms to minimize.
[2023-03-15 02:22:58] [INFO ] Deduced a trap composed of 87 places in 743 ms of which 1 ms to minimize.
[2023-03-15 02:22:59] [INFO ] Deduced a trap composed of 95 places in 752 ms of which 2 ms to minimize.
[2023-03-15 02:22:59] [INFO ] Deduced a trap composed of 37 places in 610 ms of which 1 ms to minimize.
[2023-03-15 02:23:00] [INFO ] Deduced a trap composed of 23 places in 734 ms of which 1 ms to minimize.
[2023-03-15 02:23:01] [INFO ] Deduced a trap composed of 132 places in 569 ms of which 2 ms to minimize.
[2023-03-15 02:23:01] [INFO ] Deduced a trap composed of 74 places in 594 ms of which 1 ms to minimize.
[2023-03-15 02:23:02] [INFO ] Deduced a trap composed of 149 places in 590 ms of which 1 ms to minimize.
[2023-03-15 02:23:03] [INFO ] Deduced a trap composed of 63 places in 528 ms of which 1 ms to minimize.
[2023-03-15 02:23:03] [INFO ] Deduced a trap composed of 63 places in 577 ms of which 1 ms to minimize.
[2023-03-15 02:23:04] [INFO ] Deduced a trap composed of 37 places in 607 ms of which 1 ms to minimize.
[2023-03-15 02:23:05] [INFO ] Deduced a trap composed of 119 places in 584 ms of which 1 ms to minimize.
[2023-03-15 02:23:05] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 1 ms to minimize.
[2023-03-15 02:23:05] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 1 ms to minimize.
[2023-03-15 02:23:06] [INFO ] Deduced a trap composed of 71 places in 607 ms of which 1 ms to minimize.
[2023-03-15 02:23:07] [INFO ] Deduced a trap composed of 71 places in 563 ms of which 1 ms to minimize.
[2023-03-15 02:23:07] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 2 ms to minimize.
[2023-03-15 02:23:07] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
[2023-03-15 02:23:08] [INFO ] Deduced a trap composed of 18 places in 713 ms of which 2 ms to minimize.
[2023-03-15 02:23:09] [INFO ] Deduced a trap composed of 43 places in 657 ms of which 1 ms to minimize.
[2023-03-15 02:23:10] [INFO ] Deduced a trap composed of 37 places in 631 ms of which 1 ms to minimize.
[2023-03-15 02:23:10] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 1 ms to minimize.
[2023-03-15 02:23:11] [INFO ] Deduced a trap composed of 18 places in 455 ms of which 2 ms to minimize.
[2023-03-15 02:23:11] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 1 ms to minimize.
[2023-03-15 02:23:11] [INFO ] Deduced a trap composed of 71 places in 415 ms of which 3 ms to minimize.
[2023-03-15 02:23:12] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 21630 ms
[2023-03-15 02:23:12] [INFO ] After 23032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 02:23:12] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 108 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 484 transition count 892
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 700 place count 484 transition count 737
Deduced a syphon composed of 155 places in 2 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 1010 place count 329 transition count 737
Applied a total of 1010 rules in 157 ms. Remains 329 /834 variables (removed 505) and now considering 737/1242 (removed 505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 329/834 places, 737/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Finished probabilistic random walk after 357 steps, run visited all 3 properties in 34 ms. (steps per millisecond=10 )
Probabilistic random walk after 357 steps, saw 308 distinct states, run finished after 34 ms. (steps per millisecond=10 ) properties seen :3
FORMULA Peterson-COL-5-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(!p1 U (p2||G(!p1))))))))'
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 56 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:23:14] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:23:14] [INFO ] Invariant cache hit.
[2023-03-15 02:23:14] [INFO ] Implicit Places using invariants in 550 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 560 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 458 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (OR (AND (GEQ s59 1) (GEQ s99 1)) (AND (GEQ s42 1) (GEQ s72 1)) (AND (GEQ s63 1) (GEQ s90 1)) (AND (GEQ s48 1) (GEQ s73 1)) (AND (GEQ s62 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 812 ms.
Product exploration explored 100000 steps with 0 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:23:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 02:23:18] [INFO ] Computed 17 place invariants in 10 ms
[2023-03-15 02:23:19] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 02:23:19] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:23:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 02:23:24] [INFO ] After 4699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:23:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:23:28] [INFO ] After 4145ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:23:30] [INFO ] Deduced a trap composed of 15 places in 686 ms of which 5 ms to minimize.
[2023-03-15 02:23:31] [INFO ] Deduced a trap composed of 137 places in 817 ms of which 2 ms to minimize.
[2023-03-15 02:23:32] [INFO ] Deduced a trap composed of 11 places in 796 ms of which 2 ms to minimize.
[2023-03-15 02:23:33] [INFO ] Deduced a trap composed of 41 places in 619 ms of which 2 ms to minimize.
[2023-03-15 02:23:34] [INFO ] Deduced a trap composed of 53 places in 687 ms of which 2 ms to minimize.
[2023-03-15 02:23:34] [INFO ] Deduced a trap composed of 43 places in 686 ms of which 4 ms to minimize.
[2023-03-15 02:23:35] [INFO ] Deduced a trap composed of 80 places in 647 ms of which 2 ms to minimize.
[2023-03-15 02:23:36] [INFO ] Deduced a trap composed of 133 places in 661 ms of which 2 ms to minimize.
[2023-03-15 02:23:37] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 1 ms to minimize.
[2023-03-15 02:23:37] [INFO ] Deduced a trap composed of 96 places in 604 ms of which 1 ms to minimize.
[2023-03-15 02:23:38] [INFO ] Deduced a trap composed of 115 places in 515 ms of which 2 ms to minimize.
[2023-03-15 02:23:39] [INFO ] Deduced a trap composed of 79 places in 584 ms of which 1 ms to minimize.
[2023-03-15 02:23:39] [INFO ] Deduced a trap composed of 115 places in 450 ms of which 1 ms to minimize.
[2023-03-15 02:23:40] [INFO ] Deduced a trap composed of 41 places in 542 ms of which 1 ms to minimize.
[2023-03-15 02:23:41] [INFO ] Deduced a trap composed of 63 places in 414 ms of which 2 ms to minimize.
[2023-03-15 02:23:41] [INFO ] Deduced a trap composed of 104 places in 452 ms of which 1 ms to minimize.
[2023-03-15 02:23:42] [INFO ] Deduced a trap composed of 46 places in 557 ms of which 1 ms to minimize.
[2023-03-15 02:23:43] [INFO ] Deduced a trap composed of 96 places in 488 ms of which 1 ms to minimize.
[2023-03-15 02:23:43] [INFO ] Deduced a trap composed of 71 places in 653 ms of which 2 ms to minimize.
[2023-03-15 02:23:44] [INFO ] Deduced a trap composed of 91 places in 639 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:23:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:23:44] [INFO ] After 25426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 143 ms.
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 828 transition count 1067
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 350 place count 653 transition count 1067
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 350 place count 653 transition count 1037
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 410 place count 623 transition count 1037
Applied a total of 410 rules in 133 ms. Remains 623 /828 variables (removed 205) and now considering 1037/1242 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 623/828 places, 1037/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 223902 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223902 steps, saw 67627 distinct states, run finished after 3007 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:23:48] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 02:23:48] [INFO ] Computed 17 place invariants in 8 ms
[2023-03-15 02:23:49] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 02:23:49] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:23:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-15 02:23:54] [INFO ] After 4719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:23:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:23:58] [INFO ] After 4200ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:24:00] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 1 ms to minimize.
[2023-03-15 02:24:01] [INFO ] Deduced a trap composed of 24 places in 485 ms of which 1 ms to minimize.
[2023-03-15 02:24:02] [INFO ] Deduced a trap composed of 37 places in 494 ms of which 8 ms to minimize.
[2023-03-15 02:24:02] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 1 ms to minimize.
[2023-03-15 02:24:03] [INFO ] Deduced a trap composed of 30 places in 432 ms of which 1 ms to minimize.
[2023-03-15 02:24:03] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 1 ms to minimize.
[2023-03-15 02:24:04] [INFO ] Deduced a trap composed of 10 places in 445 ms of which 1 ms to minimize.
[2023-03-15 02:24:04] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 1 ms to minimize.
[2023-03-15 02:24:05] [INFO ] Deduced a trap composed of 48 places in 431 ms of which 1 ms to minimize.
[2023-03-15 02:24:05] [INFO ] Deduced a trap composed of 62 places in 301 ms of which 2 ms to minimize.
[2023-03-15 02:24:06] [INFO ] Deduced a trap composed of 48 places in 449 ms of which 1 ms to minimize.
[2023-03-15 02:24:06] [INFO ] Deduced a trap composed of 62 places in 306 ms of which 1 ms to minimize.
[2023-03-15 02:24:07] [INFO ] Deduced a trap composed of 23 places in 517 ms of which 2 ms to minimize.
[2023-03-15 02:24:07] [INFO ] Deduced a trap composed of 16 places in 377 ms of which 1 ms to minimize.
[2023-03-15 02:24:08] [INFO ] Deduced a trap composed of 70 places in 376 ms of which 2 ms to minimize.
[2023-03-15 02:24:08] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 2 ms to minimize.
[2023-03-15 02:24:09] [INFO ] Deduced a trap composed of 26 places in 469 ms of which 1 ms to minimize.
[2023-03-15 02:24:09] [INFO ] Deduced a trap composed of 60 places in 487 ms of which 1 ms to minimize.
[2023-03-15 02:24:10] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 1 ms to minimize.
[2023-03-15 02:24:10] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 1 ms to minimize.
[2023-03-15 02:24:10] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 0 ms to minimize.
[2023-03-15 02:24:11] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10473 ms
[2023-03-15 02:24:13] [INFO ] Deduced a trap composed of 53 places in 584 ms of which 1 ms to minimize.
[2023-03-15 02:24:13] [INFO ] Deduced a trap composed of 57 places in 548 ms of which 1 ms to minimize.
[2023-03-15 02:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2079 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:24:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:24:14] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 170 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 48 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 45 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:24:14] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:24:14] [INFO ] Invariant cache hit.
[2023-03-15 02:24:15] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-15 02:24:15] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:24:15] [INFO ] Invariant cache hit.
[2023-03-15 02:24:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:24:17] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
[2023-03-15 02:24:17] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-15 02:24:17] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:24:17] [INFO ] Invariant cache hit.
[2023-03-15 02:24:18] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3433 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
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 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 160 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 02:24:18] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-15 02:24:19] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 02:24:19] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:24:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 02:24:24] [INFO ] After 4756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:24:27] [INFO ] After 7970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3171 ms.
[2023-03-15 02:24:30] [INFO ] After 11309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 374 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 29 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:24:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 02:24:31] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 02:24:31] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-15 02:24:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:24:31] [INFO ] Invariant cache hit.
[2023-03-15 02:24:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:24:34] [INFO ] Implicit Places using invariants and state equation in 3240 ms returned []
Implicit Place search using SMT with State Equation took 3519 ms to find 0 implicit places.
[2023-03-15 02:24:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:24:34] [INFO ] Invariant cache hit.
[2023-03-15 02:24:36] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4872 ms. Remains : 828/828 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:24:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:24:37] [INFO ] Invariant cache hit.
[2023-03-15 02:24:38] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 02:24:38] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:24:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 02:24:43] [INFO ] After 4680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:24:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:24:47] [INFO ] After 4210ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:24:49] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 2 ms to minimize.
[2023-03-15 02:24:50] [INFO ] Deduced a trap composed of 16 places in 445 ms of which 1 ms to minimize.
[2023-03-15 02:24:51] [INFO ] Deduced a trap composed of 22 places in 640 ms of which 1 ms to minimize.
[2023-03-15 02:24:51] [INFO ] Deduced a trap composed of 19 places in 580 ms of which 1 ms to minimize.
[2023-03-15 02:24:52] [INFO ] Deduced a trap composed of 78 places in 666 ms of which 2 ms to minimize.
[2023-03-15 02:24:53] [INFO ] Deduced a trap composed of 22 places in 544 ms of which 1 ms to minimize.
[2023-03-15 02:24:54] [INFO ] Deduced a trap composed of 36 places in 648 ms of which 1 ms to minimize.
[2023-03-15 02:24:55] [INFO ] Deduced a trap composed of 64 places in 625 ms of which 1 ms to minimize.
[2023-03-15 02:24:56] [INFO ] Deduced a trap composed of 105 places in 647 ms of which 1 ms to minimize.
[2023-03-15 02:24:56] [INFO ] Deduced a trap composed of 86 places in 626 ms of which 1 ms to minimize.
[2023-03-15 02:24:57] [INFO ] Deduced a trap composed of 71 places in 637 ms of which 1 ms to minimize.
[2023-03-15 02:24:58] [INFO ] Deduced a trap composed of 83 places in 568 ms of which 1 ms to minimize.
[2023-03-15 02:24:59] [INFO ] Deduced a trap composed of 48 places in 665 ms of which 2 ms to minimize.
[2023-03-15 02:24:59] [INFO ] Deduced a trap composed of 123 places in 617 ms of which 2 ms to minimize.
[2023-03-15 02:25:00] [INFO ] Deduced a trap composed of 159 places in 576 ms of which 1 ms to minimize.
[2023-03-15 02:25:01] [INFO ] Deduced a trap composed of 52 places in 614 ms of which 2 ms to minimize.
[2023-03-15 02:25:02] [INFO ] Deduced a trap composed of 47 places in 642 ms of which 1 ms to minimize.
[2023-03-15 02:25:03] [INFO ] Deduced a trap composed of 80 places in 533 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:25:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:25:03] [INFO ] After 25514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 60 ms.
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 828 transition count 1067
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 350 place count 653 transition count 1067
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 350 place count 653 transition count 1037
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 410 place count 623 transition count 1037
Applied a total of 410 rules in 100 ms. Remains 623 /828 variables (removed 205) and now considering 1037/1242 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 623/828 places, 1037/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 151816 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151816 steps, saw 56842 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:25:07] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 02:25:07] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 02:25:08] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 02:25:08] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:25:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 02:25:13] [INFO ] After 4497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:25:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:25:17] [INFO ] After 4004ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:25:19] [INFO ] Deduced a trap composed of 15 places in 497 ms of which 1 ms to minimize.
[2023-03-15 02:25:20] [INFO ] Deduced a trap composed of 24 places in 464 ms of which 1 ms to minimize.
[2023-03-15 02:25:20] [INFO ] Deduced a trap composed of 37 places in 449 ms of which 2 ms to minimize.
[2023-03-15 02:25:21] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 1 ms to minimize.
[2023-03-15 02:25:21] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 1 ms to minimize.
[2023-03-15 02:25:22] [INFO ] Deduced a trap composed of 69 places in 402 ms of which 1 ms to minimize.
[2023-03-15 02:25:22] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 1 ms to minimize.
[2023-03-15 02:25:23] [INFO ] Deduced a trap composed of 56 places in 436 ms of which 1 ms to minimize.
[2023-03-15 02:25:23] [INFO ] Deduced a trap composed of 48 places in 447 ms of which 1 ms to minimize.
[2023-03-15 02:25:24] [INFO ] Deduced a trap composed of 62 places in 448 ms of which 1 ms to minimize.
[2023-03-15 02:25:24] [INFO ] Deduced a trap composed of 48 places in 450 ms of which 1 ms to minimize.
[2023-03-15 02:25:25] [INFO ] Deduced a trap composed of 62 places in 411 ms of which 1 ms to minimize.
[2023-03-15 02:25:26] [INFO ] Deduced a trap composed of 23 places in 527 ms of which 1 ms to minimize.
[2023-03-15 02:25:26] [INFO ] Deduced a trap composed of 16 places in 485 ms of which 1 ms to minimize.
[2023-03-15 02:25:27] [INFO ] Deduced a trap composed of 70 places in 510 ms of which 1 ms to minimize.
[2023-03-15 02:25:27] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 2 ms to minimize.
[2023-03-15 02:25:28] [INFO ] Deduced a trap composed of 26 places in 461 ms of which 1 ms to minimize.
[2023-03-15 02:25:29] [INFO ] Deduced a trap composed of 60 places in 468 ms of which 2 ms to minimize.
[2023-03-15 02:25:29] [INFO ] Deduced a trap composed of 51 places in 363 ms of which 1 ms to minimize.
[2023-03-15 02:25:30] [INFO ] Deduced a trap composed of 51 places in 373 ms of which 1 ms to minimize.
[2023-03-15 02:25:30] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2023-03-15 02:25:30] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 11519 ms
[2023-03-15 02:25:32] [INFO ] Deduced a trap composed of 53 places in 382 ms of which 1 ms to minimize.
[2023-03-15 02:25:33] [INFO ] Deduced a trap composed of 57 places in 502 ms of which 1 ms to minimize.
[2023-03-15 02:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1524 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:25:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:25:33] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 169 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 30 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 28 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:25:33] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:25:33] [INFO ] Invariant cache hit.
[2023-03-15 02:25:34] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-15 02:25:34] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:25:34] [INFO ] Invariant cache hit.
[2023-03-15 02:25:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:25:36] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
[2023-03-15 02:25:36] [INFO ] Redundant transitions in 160 ms returned []
[2023-03-15 02:25:36] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:25:36] [INFO ] Invariant cache hit.
[2023-03-15 02:25:37] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3877 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
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 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
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 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 106 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 02:25:37] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 02:25:38] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 02:25:38] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:25:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 02:25:42] [INFO ] After 4099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:25:46] [INFO ] After 7614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3928 ms.
[2023-03-15 02:25:50] [INFO ] After 11690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 244 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 244 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 846 ms.
Product exploration explored 100000 steps with 0 reset in 772 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 200 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 828 transition count 1242
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 175 place count 828 transition count 1242
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 181 place count 828 transition count 1242
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 205 place count 828 transition count 1242
Deduced a syphon composed of 205 places in 1 ms
Applied a total of 205 rules in 156 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:25:53] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-15 02:25:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 02:25:53] [INFO ] Computed 17 place invariants in 8 ms
[2023-03-15 02:25:54] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 828/828 places, 1242/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1074 ms. Remains : 828/828 places, 1242/1242 transitions.
Support contains 270 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:25:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 02:25:54] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 02:25:54] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-15 02:25:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:25:54] [INFO ] Invariant cache hit.
[2023-03-15 02:25:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:25:56] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2023-03-15 02:25:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:25:56] [INFO ] Invariant cache hit.
[2023-03-15 02:25:58] [INFO ] Dead Transitions using invariants and state equation in 1502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4330 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 164795 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)&&F(G(p1)))))'
Support contains 36 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 49 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2023-03-15 02:25:58] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2023-03-15 02:25:58] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 02:25:59] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-15 02:25:59] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
[2023-03-15 02:25:59] [INFO ] Invariant cache hit.
[2023-03-15 02:25:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:26:00] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2023-03-15 02:26:00] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 02:26:00] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
[2023-03-15 02:26:00] [INFO ] Invariant cache hit.
[2023-03-15 02:26:00] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/834 places, 720/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2106 ms. Remains : 312/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s5 1) (LT s16 1)) (OR (LT s1 1) (LT s8 1)) (OR (LT s2 1) (LT s10 1)) (OR (LT s4 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 161 reset in 651 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-03 finished in 2923 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' '!(((!p0 U p1)||G(F((X((!p3 U (G(!p3)||p4)))&&p2)))))'
Support contains 96 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 70 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:26:01] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:26:01] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-15 02:26:02] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-15 02:26:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:26:02] [INFO ] Invariant cache hit.
[2023-03-15 02:26:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:26:05] [INFO ] Implicit Places using invariants and state equation in 2919 ms returned []
Implicit Place search using SMT with State Equation took 3478 ms to find 0 implicit places.
[2023-03-15 02:26:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:26:05] [INFO ] Invariant cache hit.
[2023-03-15 02:26:06] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5060 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (AND (NOT p1) p3 (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND p3 (NOT p4))), (OR (NOT p2) (AND p3 (NOT p4))), (OR (AND (NOT p1) p3 (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) p3 (NOT p4)), (AND p3 (NOT p4))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p4) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 p2 (NOT p4)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p4) p3), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s1 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s10 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19346 reset in 5215 ms.
Stack based approach found an accepted trace after 23172 steps with 4472 reset with depth 19 and stack size 19 in 1002 ms.
FORMULA Peterson-COL-5-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-04 finished in 11731 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 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 834 transition count 1157
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 749 transition count 1157
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 170 place count 749 transition count 1002
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 480 place count 594 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 540 place count 564 transition count 972
Applied a total of 540 rules in 64 ms. Remains 564 /834 variables (removed 270) and now considering 972/1242 (removed 270) transitions.
[2023-03-15 02:26:13] [INFO ] Flow matrix only has 852 transitions (discarded 120 similar events)
// Phase 1: matrix 852 rows 564 cols
[2023-03-15 02:26:13] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 02:26:14] [INFO ] Implicit Places using invariants in 616 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 618 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/834 places, 972/1242 transitions.
Applied a total of 0 rules in 29 ms. Remains 558 /558 variables (removed 0) and now considering 972/972 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 712 ms. Remains : 558/834 places, 972/1242 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s194 1) (LT s139 1) (LT s245 1) (LT s190 1) (LT s200 1) (LT s146 1) (LT s197 1) (LT s248 1) (LT s207 1) (LT s258 1) (LT s204 1) (LT s149 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3854 reset in 1083 ms.
Stack based approach found an accepted trace after 724 steps with 25 reset with depth 35 and stack size 35 in 7 ms.
FORMULA Peterson-COL-5-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-05 finished in 1910 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' '!((p0 U G((X(p2)||p1))))'
Support contains 216 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:26:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:26:15] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 02:26:15] [INFO ] Implicit Places using invariants in 319 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 322 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 344 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Peterson-COL-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s17 1) (GEQ s45 1)) (AND (GEQ s36 1) (GEQ s71 1)) (AND (GEQ s16 1) (GEQ s67 1)) (AND (GEQ s36 1) (GEQ s67 1)) (AND (GEQ s41 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 3 reset in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-07 finished in 531 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||X(X(F(p1)))) U (G(p3)&&p2))))'
Support contains 108 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:26:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:26:15] [INFO ] Invariant cache hit.
[2023-03-15 02:26:16] [INFO ] Implicit Places using invariants in 420 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 422 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 450 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}, { cond=(AND p3 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (OR (AND (GEQ s17 1) (GEQ s45 1)) (AND (GEQ s36 1) (GEQ s71 1)) (AND (GEQ s16 1) (GEQ s67 1)) (AND (GEQ s36 1) (GEQ s67 1)) (AND (GEQ s41 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 538 reset in 913 ms.
Stack based approach found an accepted trace after 193 steps with 0 reset with depth 194 and stack size 194 in 2 ms.
FORMULA Peterson-COL-5-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-08 finished in 1794 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&&(!p0 U (X(p1)||(G(p1) U X(p2))))))))'
Support contains 222 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:26:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:26:17] [INFO ] Invariant cache hit.
[2023-03-15 02:26:18] [INFO ] Implicit Places using invariants in 439 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 442 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (LT s385 1) (LT s320 1) (LT s446 1) (LT s381 1) (LT s393 1) (LT s328 1) (LT s389 1) (LT s450 1) (LT s401 1) (LT s462 1) (LT s397 1) (LT s332 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5537 reset in 1581 ms.
Stack based approach found an accepted trace after 28350 steps with 1586 reset with depth 29 and stack size 29 in 407 ms.
FORMULA Peterson-COL-5-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-09 finished in 2686 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 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
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 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 44 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2023-03-15 02:26:20] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-03-15 02:26:20] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 02:26:20] [INFO ] Implicit Places using invariants in 230 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 232 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 293 ms. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-10 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 s44 1) (GEQ s57 1)) (AND (GEQ s34 1) (GEQ s55 1)) (AND (GEQ s35 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s76 1)) (AND (GEQ s25 1) (GEQ s59 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]]
Product exploration explored 100000 steps with 12028 reset in 1611 ms.
Stack based approach found an accepted trace after 23 steps with 2 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-10 finished in 2025 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 174 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 834 transition count 1033
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 625 transition count 1033
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 175 Pre rules applied. Total rules applied 418 place count 625 transition count 858
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 768 place count 450 transition count 858
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 816 place count 426 transition count 834
Applied a total of 816 rules in 45 ms. Remains 426 /834 variables (removed 408) and now considering 834/1242 (removed 408) transitions.
[2023-03-15 02:26:22] [INFO ] Flow matrix only has 714 transitions (discarded 120 similar events)
// Phase 1: matrix 714 rows 426 cols
[2023-03-15 02:26:22] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 02:26:22] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-15 02:26:22] [INFO ] Flow matrix only has 714 transitions (discarded 120 similar events)
[2023-03-15 02:26:22] [INFO ] Invariant cache hit.
[2023-03-15 02:26:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:26:23] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2023-03-15 02:26:23] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 02:26:23] [INFO ] Flow matrix only has 714 transitions (discarded 120 similar events)
[2023-03-15 02:26:23] [INFO ] Invariant cache hit.
[2023-03-15 02:26:24] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/834 places, 834/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1887 ms. Remains : 426/834 places, 834/1242 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s118 1) (LT s133 1) (LT s143 1) (LT s128 1) (LT s123 1) (LT s138 1) (OR (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s5 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 461 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-11 finished in 2403 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(((!p1 U G(!p2))||X(p3)||p0)))'
Support contains 354 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:26:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 02:26:24] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-15 02:26:25] [INFO ] Implicit Places using invariants in 540 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 543 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, p2]
Running random walk in product with property : Peterson-COL-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s318 1) (GEQ s448 1) (GEQ s380 1) (GEQ s442 1) (GEQ s392 1) (GEQ s454 1) (GEQ s386 1) (GEQ s324 1) (GEQ s398 1) (GEQ s336 1) (GEQ s330 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1604 ms.
Product exploration explored 100000 steps with 50000 reset in 1265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1 (NOT p3)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 10 factoid took 183 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-5-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-12 finished in 3997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p1)||X(F((p2&&X(F(p3)))))||p0)))))'
Support contains 216 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 02:26:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 02:26:28] [INFO ] Invariant cache hit.
[2023-03-15 02:26:29] [INFO ] Implicit Places using invariants in 398 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 400 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p2:(OR (AND (GEQ s68 1) (GEQ s81 1)) (AND (GEQ s58 1) (GEQ s79 1)) (AND (GEQ s59 1) (GEQ s89 1)) (AND (GEQ s63 1) (GEQ s100 1)) (AND (GEQ s49 1) (GEQ s83 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 564 reset in 524 ms.
Stack based approach found an accepted trace after 132 steps with 0 reset with depth 133 and stack size 133 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-13 finished in 1411 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 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 834 transition count 1082
Reduce places removed 160 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 310 rules applied. Total rules applied 470 place count 674 transition count 932
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 620 place count 524 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 620 place count 524 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 740 place count 464 transition count 872
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 790 place count 439 transition count 847
Applied a total of 790 rules in 63 ms. Remains 439 /834 variables (removed 395) and now considering 847/1242 (removed 395) transitions.
[2023-03-15 02:26:30] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2023-03-15 02:26:30] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 02:26:30] [INFO ] Implicit Places using invariants in 579 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 581 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/834 places, 847/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 661 ms. Remains : 433/834 places, 847/1242 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s361 1) (GEQ s418 1) (GEQ s307 1) (GEQ s310 1) (GEQ s364 1) (GEQ s415 1) (GEQ s412 1) (GEQ s300 1) (GEQ s354 1) (GEQ s408 1) (GEQ s303 1) (GEQ...], 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]]
Product exploration explored 100000 steps with 3300 reset in 1324 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-15 finished in 2054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(!p1 U (p2||G(!p1))))))))'
Found a Lengthening insensitive property : Peterson-COL-5-LTLFireability-02
Stuttering acceptance computed with spot in 159 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 270 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 834 transition count 1067
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 350 place count 659 transition count 1067
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 350 place count 659 transition count 1037
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 410 place count 629 transition count 1037
Applied a total of 410 rules in 50 ms. Remains 629 /834 variables (removed 205) and now considering 1037/1242 (removed 205) transitions.
[2023-03-15 02:26:32] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 629 cols
[2023-03-15 02:26:32] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 02:26:33] [INFO ] Implicit Places using invariants in 487 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 489 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 623/834 places, 1037/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 559 ms. Remains : 623/834 places, 1037/1242 transitions.
Running random walk in product with property : Peterson-COL-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (OR (AND (GEQ s35 1) (GEQ s75 1)) (AND (GEQ s18 1) (GEQ s48 1)) (AND (GEQ s39 1) (GEQ s66 1)) (AND (GEQ s24 1) (GEQ s49 1)) (AND (GEQ s38 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 821 ms.
Product exploration explored 100000 steps with 0 reset in 966 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:26:36] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 02:26:36] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 02:26:37] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 02:26:37] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:26:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 02:26:41] [INFO ] After 4351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:26:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:26:45] [INFO ] After 3859ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:26:47] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 2 ms to minimize.
[2023-03-15 02:26:47] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 0 ms to minimize.
[2023-03-15 02:26:48] [INFO ] Deduced a trap composed of 37 places in 486 ms of which 2 ms to minimize.
[2023-03-15 02:26:48] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 1 ms to minimize.
[2023-03-15 02:26:49] [INFO ] Deduced a trap composed of 30 places in 431 ms of which 1 ms to minimize.
[2023-03-15 02:26:49] [INFO ] Deduced a trap composed of 69 places in 383 ms of which 1 ms to minimize.
[2023-03-15 02:26:50] [INFO ] Deduced a trap composed of 10 places in 375 ms of which 1 ms to minimize.
[2023-03-15 02:26:50] [INFO ] Deduced a trap composed of 56 places in 454 ms of which 1 ms to minimize.
[2023-03-15 02:26:51] [INFO ] Deduced a trap composed of 48 places in 443 ms of which 1 ms to minimize.
[2023-03-15 02:26:51] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 1 ms to minimize.
[2023-03-15 02:26:52] [INFO ] Deduced a trap composed of 48 places in 452 ms of which 1 ms to minimize.
[2023-03-15 02:26:52] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 1 ms to minimize.
[2023-03-15 02:26:53] [INFO ] Deduced a trap composed of 23 places in 528 ms of which 1 ms to minimize.
[2023-03-15 02:26:54] [INFO ] Deduced a trap composed of 16 places in 522 ms of which 2 ms to minimize.
[2023-03-15 02:26:54] [INFO ] Deduced a trap composed of 70 places in 459 ms of which 2 ms to minimize.
[2023-03-15 02:26:55] [INFO ] Deduced a trap composed of 15 places in 466 ms of which 1 ms to minimize.
[2023-03-15 02:26:55] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 1 ms to minimize.
[2023-03-15 02:26:56] [INFO ] Deduced a trap composed of 60 places in 478 ms of which 1 ms to minimize.
[2023-03-15 02:26:57] [INFO ] Deduced a trap composed of 51 places in 373 ms of which 2 ms to minimize.
[2023-03-15 02:26:57] [INFO ] Deduced a trap composed of 51 places in 368 ms of which 1 ms to minimize.
[2023-03-15 02:26:57] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 1 ms to minimize.
[2023-03-15 02:26:57] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 11067 ms
[2023-03-15 02:27:00] [INFO ] Deduced a trap composed of 53 places in 356 ms of which 1 ms to minimize.
[2023-03-15 02:27:00] [INFO ] Deduced a trap composed of 57 places in 561 ms of which 2 ms to minimize.
[2023-03-15 02:27:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2277 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:27:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:27:02] [INFO ] After 25142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 74 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 12 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 623/623 places, 1037/1037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 242907 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242907 steps, saw 70119 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:27:06] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:06] [INFO ] Invariant cache hit.
[2023-03-15 02:27:06] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 02:27:06] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:27:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 02:27:11] [INFO ] After 4024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:27:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:27:15] [INFO ] After 3851ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:27:16] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 1 ms to minimize.
[2023-03-15 02:27:17] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 2 ms to minimize.
[2023-03-15 02:27:17] [INFO ] Deduced a trap composed of 60 places in 513 ms of which 1 ms to minimize.
[2023-03-15 02:27:18] [INFO ] Deduced a trap composed of 67 places in 562 ms of which 2 ms to minimize.
[2023-03-15 02:27:19] [INFO ] Deduced a trap composed of 65 places in 429 ms of which 1 ms to minimize.
[2023-03-15 02:27:19] [INFO ] Deduced a trap composed of 48 places in 426 ms of which 1 ms to minimize.
[2023-03-15 02:27:20] [INFO ] Deduced a trap composed of 52 places in 413 ms of which 1 ms to minimize.
[2023-03-15 02:27:20] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2023-03-15 02:27:21] [INFO ] Deduced a trap composed of 142 places in 407 ms of which 1 ms to minimize.
[2023-03-15 02:27:21] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 1 ms to minimize.
[2023-03-15 02:27:22] [INFO ] Deduced a trap composed of 44 places in 375 ms of which 1 ms to minimize.
[2023-03-15 02:27:23] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 1 ms to minimize.
[2023-03-15 02:27:23] [INFO ] Deduced a trap composed of 37 places in 475 ms of which 1 ms to minimize.
[2023-03-15 02:27:24] [INFO ] Deduced a trap composed of 114 places in 355 ms of which 1 ms to minimize.
[2023-03-15 02:27:24] [INFO ] Deduced a trap composed of 57 places in 414 ms of which 1 ms to minimize.
[2023-03-15 02:27:25] [INFO ] Deduced a trap composed of 56 places in 318 ms of which 1 ms to minimize.
[2023-03-15 02:27:25] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 1 ms to minimize.
[2023-03-15 02:27:26] [INFO ] Deduced a trap composed of 13 places in 476 ms of which 1 ms to minimize.
[2023-03-15 02:27:26] [INFO ] Deduced a trap composed of 38 places in 459 ms of which 1 ms to minimize.
[2023-03-15 02:27:27] [INFO ] Deduced a trap composed of 40 places in 455 ms of which 1 ms to minimize.
[2023-03-15 02:27:27] [INFO ] Deduced a trap composed of 40 places in 364 ms of which 1 ms to minimize.
[2023-03-15 02:27:28] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 4 ms to minimize.
[2023-03-15 02:27:29] [INFO ] Deduced a trap composed of 24 places in 421 ms of which 1 ms to minimize.
[2023-03-15 02:27:29] [INFO ] Deduced a trap composed of 36 places in 296 ms of which 1 ms to minimize.
[2023-03-15 02:27:30] [INFO ] Deduced a trap composed of 25 places in 509 ms of which 2 ms to minimize.
[2023-03-15 02:27:30] [INFO ] Deduced a trap composed of 127 places in 404 ms of which 1 ms to minimize.
[2023-03-15 02:27:31] [INFO ] Deduced a trap composed of 40 places in 410 ms of which 1 ms to minimize.
[2023-03-15 02:27:31] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 15263 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:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:27:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:27:32] [INFO ] After 25318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 102 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 20 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 20 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:27:32] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:32] [INFO ] Invariant cache hit.
[2023-03-15 02:27:32] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-15 02:27:32] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:32] [INFO ] Invariant cache hit.
[2023-03-15 02:27:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:27:34] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2023-03-15 02:27:34] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 02:27:34] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:34] [INFO ] Invariant cache hit.
[2023-03-15 02:27:35] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3097 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
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 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 59 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 02:27:35] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-15 02:27:36] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 02:27:36] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:27:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-15 02:27:40] [INFO ] After 4176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:27:44] [INFO ] After 7722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3243 ms.
[2023-03-15 02:27:47] [INFO ] After 11207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 5 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:27:48] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 02:27:48] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 02:27:48] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-15 02:27:48] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:48] [INFO ] Invariant cache hit.
[2023-03-15 02:27:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:27:50] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2023-03-15 02:27:50] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:50] [INFO ] Invariant cache hit.
[2023-03-15 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3105 ms. Remains : 623/623 places, 1037/1037 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:27:52] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:27:52] [INFO ] Invariant cache hit.
[2023-03-15 02:27:53] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 02:27:53] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:27:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 02:27:57] [INFO ] After 4056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:27:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:28:00] [INFO ] After 3451ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:28:02] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2023-03-15 02:28:03] [INFO ] Deduced a trap composed of 33 places in 484 ms of which 1 ms to minimize.
[2023-03-15 02:28:03] [INFO ] Deduced a trap composed of 60 places in 478 ms of which 2 ms to minimize.
[2023-03-15 02:28:04] [INFO ] Deduced a trap composed of 67 places in 544 ms of which 1 ms to minimize.
[2023-03-15 02:28:04] [INFO ] Deduced a trap composed of 65 places in 530 ms of which 1 ms to minimize.
[2023-03-15 02:28:05] [INFO ] Deduced a trap composed of 48 places in 550 ms of which 1 ms to minimize.
[2023-03-15 02:28:06] [INFO ] Deduced a trap composed of 52 places in 550 ms of which 1 ms to minimize.
[2023-03-15 02:28:06] [INFO ] Deduced a trap composed of 13 places in 532 ms of which 1 ms to minimize.
[2023-03-15 02:28:07] [INFO ] Deduced a trap composed of 142 places in 487 ms of which 1 ms to minimize.
[2023-03-15 02:28:08] [INFO ] Deduced a trap composed of 38 places in 490 ms of which 1 ms to minimize.
[2023-03-15 02:28:08] [INFO ] Deduced a trap composed of 44 places in 492 ms of which 1 ms to minimize.
[2023-03-15 02:28:09] [INFO ] Deduced a trap composed of 56 places in 366 ms of which 1 ms to minimize.
[2023-03-15 02:28:09] [INFO ] Deduced a trap composed of 37 places in 448 ms of which 1 ms to minimize.
[2023-03-15 02:28:10] [INFO ] Deduced a trap composed of 114 places in 383 ms of which 1 ms to minimize.
[2023-03-15 02:28:10] [INFO ] Deduced a trap composed of 57 places in 368 ms of which 1 ms to minimize.
[2023-03-15 02:28:11] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 1 ms to minimize.
[2023-03-15 02:28:11] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 1 ms to minimize.
[2023-03-15 02:28:12] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 1 ms to minimize.
[2023-03-15 02:28:12] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 1 ms to minimize.
[2023-03-15 02:28:13] [INFO ] Deduced a trap composed of 40 places in 440 ms of which 1 ms to minimize.
[2023-03-15 02:28:14] [INFO ] Deduced a trap composed of 40 places in 479 ms of which 1 ms to minimize.
[2023-03-15 02:28:15] [INFO ] Deduced a trap composed of 19 places in 487 ms of which 1 ms to minimize.
[2023-03-15 02:28:15] [INFO ] Deduced a trap composed of 24 places in 489 ms of which 1 ms to minimize.
[2023-03-15 02:28:16] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 1 ms to minimize.
[2023-03-15 02:28:16] [INFO ] Deduced a trap composed of 25 places in 479 ms of which 1 ms to minimize.
[2023-03-15 02:28:17] [INFO ] Deduced a trap composed of 127 places in 516 ms of which 2 ms to minimize.
[2023-03-15 02:28:18] [INFO ] Deduced a trap composed of 40 places in 505 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:28:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:28:18] [INFO ] After 25141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 92 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 623/623 places, 1037/1037 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 244601 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244601 steps, saw 70426 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:28:22] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:28:22] [INFO ] Invariant cache hit.
[2023-03-15 02:28:22] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 02:28:22] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:28:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 02:28:27] [INFO ] After 4099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:28:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:28:31] [INFO ] After 3947ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:28:33] [INFO ] Deduced a trap composed of 57 places in 362 ms of which 1 ms to minimize.
[2023-03-15 02:28:33] [INFO ] Deduced a trap composed of 33 places in 521 ms of which 1 ms to minimize.
[2023-03-15 02:28:34] [INFO ] Deduced a trap composed of 60 places in 529 ms of which 1 ms to minimize.
[2023-03-15 02:28:35] [INFO ] Deduced a trap composed of 67 places in 567 ms of which 2 ms to minimize.
[2023-03-15 02:28:35] [INFO ] Deduced a trap composed of 65 places in 491 ms of which 1 ms to minimize.
[2023-03-15 02:28:36] [INFO ] Deduced a trap composed of 48 places in 515 ms of which 1 ms to minimize.
[2023-03-15 02:28:36] [INFO ] Deduced a trap composed of 52 places in 554 ms of which 2 ms to minimize.
[2023-03-15 02:28:37] [INFO ] Deduced a trap composed of 13 places in 547 ms of which 2 ms to minimize.
[2023-03-15 02:28:38] [INFO ] Deduced a trap composed of 142 places in 447 ms of which 1 ms to minimize.
[2023-03-15 02:28:38] [INFO ] Deduced a trap composed of 38 places in 530 ms of which 1 ms to minimize.
[2023-03-15 02:28:39] [INFO ] Deduced a trap composed of 44 places in 529 ms of which 1 ms to minimize.
[2023-03-15 02:28:40] [INFO ] Deduced a trap composed of 56 places in 486 ms of which 1 ms to minimize.
[2023-03-15 02:28:40] [INFO ] Deduced a trap composed of 37 places in 467 ms of which 1 ms to minimize.
[2023-03-15 02:28:41] [INFO ] Deduced a trap composed of 114 places in 478 ms of which 1 ms to minimize.
[2023-03-15 02:28:41] [INFO ] Deduced a trap composed of 57 places in 383 ms of which 1 ms to minimize.
[2023-03-15 02:28:42] [INFO ] Deduced a trap composed of 56 places in 403 ms of which 1 ms to minimize.
[2023-03-15 02:28:42] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 1 ms to minimize.
[2023-03-15 02:28:43] [INFO ] Deduced a trap composed of 13 places in 455 ms of which 1 ms to minimize.
[2023-03-15 02:28:44] [INFO ] Deduced a trap composed of 38 places in 472 ms of which 1 ms to minimize.
[2023-03-15 02:28:44] [INFO ] Deduced a trap composed of 40 places in 443 ms of which 1 ms to minimize.
[2023-03-15 02:28:45] [INFO ] Deduced a trap composed of 40 places in 497 ms of which 2 ms to minimize.
[2023-03-15 02:28:46] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2023-03-15 02:28:46] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 1 ms to minimize.
[2023-03-15 02:28:47] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2023-03-15 02:28:47] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 1 ms to minimize.
[2023-03-15 02:28:48] [INFO ] Deduced a trap composed of 127 places in 454 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:28:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:28:48] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 58 ms.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 623/623 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:28:48] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:28:48] [INFO ] Invariant cache hit.
[2023-03-15 02:28:48] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-15 02:28:48] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:28:48] [INFO ] Invariant cache hit.
[2023-03-15 02:28:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:28:50] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 2582 ms to find 0 implicit places.
[2023-03-15 02:28:50] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 02:28:50] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:28:50] [INFO ] Invariant cache hit.
[2023-03-15 02:28:52] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3935 ms. Remains : 623/623 places, 1037/1037 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 623 transition count 917
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 138 place count 611 transition count 911
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 605 transition count 905
Free-agglomeration rule applied 125 times.
Iterating global reduction 1 with 125 rules applied. Total rules applied 275 place count 605 transition count 780
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 400 place count 480 transition count 780
Applied a total of 400 rules in 50 ms. Remains 480 /623 variables (removed 143) and now considering 780/1037 (removed 257) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 780 rows 480 cols
[2023-03-15 02:28:52] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-15 02:28:52] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 02:28:52] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:28:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 02:28:57] [INFO ] After 4129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:29:00] [INFO ] After 7768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3348 ms.
[2023-03-15 02:29:04] [INFO ] After 11328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 705 ms.
Product exploration explored 100000 steps with 0 reset in 622 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 219 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 16 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:29:06] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 02:29:06] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
// Phase 1: matrix 917 rows 623 cols
[2023-03-15 02:29:06] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 02:29:07] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1193 ms. Remains : 623/623 places, 1037/1037 transitions.
Support contains 270 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1037/1037 transitions.
Applied a total of 0 rules in 6 ms. Remains 623 /623 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2023-03-15 02:29:07] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:29:07] [INFO ] Invariant cache hit.
[2023-03-15 02:29:08] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-15 02:29:08] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:29:08] [INFO ] Invariant cache hit.
[2023-03-15 02:29:08] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 02:29:09] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-15 02:29:09] [INFO ] Flow matrix only has 917 transitions (discarded 120 similar events)
[2023-03-15 02:29:09] [INFO ] Invariant cache hit.
[2023-03-15 02:29:10] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3177 ms. Remains : 623/623 places, 1037/1037 transitions.
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 158858 ms.
[2023-03-15 02:29:11] [INFO ] Flatten gal took : 75 ms
[2023-03-15 02:29:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-15 02:29:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 7 ms.
Total runtime 393158 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-COL-5
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
BK_STOP 1678847542090
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-COL-5-LTLFireability-02
lola: time limit : 3595 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3595 2/32 Peterson-COL-5-LTLFireability-02 96963 m, 19392 m/sec, 220100 t fired, .
Time elapsed: 10 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3595 3/32 Peterson-COL-5-LTLFireability-02 183809 m, 17369 m/sec, 575602 t fired, .
Time elapsed: 15 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3595 4/32 Peterson-COL-5-LTLFireability-02 257842 m, 14806 m/sec, 1021178 t fired, .
Time elapsed: 20 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3595 5/32 Peterson-COL-5-LTLFireability-02 331928 m, 14817 m/sec, 1464999 t fired, .
Time elapsed: 25 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3595 6/32 Peterson-COL-5-LTLFireability-02 405713 m, 14757 m/sec, 1908741 t fired, .
Time elapsed: 30 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3595 7/32 Peterson-COL-5-LTLFireability-02 479179 m, 14693 m/sec, 2347010 t fired, .
Time elapsed: 35 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3595 8/32 Peterson-COL-5-LTLFireability-02 552581 m, 14680 m/sec, 2785633 t fired, .
Time elapsed: 40 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3595 8/32 Peterson-COL-5-LTLFireability-02 625948 m, 14673 m/sec, 3224038 t fired, .
Time elapsed: 45 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3595 9/32 Peterson-COL-5-LTLFireability-02 699171 m, 14644 m/sec, 3654537 t fired, .
Time elapsed: 50 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3595 10/32 Peterson-COL-5-LTLFireability-02 769290 m, 14023 m/sec, 4063690 t fired, .
Time elapsed: 55 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3595 11/32 Peterson-COL-5-LTLFireability-02 843028 m, 14747 m/sec, 4483141 t fired, .
Time elapsed: 60 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3595 12/32 Peterson-COL-5-LTLFireability-02 917487 m, 14891 m/sec, 4897549 t fired, .
Time elapsed: 65 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3595 12/32 Peterson-COL-5-LTLFireability-02 985098 m, 13522 m/sec, 5353191 t fired, .
Time elapsed: 70 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3595 13/32 Peterson-COL-5-LTLFireability-02 1057384 m, 14457 m/sec, 5820270 t fired, .
Time elapsed: 75 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3595 14/32 Peterson-COL-5-LTLFireability-02 1126271 m, 13777 m/sec, 6307543 t fired, .
Time elapsed: 80 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3595 15/32 Peterson-COL-5-LTLFireability-02 1180267 m, 10799 m/sec, 6871563 t fired, .
Time elapsed: 85 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3595 16/32 Peterson-COL-5-LTLFireability-02 1279673 m, 19881 m/sec, 7127572 t fired, .
Time elapsed: 90 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3595 17/32 Peterson-COL-5-LTLFireability-02 1354071 m, 14879 m/sec, 7556297 t fired, .
Time elapsed: 95 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3595 18/32 Peterson-COL-5-LTLFireability-02 1426308 m, 14447 m/sec, 7989528 t fired, .
Time elapsed: 100 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3595 19/32 Peterson-COL-5-LTLFireability-02 1498409 m, 14420 m/sec, 8422123 t fired, .
Time elapsed: 105 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3595 20/32 Peterson-COL-5-LTLFireability-02 1569771 m, 14272 m/sec, 8849999 t fired, .
Time elapsed: 110 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3595 20/32 Peterson-COL-5-LTLFireability-02 1641410 m, 14327 m/sec, 9278317 t fired, .
Time elapsed: 115 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3595 21/32 Peterson-COL-5-LTLFireability-02 1713210 m, 14360 m/sec, 9706110 t fired, .
Time elapsed: 120 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3595 22/32 Peterson-COL-5-LTLFireability-02 1785077 m, 14373 m/sec, 10129934 t fired, .
Time elapsed: 125 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3595 23/32 Peterson-COL-5-LTLFireability-02 1856512 m, 14287 m/sec, 10549019 t fired, .
Time elapsed: 130 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3595 24/32 Peterson-COL-5-LTLFireability-02 1928371 m, 14371 m/sec, 10961055 t fired, .
Time elapsed: 135 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3595 24/32 Peterson-COL-5-LTLFireability-02 2000371 m, 14400 m/sec, 11373752 t fired, .
Time elapsed: 140 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3595 25/32 Peterson-COL-5-LTLFireability-02 2072462 m, 14418 m/sec, 11780528 t fired, .
Time elapsed: 145 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3595 26/32 Peterson-COL-5-LTLFireability-02 2136749 m, 12857 m/sec, 12250976 t fired, .
Time elapsed: 150 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3595 27/32 Peterson-COL-5-LTLFireability-02 2210026 m, 14655 m/sec, 12696369 t fired, .
Time elapsed: 155 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3595 27/32 Peterson-COL-5-LTLFireability-02 2252391 m, 8473 m/sec, 13332668 t fired, .
Time elapsed: 160 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3595 28/32 Peterson-COL-5-LTLFireability-02 2327629 m, 15047 m/sec, 13743407 t fired, .
Time elapsed: 165 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3595 29/32 Peterson-COL-5-LTLFireability-02 2425209 m, 19516 m/sec, 13998953 t fired, .
Time elapsed: 170 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/3595 30/32 Peterson-COL-5-LTLFireability-02 2500056 m, 14969 m/sec, 14417136 t fired, .
Time elapsed: 175 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 175/3595 31/32 Peterson-COL-5-LTLFireability-02 2571803 m, 14349 m/sec, 14847130 t fired, .
Time elapsed: 180 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 180/3595 32/32 Peterson-COL-5-LTLFireability-02 2643281 m, 14295 m/sec, 15276941 t fired, .
Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Peterson-COL-5-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-5-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-5-LTLFireability-02: LTL unknown AGGR
Time elapsed: 190 secs. Pages in use: 32
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="Peterson-COL-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Peterson-COL-5, 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 r263-smll-167863538400580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;