About the Execution of LoLa+red for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1210.487 | 254519.00 | 312885.00 | 2201.60 | TFFFTFTFF?TTF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853500732.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 FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500732
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678514663028
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=FunctionPointer-PT-c008
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 06:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 06:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:04:24] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2023-03-11 06:04:24] [INFO ] Transformed 2826 places.
[2023-03-11 06:04:24] [INFO ] Transformed 8960 transitions.
[2023-03-11 06:04:24] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 551 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 30 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c008-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3768
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3768
Ensure Unique test removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 1013 place count 1318 transition count 3358
Discarding 151 places :
Symmetric choice reduction at 2 with 151 rule applications. Total rules 1164 place count 1167 transition count 3056
Iterating global reduction 2 with 151 rules applied. Total rules applied 1315 place count 1167 transition count 3056
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1403 place count 1167 transition count 2968
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1417 place count 1153 transition count 2940
Iterating global reduction 3 with 14 rules applied. Total rules applied 1431 place count 1153 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1444 place count 1140 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1457 place count 1140 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1470 place count 1127 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1483 place count 1127 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1496 place count 1114 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1509 place count 1114 transition count 2862
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1522 place count 1101 transition count 2836
Iterating global reduction 3 with 13 rules applied. Total rules applied 1535 place count 1101 transition count 2836
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1546 place count 1090 transition count 2814
Iterating global reduction 3 with 11 rules applied. Total rules applied 1557 place count 1090 transition count 2814
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1568 place count 1079 transition count 2792
Iterating global reduction 3 with 11 rules applied. Total rules applied 1579 place count 1079 transition count 2792
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1618 place count 1040 transition count 2648
Iterating global reduction 3 with 39 rules applied. Total rules applied 1657 place count 1040 transition count 2648
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1706 place count 991 transition count 2452
Iterating global reduction 3 with 49 rules applied. Total rules applied 1755 place count 991 transition count 2452
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1804 place count 942 transition count 2322
Iterating global reduction 3 with 49 rules applied. Total rules applied 1853 place count 942 transition count 2322
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1902 place count 893 transition count 2224
Iterating global reduction 3 with 49 rules applied. Total rules applied 1951 place count 893 transition count 2224
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2000 place count 844 transition count 2126
Iterating global reduction 3 with 49 rules applied. Total rules applied 2049 place count 844 transition count 2126
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2098 place count 795 transition count 2028
Iterating global reduction 3 with 49 rules applied. Total rules applied 2147 place count 795 transition count 2028
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2196 place count 746 transition count 1930
Iterating global reduction 3 with 49 rules applied. Total rules applied 2245 place count 746 transition count 1930
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2260 place count 731 transition count 1900
Iterating global reduction 3 with 15 rules applied. Total rules applied 2275 place count 731 transition count 1900
Applied a total of 2275 rules in 1178 ms. Remains 731 /1628 variables (removed 897) and now considering 1900/5962 (removed 4062) transitions.
[2023-03-11 06:04:26] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
// Phase 1: matrix 1274 rows 731 cols
[2023-03-11 06:04:26] [INFO ] Computed 2 place invariants in 38 ms
[2023-03-11 06:04:26] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-11 06:04:26] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-11 06:04:26] [INFO ] Invariant cache hit.
[2023-03-11 06:04:27] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-11 06:04:29] [INFO ] Implicit Places using invariants and state equation in 2127 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
[2023-03-11 06:04:29] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-11 06:04:29] [INFO ] Invariant cache hit.
[2023-03-11 06:04:29] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 731/1628 places, 1900/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4539 ms. Remains : 731/1628 places, 1900/5962 transitions.
Support contains 16 out of 731 places after structural reductions.
[2023-03-11 06:04:30] [INFO ] Flatten gal took : 137 ms
[2023-03-11 06:04:30] [INFO ] Flatten gal took : 89 ms
[2023-03-11 06:04:30] [INFO ] Input system was already deterministic with 1900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 06:04:30] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-11 06:04:30] [INFO ] Invariant cache hit.
[2023-03-11 06:04:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:04:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:04:31] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 06:04:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:04:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:04:33] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 06:04:33] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-11 06:04:34] [INFO ] After 1126ms SMT Verify possible using 307 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 06:04:35] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 4 ms to minimize.
[2023-03-11 06:04:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-11 06:04:35] [INFO ] After 2350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 618 ms.
[2023-03-11 06:04:36] [INFO ] After 4477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 15 ms.
Support contains 11 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 727 transition count 1890
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 727 transition count 1890
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 727 transition count 1888
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 723 transition count 1878
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 723 transition count 1878
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 719 transition count 1868
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 719 transition count 1868
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 714 transition count 1852
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 714 transition count 1852
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 709 transition count 1838
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 709 transition count 1838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 704 transition count 1828
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 704 transition count 1828
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 699 transition count 1818
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 699 transition count 1818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 694 transition count 1804
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 694 transition count 1804
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 689 transition count 1790
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 689 transition count 1790
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 685 transition count 1782
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 685 transition count 1782
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 683 transition count 1778
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 683 transition count 1778
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 681 transition count 1774
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 681 transition count 1774
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 679 transition count 1770
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 679 transition count 1770
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 677 transition count 1766
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 677 transition count 1766
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 128 place count 677 transition count 1748
Applied a total of 128 rules in 571 ms. Remains 677 /731 variables (removed 54) and now considering 1748/1900 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 677/731 places, 1748/1900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 06:04:37] [INFO ] Flow matrix only has 1173 transitions (discarded 575 similar events)
// Phase 1: matrix 1173 rows 677 cols
[2023-03-11 06:04:37] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 06:04:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:04:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 06:04:37] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 06:04:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:04:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:04:38] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 06:04:38] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-11 06:04:39] [INFO ] After 791ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 06:04:39] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2023-03-11 06:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-11 06:04:39] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-11 06:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-11 06:04:40] [INFO ] After 1835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 450 ms.
[2023-03-11 06:04:40] [INFO ] After 3407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 17 ms.
Support contains 9 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1748/1748 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 675 transition count 1744
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 675 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 675 transition count 1740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 673 transition count 1736
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 673 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 672 transition count 1734
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 672 transition count 1734
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 671 transition count 1730
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 671 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 670 transition count 1728
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 670 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 669 transition count 1726
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 669 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 668 transition count 1724
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 668 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 667 transition count 1722
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 667 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 666 transition count 1720
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 666 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 665 transition count 1718
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 665 transition count 1718
Applied a total of 28 rules in 243 ms. Remains 665 /677 variables (removed 12) and now considering 1718/1748 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 665/677 places, 1718/1748 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 183953 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183953 steps, saw 119415 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 06:04:44] [INFO ] Flow matrix only has 1152 transitions (discarded 566 similar events)
// Phase 1: matrix 1152 rows 665 cols
[2023-03-11 06:04:44] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 06:04:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:04:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:04:44] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 06:04:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:04:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:04:45] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 06:04:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 06:04:46] [INFO ] After 753ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 06:04:46] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 0 ms to minimize.
[2023-03-11 06:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-11 06:04:47] [INFO ] After 1595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 460 ms.
[2023-03-11 06:04:47] [INFO ] After 3169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 9 out of 665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 665/665 places, 1718/1718 transitions.
Applied a total of 0 rules in 85 ms. Remains 665 /665 variables (removed 0) and now considering 1718/1718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 665/665 places, 1718/1718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 665/665 places, 1718/1718 transitions.
Applied a total of 0 rules in 86 ms. Remains 665 /665 variables (removed 0) and now considering 1718/1718 (removed 0) transitions.
[2023-03-11 06:04:47] [INFO ] Flow matrix only has 1152 transitions (discarded 566 similar events)
[2023-03-11 06:04:47] [INFO ] Invariant cache hit.
[2023-03-11 06:04:48] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-11 06:04:48] [INFO ] Flow matrix only has 1152 transitions (discarded 566 similar events)
[2023-03-11 06:04:48] [INFO ] Invariant cache hit.
[2023-03-11 06:04:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 06:04:49] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2023-03-11 06:04:50] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-11 06:04:50] [INFO ] Flow matrix only has 1152 transitions (discarded 566 similar events)
[2023-03-11 06:04:50] [INFO ] Invariant cache hit.
[2023-03-11 06:04:50] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2825 ms. Remains : 665/665 places, 1718/1718 transitions.
Graph (trivial) has 1008 edges and 665 vertex of which 192 / 665 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 438 transitions
Reduce isomorphic transitions removed 758 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 537 transition count 947
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 524 transition count 947
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 27 place count 524 transition count 857
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 207 place count 434 transition count 857
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 270 place count 371 transition count 794
Iterating global reduction 2 with 63 rules applied. Total rules applied 333 place count 371 transition count 794
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 459 place count 371 transition count 668
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 719 place count 241 transition count 538
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 783 place count 177 transition count 410
Iterating global reduction 3 with 64 rules applied. Total rules applied 847 place count 177 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 849 place count 177 transition count 408
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 912 place count 114 transition count 282
Iterating global reduction 4 with 63 rules applied. Total rules applied 975 place count 114 transition count 282
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1038 place count 51 transition count 156
Iterating global reduction 4 with 63 rules applied. Total rules applied 1101 place count 51 transition count 156
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1164 place count 51 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1164 place count 51 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1166 place count 50 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1168 place count 49 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1178 place count 44 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1179 place count 44 transition count 90
Applied a total of 1179 rules in 88 ms. Remains 44 /665 variables (removed 621) and now considering 90/1718 (removed 1628) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 90 rows 44 cols
[2023-03-11 06:04:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:04:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:04:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:04:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 06:04:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:04:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:04:50] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 06:04:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:04:50] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 06:04:50] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-11 06:04:50] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA FunctionPointer-PT-c008-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 719 transition count 1872
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 719 transition count 1872
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 719 transition count 1868
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 707 transition count 1838
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 707 transition count 1838
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 695 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 695 transition count 1800
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 90 place count 681 transition count 1752
Iterating global reduction 1 with 14 rules applied. Total rules applied 104 place count 681 transition count 1752
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 118 place count 667 transition count 1716
Iterating global reduction 1 with 14 rules applied. Total rules applied 132 place count 667 transition count 1716
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 146 place count 653 transition count 1688
Iterating global reduction 1 with 14 rules applied. Total rules applied 160 place count 653 transition count 1688
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 174 place count 639 transition count 1660
Iterating global reduction 1 with 14 rules applied. Total rules applied 188 place count 639 transition count 1660
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 200 place count 627 transition count 1634
Iterating global reduction 1 with 12 rules applied. Total rules applied 212 place count 627 transition count 1634
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 223 place count 616 transition count 1610
Iterating global reduction 1 with 11 rules applied. Total rules applied 234 place count 616 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 239 place count 611 transition count 1600
Iterating global reduction 1 with 5 rules applied. Total rules applied 244 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 245 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 246 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 247 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 248 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 251 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 252 place count 607 transition count 1592
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 607 transition count 1590
Applied a total of 254 rules in 677 ms. Remains 607 /731 variables (removed 124) and now considering 1590/1900 (removed 310) transitions.
[2023-03-11 06:04:51] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-11 06:04:51] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 06:04:52] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-11 06:04:52] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:04:52] [INFO ] Invariant cache hit.
[2023-03-11 06:04:52] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:04:53] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-11 06:04:53] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-11 06:04:53] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:04:53] [INFO ] Invariant cache hit.
[2023-03-11 06:04:54] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/731 places, 1590/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3060 ms. Remains : 607/731 places, 1590/1900 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 505 ms.
Stack based approach found an accepted trace after 414 steps with 0 reset with depth 415 and stack size 415 in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 3780 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(p1)||p0)))'
Support contains 4 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1878
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1878
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 721 transition count 1872
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 711 transition count 1848
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 711 transition count 1848
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 702 transition count 1820
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 702 transition count 1820
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 691 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 691 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 97 place count 680 transition count 1752
Iterating global reduction 1 with 11 rules applied. Total rules applied 108 place count 680 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 119 place count 669 transition count 1730
Iterating global reduction 1 with 11 rules applied. Total rules applied 130 place count 669 transition count 1730
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 141 place count 658 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 152 place count 658 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 648 transition count 1686
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 648 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 639 transition count 1666
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 639 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 195 place count 634 transition count 1656
Iterating global reduction 1 with 5 rules applied. Total rules applied 200 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 633 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 632 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 631 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 631 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 630 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 630 transition count 1648
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 214 place count 630 transition count 1642
Applied a total of 214 rules in 398 ms. Remains 630 /731 variables (removed 101) and now considering 1642/1900 (removed 258) transitions.
[2023-03-11 06:04:55] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
// Phase 1: matrix 1098 rows 630 cols
[2023-03-11 06:04:55] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 06:04:55] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-11 06:04:55] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
[2023-03-11 06:04:55] [INFO ] Invariant cache hit.
[2023-03-11 06:04:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:04:57] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
[2023-03-11 06:04:57] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 06:04:57] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
[2023-03-11 06:04:57] [INFO ] Invariant cache hit.
[2023-03-11 06:04:57] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/731 places, 1642/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2818 ms. Remains : 630/731 places, 1642/1900 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s543 1)), p0:(OR (AND (GEQ s1 1) (GEQ s551 1)) (AND (GEQ s1 1) (GEQ s550 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 479 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-02 finished in 3370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 720 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 720 transition count 1874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 720 transition count 1872
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 35 place count 709 transition count 1844
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 709 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 699 transition count 1810
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 699 transition count 1810
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 689 transition count 1778
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 689 transition count 1778
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 679 transition count 1758
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 679 transition count 1758
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 116 place count 669 transition count 1738
Iterating global reduction 1 with 10 rules applied. Total rules applied 126 place count 669 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 136 place count 659 transition count 1718
Iterating global reduction 1 with 10 rules applied. Total rules applied 146 place count 659 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 156 place count 649 transition count 1692
Iterating global reduction 1 with 10 rules applied. Total rules applied 166 place count 649 transition count 1692
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 175 place count 640 transition count 1668
Iterating global reduction 1 with 9 rules applied. Total rules applied 184 place count 640 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 187 place count 637 transition count 1662
Iterating global reduction 1 with 3 rules applied. Total rules applied 190 place count 637 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 634 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 634 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 199 place count 631 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 202 place count 631 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 205 place count 628 transition count 1644
Iterating global reduction 1 with 3 rules applied. Total rules applied 208 place count 628 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 211 place count 625 transition count 1638
Iterating global reduction 1 with 3 rules applied. Total rules applied 214 place count 625 transition count 1638
Applied a total of 214 rules in 194 ms. Remains 625 /731 variables (removed 106) and now considering 1638/1900 (removed 262) transitions.
[2023-03-11 06:04:58] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 625 cols
[2023-03-11 06:04:58] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 06:04:58] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-11 06:04:58] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2023-03-11 06:04:58] [INFO ] Invariant cache hit.
[2023-03-11 06:04:59] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 06:05:00] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-03-11 06:05:00] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2023-03-11 06:05:00] [INFO ] Invariant cache hit.
[2023-03-11 06:05:00] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/731 places, 1638/1900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 625/731 places, 1638/1900 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s554 1)), p1:(AND (GEQ s1 1) (GEQ s553 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-03 finished in 2798 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((X(F(p1))||p0))))'
Support contains 4 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 719 transition count 1872
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 719 transition count 1872
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 719 transition count 1866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 707 transition count 1836
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 707 transition count 1836
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 696 transition count 1802
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 696 transition count 1802
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 683 transition count 1758
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 683 transition count 1758
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 115 place count 670 transition count 1724
Iterating global reduction 1 with 13 rules applied. Total rules applied 128 place count 670 transition count 1724
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 141 place count 657 transition count 1698
Iterating global reduction 1 with 13 rules applied. Total rules applied 154 place count 657 transition count 1698
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 167 place count 644 transition count 1672
Iterating global reduction 1 with 13 rules applied. Total rules applied 180 place count 644 transition count 1672
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 633 transition count 1648
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 633 transition count 1648
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 212 place count 623 transition count 1626
Iterating global reduction 1 with 10 rules applied. Total rules applied 222 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 227 place count 618 transition count 1616
Iterating global reduction 1 with 5 rules applied. Total rules applied 232 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 244 place count 614 transition count 1604
Applied a total of 244 rules in 383 ms. Remains 614 /731 variables (removed 117) and now considering 1604/1900 (removed 296) transitions.
[2023-03-11 06:05:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:05:01] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 06:05:01] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-11 06:05:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:01] [INFO ] Invariant cache hit.
[2023-03-11 06:05:01] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:03] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2023-03-11 06:05:03] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 06:05:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:03] [INFO ] Invariant cache hit.
[2023-03-11 06:05:03] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/731 places, 1604/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2873 ms. Remains : 614/731 places, 1604/1900 transitions.
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s542 1)), p1:(AND (GEQ s1 1) (GEQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 390 ms.
Product exploration explored 100000 steps with 2 reset in 520 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 319336 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319336 steps, saw 207281 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:05:08] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:08] [INFO ] Invariant cache hit.
[2023-03-11 06:05:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:09] [INFO ] After 824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:05:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:10] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:10] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:10] [INFO ] After 353ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:10] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-11 06:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-11 06:05:11] [INFO ] After 998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-11 06:05:11] [INFO ] After 2009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 68 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 614/614 places, 1604/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 275255 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275255 steps, saw 178672 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:05:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:14] [INFO ] Invariant cache hit.
[2023-03-11 06:05:14] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:15] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:05:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:05:16] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:16] [INFO ] After 364ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:16] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 0 ms to minimize.
[2023-03-11 06:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-11 06:05:17] [INFO ] After 1031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 330 ms.
[2023-03-11 06:05:17] [INFO ] After 2016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 84 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 69 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:05:17] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:17] [INFO ] Invariant cache hit.
[2023-03-11 06:05:17] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-11 06:05:17] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:17] [INFO ] Invariant cache hit.
[2023-03-11 06:05:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:19] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-11 06:05:19] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 06:05:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:19] [INFO ] Invariant cache hit.
[2023-03-11 06:05:20] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2479 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 30 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-11 06:05:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:05:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:05:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:20] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:05:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:05:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:05:20] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:05:20] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:20] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 06:05:20] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 85 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:05:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:05:20] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-11 06:05:20] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-11 06:05:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:20] [INFO ] Invariant cache hit.
[2023-03-11 06:05:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:22] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2023-03-11 06:05:22] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:05:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:22] [INFO ] Invariant cache hit.
[2023-03-11 06:05:23] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2508 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 316213 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316213 steps, saw 205252 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:05:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:26] [INFO ] Invariant cache hit.
[2023-03-11 06:05:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:27] [INFO ] After 796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:05:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:05:27] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:28] [INFO ] After 345ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:28] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-11 06:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-11 06:05:28] [INFO ] After 1001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 316 ms.
[2023-03-11 06:05:29] [INFO ] After 1992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 80 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 614/614 places, 1604/1604 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 313048 steps, run timeout after 3013 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 313048 steps, saw 203199 distinct states, run finished after 3014 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:05:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:32] [INFO ] Invariant cache hit.
[2023-03-11 06:05:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:05:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:33] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:05:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:05:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:33] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:34] [INFO ] After 346ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:34] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 0 ms to minimize.
[2023-03-11 06:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-11 06:05:34] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-11 06:05:35] [INFO ] After 2011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 68 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 75 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:05:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:35] [INFO ] Invariant cache hit.
[2023-03-11 06:05:35] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-11 06:05:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:35] [INFO ] Invariant cache hit.
[2023-03-11 06:05:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:37] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-11 06:05:37] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 06:05:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:37] [INFO ] Invariant cache hit.
[2023-03-11 06:05:37] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2588 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 30 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-11 06:05:37] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:05:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:05:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:37] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:05:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:05:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:38] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:05:38] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:05:38] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 06:05:38] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 393 ms.
Product exploration explored 100000 steps with 0 reset in 490 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 75 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:05:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:05:39] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 06:05:39] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-11 06:05:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:39] [INFO ] Invariant cache hit.
[2023-03-11 06:05:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:05:41] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2023-03-11 06:05:41] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:05:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:05:41] [INFO ] Invariant cache hit.
[2023-03-11 06:05:41] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2568 ms. Remains : 614/614 places, 1604/1604 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 41127 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||G(p1)))))'
Support contains 4 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 720 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 720 transition count 1874
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 720 transition count 1868
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 709 transition count 1840
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 709 transition count 1840
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 699 transition count 1808
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 699 transition count 1808
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 687 transition count 1766
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 687 transition count 1766
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 675 transition count 1734
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 675 transition count 1734
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 130 place count 663 transition count 1710
Iterating global reduction 1 with 12 rules applied. Total rules applied 142 place count 663 transition count 1710
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 154 place count 651 transition count 1686
Iterating global reduction 1 with 12 rules applied. Total rules applied 166 place count 651 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 641 transition count 1666
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 641 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 632 transition count 1648
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 632 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 208 place count 628 transition count 1640
Iterating global reduction 1 with 4 rules applied. Total rules applied 212 place count 628 transition count 1640
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 218 place count 628 transition count 1634
Applied a total of 218 rules in 310 ms. Remains 628 /731 variables (removed 103) and now considering 1634/1900 (removed 266) transitions.
[2023-03-11 06:05:42] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-11 06:05:42] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 06:05:42] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-11 06:05:42] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:42] [INFO ] Invariant cache hit.
[2023-03-11 06:05:43] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:05:44] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-11 06:05:44] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-11 06:05:44] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:44] [INFO ] Invariant cache hit.
[2023-03-11 06:05:44] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 628/731 places, 1634/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2752 ms. Remains : 628/731 places, 1634/1900 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s556 1)), p0:(AND (GEQ s1 1) (GEQ s552 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 444 ms.
Product exploration explored 100000 steps with 0 reset in 541 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:05:46] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:46] [INFO ] Invariant cache hit.
[2023-03-11 06:05:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:05:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:46] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:05:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:05:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:47] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:47] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:05:47] [INFO ] After 183ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:47] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 1 ms to minimize.
[2023-03-11 06:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-11 06:05:47] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-11 06:05:47] [INFO ] After 1154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 76 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519866 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 519866 steps, saw 337426 distinct states, run finished after 3003 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:05:51] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:51] [INFO ] Invariant cache hit.
[2023-03-11 06:05:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:05:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:51] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:05:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:05:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:51] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:51] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:05:52] [INFO ] After 182ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:52] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-11 06:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-11 06:05:52] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-11 06:05:52] [INFO ] After 1155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 73 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 77 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-11 06:05:52] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:52] [INFO ] Invariant cache hit.
[2023-03-11 06:05:53] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-11 06:05:53] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:53] [INFO ] Invariant cache hit.
[2023-03-11 06:05:53] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:05:54] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2023-03-11 06:05:54] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 06:05:54] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:54] [INFO ] Invariant cache hit.
[2023-03-11 06:05:55] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2507 ms. Remains : 628/628 places, 1634/1634 transitions.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 30 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 24 cols
[2023-03-11 06:05:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:05:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:05:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:55] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:05:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:05:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:55] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:05:55] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:55] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 06:05:55] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 79 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-11 06:05:55] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-11 06:05:55] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 06:05:56] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-11 06:05:56] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:56] [INFO ] Invariant cache hit.
[2023-03-11 06:05:56] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:05:57] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-11 06:05:57] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 06:05:57] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:57] [INFO ] Invariant cache hit.
[2023-03-11 06:05:58] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2506 ms. Remains : 628/628 places, 1634/1634 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:05:58] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:05:58] [INFO ] Invariant cache hit.
[2023-03-11 06:05:58] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:59] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:05:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:05:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:05:59] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:05:59] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:05:59] [INFO ] After 187ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:00] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2023-03-11 06:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-11 06:06:00] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-11 06:06:00] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 73 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 529192 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529192 steps, saw 343479 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:06:03] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:06:03] [INFO ] Invariant cache hit.
[2023-03-11 06:06:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:06:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:03] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:06:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:06:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 06:06:04] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:04] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:06:04] [INFO ] After 185ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:04] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-11 06:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-11 06:06:05] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-11 06:06:05] [INFO ] After 1135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 76 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 74 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-11 06:06:05] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:06:05] [INFO ] Invariant cache hit.
[2023-03-11 06:06:05] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-11 06:06:05] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:06:05] [INFO ] Invariant cache hit.
[2023-03-11 06:06:05] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:06:07] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2023-03-11 06:06:07] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 06:06:07] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:06:07] [INFO ] Invariant cache hit.
[2023-03-11 06:06:07] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2495 ms. Remains : 628/628 places, 1634/1634 transitions.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 31 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 24 cols
[2023-03-11 06:06:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:06:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:06:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:07] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:06:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:06:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:07] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:06:07] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:06:07] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 06:06:07] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 634 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 73 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-11 06:06:09] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-11 06:06:09] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 06:06:09] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-11 06:06:09] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:06:09] [INFO ] Invariant cache hit.
[2023-03-11 06:06:10] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:06:11] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-03-11 06:06:11] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 06:06:11] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-11 06:06:11] [INFO ] Invariant cache hit.
[2023-03-11 06:06:11] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2461 ms. Remains : 628/628 places, 1634/1634 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 29798 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(F(!p1))||(F(!p1)&&G(!p2)))))) U p2))'
Support contains 5 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1878
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1878
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 721 transition count 1872
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 711 transition count 1850
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 711 transition count 1850
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 702 transition count 1822
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 702 transition count 1822
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 691 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 691 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 97 place count 680 transition count 1752
Iterating global reduction 1 with 11 rules applied. Total rules applied 108 place count 680 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 119 place count 669 transition count 1730
Iterating global reduction 1 with 11 rules applied. Total rules applied 130 place count 669 transition count 1730
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 141 place count 658 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 152 place count 658 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 648 transition count 1686
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 648 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 182 place count 638 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 192 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 197 place count 633 transition count 1654
Iterating global reduction 1 with 5 rules applied. Total rules applied 202 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 632 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 631 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 631 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 630 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 630 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 629 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 629 transition count 1646
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 216 place count 629 transition count 1640
Applied a total of 216 rules in 360 ms. Remains 629 /731 variables (removed 102) and now considering 1640/1900 (removed 260) transitions.
[2023-03-11 06:06:12] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-11 06:06:12] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 06:06:12] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-11 06:06:12] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:12] [INFO ] Invariant cache hit.
[2023-03-11 06:06:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:13] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2023-03-11 06:06:14] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:06:14] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:14] [INFO ] Invariant cache hit.
[2023-03-11 06:06:14] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/731 places, 1640/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2629 ms. Remains : 629/731 places, 1640/1900 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), p0, (OR p0 p1), p1]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s543 1)), p0:(AND (GEQ s1 1) (GEQ s547 1)), p1:(AND (GEQ s0 1) (GEQ s557 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 402 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 471 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), p0, (OR p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:06:16] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:16] [INFO ] Invariant cache hit.
[2023-03-11 06:06:16] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:06:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:16] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:06:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:06:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:17] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:06:17] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:17] [INFO ] After 389ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:06:18] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-11 06:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-11 06:06:18] [INFO ] After 1036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-11 06:06:18] [INFO ] After 2030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 628 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 628 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 627 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 626 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 625 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 624 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 624 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 623 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 622 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 622 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 621 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 621 transition count 1622
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 621 transition count 1620
Applied a total of 18 rules in 251 ms. Remains 621 /629 variables (removed 8) and now considering 1620/1640 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 621/629 places, 1620/1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 256964 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256964 steps, saw 166801 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:06:22] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
// Phase 1: matrix 1083 rows 621 cols
[2023-03-11 06:06:22] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-11 06:06:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:06:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:22] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:06:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:06:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:23] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:06:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 06:06:23] [INFO ] After 428ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:06:24] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 1 ms to minimize.
[2023-03-11 06:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-11 06:06:24] [INFO ] After 1021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-11 06:06:24] [INFO ] After 1882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1620/1620 transitions.
Applied a total of 0 rules in 72 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 621/621 places, 1620/1620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1620/1620 transitions.
Applied a total of 0 rules in 74 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
[2023-03-11 06:06:24] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-11 06:06:24] [INFO ] Invariant cache hit.
[2023-03-11 06:06:25] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-11 06:06:25] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-11 06:06:25] [INFO ] Invariant cache hit.
[2023-03-11 06:06:25] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 06:06:26] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2023-03-11 06:06:26] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:06:26] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-11 06:06:26] [INFO ] Invariant cache hit.
[2023-03-11 06:06:27] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2327 ms. Remains : 621/621 places, 1620/1620 transitions.
Graph (trivial) has 950 edges and 621 vertex of which 192 / 621 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 729 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 493 transition count 881
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 483 transition count 881
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 21 place count 483 transition count 806
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 171 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 234 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 297 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 423 place count 345 transition count 617
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 679 place count 217 transition count 489
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 743 place count 153 transition count 361
Iterating global reduction 3 with 64 rules applied. Total rules applied 807 place count 153 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 809 place count 153 transition count 359
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 872 place count 90 transition count 233
Iterating global reduction 4 with 63 rules applied. Total rules applied 935 place count 90 transition count 233
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 998 place count 27 transition count 107
Iterating global reduction 4 with 63 rules applied. Total rules applied 1061 place count 27 transition count 107
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1124 place count 27 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1124 place count 27 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 26 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1128 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1130 place count 24 transition count 42
Applied a total of 1130 rules in 28 ms. Remains 24 /621 variables (removed 597) and now considering 42/1620 (removed 1578) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 24 cols
[2023-03-11 06:06:27] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:06:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:06:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:27] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 06:06:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:06:27] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:06:27] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:06:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:06:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:27] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:06:27] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:06:27] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 06:06:27] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 782 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), p0, (OR p0 p1), p1]
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), p0, (OR p0 p1), p1]
[2023-03-11 06:06:28] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-11 06:06:28] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 06:06:29] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:06:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:06:30] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2023-03-11 06:06:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:06:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2023-03-11 06:06:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:06:32] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-03-11 06:06:32] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:32] [INFO ] [Nat]Added 271 Read/Feed constraints in 103 ms returned sat
[2023-03-11 06:06:32] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 883 transitions) in 176 ms.
[2023-03-11 06:06:32] [INFO ] Added : 20 causal constraints over 5 iterations in 627 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Applied a total of 0 rules in 84 ms. Remains 629 /629 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-11 06:06:32] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:32] [INFO ] Invariant cache hit.
[2023-03-11 06:06:33] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-11 06:06:33] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:33] [INFO ] Invariant cache hit.
[2023-03-11 06:06:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:34] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2023-03-11 06:06:34] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 06:06:34] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:34] [INFO ] Invariant cache hit.
[2023-03-11 06:06:35] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2281 ms. Remains : 629/629 places, 1640/1640 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 527 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), p0, (OR p0 p1), p1]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 207942 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207942 steps, saw 134985 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:06:39] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:39] [INFO ] Invariant cache hit.
[2023-03-11 06:06:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:06:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:39] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:06:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:06:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:06:40] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:06:40] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:41] [INFO ] After 780ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:06:41] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 0 ms to minimize.
[2023-03-11 06:06:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-11 06:06:42] [INFO ] After 1663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 416 ms.
[2023-03-11 06:06:42] [INFO ] After 3098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 629 transition count 1638
Applied a total of 2 rules in 160 ms. Remains 629 /629 variables (removed 0) and now considering 1638/1640 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 629/629 places, 1638/1640 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 224474 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224474 steps, saw 145715 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:06:45] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
// Phase 1: matrix 1096 rows 629 cols
[2023-03-11 06:06:45] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-11 06:06:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:06:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:46] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:06:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:06:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 06:06:47] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:06:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:48] [INFO ] After 775ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:06:49] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2023-03-11 06:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-11 06:06:49] [INFO ] After 1604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 420 ms.
[2023-03-11 06:06:49] [INFO ] After 3088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Applied a total of 0 rules in 78 ms. Remains 629 /629 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 629/629 places, 1638/1638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Applied a total of 0 rules in 67 ms. Remains 629 /629 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2023-03-11 06:06:49] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
[2023-03-11 06:06:49] [INFO ] Invariant cache hit.
[2023-03-11 06:06:49] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-11 06:06:49] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
[2023-03-11 06:06:49] [INFO ] Invariant cache hit.
[2023-03-11 06:06:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:51] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2023-03-11 06:06:51] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 06:06:51] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
[2023-03-11 06:06:51] [INFO ] Invariant cache hit.
[2023-03-11 06:06:51] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2411 ms. Remains : 629/629 places, 1638/1638 transitions.
Graph (trivial) has 960 edges and 629 vertex of which 192 / 629 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 414 transitions
Reduce isomorphic transitions removed 734 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 501 transition count 894
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 491 transition count 894
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 21 place count 491 transition count 816
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 177 place count 413 transition count 816
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 240 place count 350 transition count 753
Iterating global reduction 2 with 63 rules applied. Total rules applied 303 place count 350 transition count 753
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 429 place count 350 transition count 627
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 687 place count 221 transition count 498
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 157 transition count 370
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 157 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 817 place count 157 transition count 368
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 880 place count 94 transition count 242
Iterating global reduction 4 with 63 rules applied. Total rules applied 943 place count 94 transition count 242
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1006 place count 31 transition count 116
Iterating global reduction 4 with 63 rules applied. Total rules applied 1069 place count 31 transition count 116
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1132 place count 31 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1132 place count 31 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1134 place count 30 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1136 place count 29 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1138 place count 28 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1139 place count 28 transition count 50
Applied a total of 1139 rules in 31 ms. Remains 28 /629 variables (removed 601) and now considering 50/1638 (removed 1588) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 50 rows 28 cols
[2023-03-11 06:06:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:06:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:06:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:52] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:06:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:06:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:52] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:06:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:06:52] [INFO ] After 26ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:06:52] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-11 06:06:52] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 572 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), p0, (OR p0 p1), p1]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), p0, (OR p0 p1), p1]
[2023-03-11 06:06:53] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-11 06:06:53] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 06:06:54] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-11 06:06:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:06:55] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2023-03-11 06:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:06:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 31 ms returned sat
[2023-03-11 06:06:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:06:56] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-11 06:06:56] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:06:56] [INFO ] [Nat]Added 271 Read/Feed constraints in 94 ms returned sat
[2023-03-11 06:06:56] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 883 transitions) in 119 ms.
[2023-03-11 06:06:57] [INFO ] Added : 20 causal constraints over 5 iterations in 531 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), p0, (OR p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Product exploration explored 100000 steps with 0 reset in 483 ms.
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Applied a total of 0 rules in 77 ms. Remains 629 /629 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-11 06:06:58] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:58] [INFO ] Invariant cache hit.
[2023-03-11 06:06:58] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-11 06:06:58] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:06:58] [INFO ] Invariant cache hit.
[2023-03-11 06:06:59] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:07:00] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2023-03-11 06:07:00] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 06:07:00] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-11 06:07:00] [INFO ] Invariant cache hit.
[2023-03-11 06:07:00] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2302 ms. Remains : 629/629 places, 1640/1640 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-14 finished in 48848 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((X(F(p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F((G(F(!p1))||(F(!p1)&&G(!p2)))))) U p2))'
[2023-03-11 06:07:01] [INFO ] Flatten gal took : 59 ms
[2023-03-11 06:07:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 06:07:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 731 places, 1900 transitions and 7726 arcs took 12 ms.
Total runtime 156750 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-c008
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678514917547
--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-c008-LTLFireability-13
lola: time limit : 1200 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
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1200 3/32 FunctionPointer-PT-c008-LTLFireability-13 239564 m, 47912 m/sec, 404013 t fired, .
Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1200 5/32 FunctionPointer-PT-c008-LTLFireability-13 488813 m, 49849 m/sec, 824421 t fired, .
Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1200 8/32 FunctionPointer-PT-c008-LTLFireability-13 737309 m, 49699 m/sec, 1243558 t fired, .
Time elapsed: 15 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1200 10/32 FunctionPointer-PT-c008-LTLFireability-13 985645 m, 49667 m/sec, 1662418 t fired, .
Time elapsed: 20 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1200 13/32 FunctionPointer-PT-c008-LTLFireability-13 1233542 m, 49579 m/sec, 2080551 t fired, .
Time elapsed: 25 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1200 15/32 FunctionPointer-PT-c008-LTLFireability-13 1481661 m, 49623 m/sec, 2499048 t fired, .
Time elapsed: 30 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1200 18/32 FunctionPointer-PT-c008-LTLFireability-13 1729366 m, 49541 m/sec, 2916855 t fired, .
Time elapsed: 35 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1200 20/32 FunctionPointer-PT-c008-LTLFireability-13 1977403 m, 49607 m/sec, 3335214 t fired, .
Time elapsed: 40 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1200 23/32 FunctionPointer-PT-c008-LTLFireability-13 2226714 m, 49862 m/sec, 3755725 t fired, .
Time elapsed: 45 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1200 25/32 FunctionPointer-PT-c008-LTLFireability-13 2476314 m, 49920 m/sec, 4176724 t fired, .
Time elapsed: 50 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1200 28/32 FunctionPointer-PT-c008-LTLFireability-13 2725639 m, 49865 m/sec, 4597258 t fired, .
Time elapsed: 55 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1200 30/32 FunctionPointer-PT-c008-LTLFireability-13 2975693 m, 50010 m/sec, 5019024 t fired, .
Time elapsed: 60 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for FunctionPointer-PT-c008-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-c008-LTLFireability-09
lola: time limit : 1767 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
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1767 6/32 FunctionPointer-PT-c008-LTLFireability-09 551393 m, 110278 m/sec, 929967 t fired, .
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1767 11/32 FunctionPointer-PT-c008-LTLFireability-09 1090375 m, 107796 m/sec, 1839068 t fired, .
Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1767 17/32 FunctionPointer-PT-c008-LTLFireability-09 1629287 m, 107782 m/sec, 2748054 t fired, .
Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1767 22/32 FunctionPointer-PT-c008-LTLFireability-09 2168450 m, 107832 m/sec, 3657457 t fired, .
Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1767 27/32 FunctionPointer-PT-c008-LTLFireability-09 2710785 m, 108467 m/sec, 4572206 t fired, .
Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-c008-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c008-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c008-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 FunctionPointer-PT-c008-LTLFireability-14
lola: time limit : 3505 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for FunctionPointer-PT-c008-LTLFireability-14
lola: result : false
lola: markings : 62
lola: fired transitions : 62
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c008-LTLFireability-09: LTL unknown AGGR
FunctionPointer-PT-c008-LTLFireability-13: LTL unknown AGGR
FunctionPointer-PT-c008-LTLFireability-14: LTL false LTL model checker
Time elapsed: 95 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="FunctionPointer-PT-c008"
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 FunctionPointer-PT-c008, 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 r167-tall-167838853500732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 ;