About the Execution of LTSMin+red for FunctionPointer-PT-c004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1230.451 | 137001.00 | 180949.00 | 873.40 | FFFF???FFTTFFTFF | 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.r169-tall-167838856300723.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-c004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856300723
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:59 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-c004-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678628273980
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:37:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 13:37:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:37:55] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2023-03-12 13:37:55] [INFO ] Transformed 2826 places.
[2023-03-12 13:37:55] [INFO ] Transformed 8960 transitions.
[2023-03-12 13:37:55] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FunctionPointer-PT-c004-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1613 transition count 5962
Discarding 295 places :
Symmetric choice reduction at 1 with 295 rule applications. Total rules 310 place count 1318 transition count 3704
Iterating global reduction 1 with 295 rules applied. Total rules applied 605 place count 1318 transition count 3704
Ensure Unique test removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Iterating post reduction 1 with 366 rules applied. Total rules applied 971 place count 1318 transition count 3338
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 1121 place count 1168 transition count 3038
Iterating global reduction 2 with 150 rules applied. Total rules applied 1271 place count 1168 transition count 3038
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1343 place count 1168 transition count 2966
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1355 place count 1156 transition count 2942
Iterating global reduction 3 with 12 rules applied. Total rules applied 1367 place count 1156 transition count 2942
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1378 place count 1145 transition count 2920
Iterating global reduction 3 with 11 rules applied. Total rules applied 1389 place count 1145 transition count 2920
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1400 place count 1134 transition count 2898
Iterating global reduction 3 with 11 rules applied. Total rules applied 1411 place count 1134 transition count 2898
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1422 place count 1123 transition count 2876
Iterating global reduction 3 with 11 rules applied. Total rules applied 1433 place count 1123 transition count 2876
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1444 place count 1112 transition count 2854
Iterating global reduction 3 with 11 rules applied. Total rules applied 1455 place count 1112 transition count 2854
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1466 place count 1101 transition count 2832
Iterating global reduction 3 with 11 rules applied. Total rules applied 1477 place count 1101 transition count 2832
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1487 place count 1091 transition count 2812
Iterating global reduction 3 with 10 rules applied. Total rules applied 1497 place count 1091 transition count 2812
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1536 place count 1052 transition count 2666
Iterating global reduction 3 with 39 rules applied. Total rules applied 1575 place count 1052 transition count 2666
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1622 place count 1005 transition count 2478
Iterating global reduction 3 with 47 rules applied. Total rules applied 1669 place count 1005 transition count 2478
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1714 place count 960 transition count 2358
Iterating global reduction 3 with 45 rules applied. Total rules applied 1759 place count 960 transition count 2358
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1803 place count 916 transition count 2270
Iterating global reduction 3 with 44 rules applied. Total rules applied 1847 place count 916 transition count 2270
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1891 place count 872 transition count 2182
Iterating global reduction 3 with 44 rules applied. Total rules applied 1935 place count 872 transition count 2182
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1979 place count 828 transition count 2094
Iterating global reduction 3 with 44 rules applied. Total rules applied 2023 place count 828 transition count 2094
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2067 place count 784 transition count 2006
Iterating global reduction 3 with 44 rules applied. Total rules applied 2111 place count 784 transition count 2006
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2126 place count 769 transition count 1976
Iterating global reduction 3 with 15 rules applied. Total rules applied 2141 place count 769 transition count 1976
Applied a total of 2141 rules in 1148 ms. Remains 769 /1628 variables (removed 859) and now considering 1976/5962 (removed 3986) transitions.
[2023-03-12 13:37:57] [INFO ] Flow matrix only has 1335 transitions (discarded 641 similar events)
// Phase 1: matrix 1335 rows 769 cols
[2023-03-12 13:37:57] [INFO ] Computed 2 place invariants in 36 ms
[2023-03-12 13:37:58] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-12 13:37:58] [INFO ] Flow matrix only has 1335 transitions (discarded 641 similar events)
[2023-03-12 13:37:58] [INFO ] Invariant cache hit.
[2023-03-12 13:37:58] [INFO ] State equation strengthened by 324 read => feed constraints.
[2023-03-12 13:38:00] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 3002 ms to find 0 implicit places.
[2023-03-12 13:38:00] [INFO ] Flow matrix only has 1335 transitions (discarded 641 similar events)
[2023-03-12 13:38:00] [INFO ] Invariant cache hit.
[2023-03-12 13:38:00] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 769/1628 places, 1976/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4773 ms. Remains : 769/1628 places, 1976/5962 transitions.
Support contains 21 out of 769 places after structural reductions.
[2023-03-12 13:38:01] [INFO ] Flatten gal took : 144 ms
[2023-03-12 13:38:01] [INFO ] Flatten gal took : 97 ms
[2023-03-12 13:38:01] [INFO ] Input system was already deterministic with 1976 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-12 13:38:02] [INFO ] Flow matrix only has 1335 transitions (discarded 641 similar events)
[2023-03-12 13:38:02] [INFO ] Invariant cache hit.
[2023-03-12 13:38:02] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:38:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:38:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:38:02] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:38:02] [INFO ] State equation strengthened by 324 read => feed constraints.
[2023-03-12 13:38:03] [INFO ] After 158ms SMT Verify possible using 324 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:38:03] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-12 13:38:03] [INFO ] After 1110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Graph (complete) has 3257 edges and 769 vertex of which 575 are kept as prefixes of interest. Removing 194 places using SCC suffix rule.6 ms
Discarding 194 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 575 transition count 1592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 399 place count 561 transition count 1560
Iterating global reduction 1 with 14 rules applied. Total rules applied 413 place count 561 transition count 1560
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 419 place count 561 transition count 1554
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 430 place count 550 transition count 1528
Iterating global reduction 2 with 11 rules applied. Total rules applied 441 place count 550 transition count 1528
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 452 place count 539 transition count 1502
Iterating global reduction 2 with 11 rules applied. Total rules applied 463 place count 539 transition count 1502
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 476 place count 526 transition count 1468
Iterating global reduction 2 with 13 rules applied. Total rules applied 489 place count 526 transition count 1468
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 501 place count 514 transition count 1438
Iterating global reduction 2 with 12 rules applied. Total rules applied 513 place count 514 transition count 1438
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 523 place count 504 transition count 1418
Iterating global reduction 2 with 10 rules applied. Total rules applied 533 place count 504 transition count 1418
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 543 place count 494 transition count 1394
Iterating global reduction 2 with 10 rules applied. Total rules applied 553 place count 494 transition count 1394
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 562 place count 485 transition count 1372
Iterating global reduction 2 with 9 rules applied. Total rules applied 571 place count 485 transition count 1372
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 579 place count 477 transition count 1356
Iterating global reduction 2 with 8 rules applied. Total rules applied 587 place count 477 transition count 1356
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 595 place count 469 transition count 1336
Iterating global reduction 2 with 8 rules applied. Total rules applied 603 place count 469 transition count 1336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 608 place count 464 transition count 1320
Iterating global reduction 2 with 5 rules applied. Total rules applied 613 place count 464 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 618 place count 459 transition count 1308
Iterating global reduction 2 with 5 rules applied. Total rules applied 623 place count 459 transition count 1308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 628 place count 454 transition count 1298
Iterating global reduction 2 with 5 rules applied. Total rules applied 633 place count 454 transition count 1298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 636 place count 451 transition count 1292
Iterating global reduction 2 with 3 rules applied. Total rules applied 639 place count 451 transition count 1292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 642 place count 448 transition count 1286
Iterating global reduction 2 with 3 rules applied. Total rules applied 645 place count 448 transition count 1286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 648 place count 445 transition count 1280
Iterating global reduction 2 with 3 rules applied. Total rules applied 651 place count 445 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 652 place count 444 transition count 1278
Iterating global reduction 2 with 1 rules applied. Total rules applied 653 place count 444 transition count 1278
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 663 place count 444 transition count 1268
Applied a total of 663 rules in 425 ms. Remains 444 /769 variables (removed 325) and now considering 1268/1976 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 444/769 places, 1268/1976 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) 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 :1
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
Running SMT prover for 2 properties.
[2023-03-12 13:38:03] [INFO ] Flow matrix only has 725 transitions (discarded 543 similar events)
// Phase 1: matrix 725 rows 444 cols
[2023-03-12 13:38:03] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 13:38:04] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:38:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:38:04] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:04] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-12 13:38:04] [INFO ] After 61ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:04] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-12 13:38:04] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1268/1268 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 442 transition count 1264
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 442 transition count 1264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 440 transition count 1258
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 440 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 438 transition count 1252
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 438 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 436 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 436 transition count 1248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 434 transition count 1244
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 434 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 432 transition count 1240
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 432 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 430 transition count 1236
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 430 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 428 transition count 1232
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 427 transition count 1230
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 427 transition count 1230
Applied a total of 34 rules in 122 ms. Remains 427 /444 variables (removed 17) and now considering 1230/1268 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 427/444 places, 1230/1268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 360054 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 360054 steps, saw 220790 distinct states, run finished after 3003 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:38:07] [INFO ] Flow matrix only has 698 transitions (discarded 532 similar events)
// Phase 1: matrix 698 rows 427 cols
[2023-03-12 13:38:07] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 13:38:07] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:38:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:38:08] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 13:38:08] [INFO ] After 65ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:08] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-12 13:38:08] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 46 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 427/427 places, 1230/1230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 46 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
[2023-03-12 13:38:08] [INFO ] Flow matrix only has 698 transitions (discarded 532 similar events)
[2023-03-12 13:38:08] [INFO ] Invariant cache hit.
[2023-03-12 13:38:08] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 13:38:08] [INFO ] Flow matrix only has 698 transitions (discarded 532 similar events)
[2023-03-12 13:38:08] [INFO ] Invariant cache hit.
[2023-03-12 13:38:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 13:38:09] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2023-03-12 13:38:09] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-12 13:38:09] [INFO ] Flow matrix only has 698 transitions (discarded 532 similar events)
[2023-03-12 13:38:09] [INFO ] Invariant cache hit.
[2023-03-12 13:38:10] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1930 ms. Remains : 427/427 places, 1230/1230 transitions.
Ensure Unique test removed 532 transitions
Reduce isomorphic transitions removed 532 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 427 transition count 687
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 554 place count 416 transition count 687
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 554 place count 416 transition count 613
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 702 place count 342 transition count 613
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 2 with 256 rules applied. Total rules applied 958 place count 214 transition count 485
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1022 place count 150 transition count 357
Iterating global reduction 2 with 64 rules applied. Total rules applied 1086 place count 150 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1087 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1150 place count 87 transition count 230
Iterating global reduction 3 with 63 rules applied. Total rules applied 1213 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1276 place count 24 transition count 104
Iterating global reduction 3 with 63 rules applied. Total rules applied 1339 place count 24 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1402 place count 24 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1402 place count 24 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1404 place count 23 transition count 40
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 4 with 2 rules applied. Total rules applied 1406 place count 22 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1407 place count 22 transition count 38
Applied a total of 1407 rules in 52 ms. Remains 22 /427 variables (removed 405) and now considering 38/1230 (removed 1192) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 22 cols
[2023-03-12 13:38:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 13:38:10] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:38:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:38:10] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:38:10] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:10] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 13:38:10] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4361 edges and 769 vertex of which 767 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(F(p0))||(p1&&F(p0))))))))'
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 767 transition count 1976
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 751 transition count 1940
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 751 transition count 1940
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 751 transition count 1934
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 53 place count 738 transition count 1900
Iterating global reduction 2 with 13 rules applied. Total rules applied 66 place count 738 transition count 1900
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 79 place count 725 transition count 1864
Iterating global reduction 2 with 13 rules applied. Total rules applied 92 place count 725 transition count 1864
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 710 transition count 1824
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 710 transition count 1824
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 136 place count 696 transition count 1790
Iterating global reduction 2 with 14 rules applied. Total rules applied 150 place count 696 transition count 1790
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 163 place count 683 transition count 1764
Iterating global reduction 2 with 13 rules applied. Total rules applied 176 place count 683 transition count 1764
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 189 place count 670 transition count 1734
Iterating global reduction 2 with 13 rules applied. Total rules applied 202 place count 670 transition count 1734
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 214 place count 658 transition count 1706
Iterating global reduction 2 with 12 rules applied. Total rules applied 226 place count 658 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 235 place count 649 transition count 1688
Iterating global reduction 2 with 9 rules applied. Total rules applied 244 place count 649 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 252 place count 641 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 260 place count 641 transition count 1668
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 265 place count 636 transition count 1652
Iterating global reduction 2 with 5 rules applied. Total rules applied 270 place count 636 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 275 place count 631 transition count 1640
Iterating global reduction 2 with 5 rules applied. Total rules applied 280 place count 631 transition count 1640
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 285 place count 626 transition count 1630
Iterating global reduction 2 with 5 rules applied. Total rules applied 290 place count 626 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 293 place count 623 transition count 1624
Iterating global reduction 2 with 3 rules applied. Total rules applied 296 place count 623 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 299 place count 620 transition count 1618
Iterating global reduction 2 with 3 rules applied. Total rules applied 302 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 617 transition count 1612
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 617 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 309 place count 616 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 616 transition count 1610
Applied a total of 310 rules in 483 ms. Remains 616 /769 variables (removed 153) and now considering 1610/1976 (removed 366) transitions.
[2023-03-12 13:38:11] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2023-03-12 13:38:11] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:38:11] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-12 13:38:11] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
[2023-03-12 13:38:11] [INFO ] Invariant cache hit.
[2023-03-12 13:38:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:38:13] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2023-03-12 13:38:13] [INFO ] Flow matrix only has 1078 transitions (discarded 532 similar events)
[2023-03-12 13:38:13] [INFO ] Invariant cache hit.
[2023-03-12 13:38:13] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/769 places, 1610/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3148 ms. Remains : 616/769 places, 1610/1976 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s534 0), p0:(GT s531 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 510 ms.
Stack based approach found an accepted trace after 535 steps with 0 reset with depth 536 and stack size 536 in 3 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-00 finished in 4038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U G(p1)))'
Support contains 3 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 767 transition count 1976
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 751 transition count 1938
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 751 transition count 1938
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 751 transition count 1934
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 52 place count 737 transition count 1900
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 737 transition count 1900
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 80 place count 723 transition count 1864
Iterating global reduction 2 with 14 rules applied. Total rules applied 94 place count 723 transition count 1864
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 110 place count 707 transition count 1822
Iterating global reduction 2 with 16 rules applied. Total rules applied 126 place count 707 transition count 1822
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 141 place count 692 transition count 1786
Iterating global reduction 2 with 15 rules applied. Total rules applied 156 place count 692 transition count 1786
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 167 place count 681 transition count 1764
Iterating global reduction 2 with 11 rules applied. Total rules applied 178 place count 681 transition count 1764
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 188 place count 671 transition count 1740
Iterating global reduction 2 with 10 rules applied. Total rules applied 198 place count 671 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 207 place count 662 transition count 1718
Iterating global reduction 2 with 9 rules applied. Total rules applied 216 place count 662 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 655 transition count 1704
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 655 transition count 1704
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 235 place count 650 transition count 1694
Iterating global reduction 2 with 5 rules applied. Total rules applied 240 place count 650 transition count 1694
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 244 place count 646 transition count 1682
Iterating global reduction 2 with 4 rules applied. Total rules applied 248 place count 646 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 252 place count 642 transition count 1670
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 642 transition count 1670
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 260 place count 638 transition count 1662
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 638 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 266 place count 636 transition count 1658
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 636 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 270 place count 634 transition count 1654
Iterating global reduction 2 with 2 rules applied. Total rules applied 272 place count 634 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 274 place count 632 transition count 1650
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 632 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 278 place count 630 transition count 1646
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 630 transition count 1646
Applied a total of 280 rules in 310 ms. Remains 630 /769 variables (removed 139) and now considering 1646/1976 (removed 330) transitions.
[2023-03-12 13:38:14] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
// Phase 1: matrix 1100 rows 630 cols
[2023-03-12 13:38:14] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:38:15] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-12 13:38:15] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2023-03-12 13:38:15] [INFO ] Invariant cache hit.
[2023-03-12 13:38:15] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:38:17] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
[2023-03-12 13:38:17] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2023-03-12 13:38:17] [INFO ] Invariant cache hit.
[2023-03-12 13:38:17] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 630/769 places, 1646/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3006 ms. Remains : 630/769 places, 1646/1976 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s537), p0:(GT s561 s552)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-02 finished in 3261 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(F(p0))||G(p1))))'
Support contains 4 out of 769 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Graph (complete) has 4361 edges and 769 vertex of which 768 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 753 transition count 1942
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 753 transition count 1942
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 753 transition count 1936
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 741 transition count 1906
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 741 transition count 1906
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 73 place count 729 transition count 1874
Iterating global reduction 1 with 12 rules applied. Total rules applied 85 place count 729 transition count 1874
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 99 place count 715 transition count 1838
Iterating global reduction 1 with 14 rules applied. Total rules applied 113 place count 715 transition count 1838
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 126 place count 702 transition count 1806
Iterating global reduction 1 with 13 rules applied. Total rules applied 139 place count 702 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 150 place count 691 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 161 place count 691 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 681 transition count 1760
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 681 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 191 place count 671 transition count 1736
Iterating global reduction 1 with 10 rules applied. Total rules applied 201 place count 671 transition count 1736
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 208 place count 664 transition count 1722
Iterating global reduction 1 with 7 rules applied. Total rules applied 215 place count 664 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 222 place count 657 transition count 1704
Iterating global reduction 1 with 7 rules applied. Total rules applied 229 place count 657 transition count 1704
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 233 place count 653 transition count 1692
Iterating global reduction 1 with 4 rules applied. Total rules applied 237 place count 653 transition count 1692
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 241 place count 649 transition count 1684
Iterating global reduction 1 with 4 rules applied. Total rules applied 245 place count 649 transition count 1684
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 249 place count 645 transition count 1676
Iterating global reduction 1 with 4 rules applied. Total rules applied 253 place count 645 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 255 place count 643 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 257 place count 643 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 259 place count 641 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 261 place count 641 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 263 place count 639 transition count 1664
Iterating global reduction 1 with 2 rules applied. Total rules applied 265 place count 639 transition count 1664
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 271 place count 639 transition count 1658
Applied a total of 271 rules in 615 ms. Remains 639 /769 variables (removed 130) and now considering 1658/1976 (removed 318) transitions.
[2023-03-12 13:38:18] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2023-03-12 13:38:18] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:38:18] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-12 13:38:18] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:18] [INFO ] Invariant cache hit.
[2023-03-12 13:38:19] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 13:38:20] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
[2023-03-12 13:38:20] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 13:38:20] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:20] [INFO ] Invariant cache hit.
[2023-03-12 13:38:21] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 639/769 places, 1658/1976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3287 ms. Remains : 639/769 places, 1658/1976 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-04 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:(LEQ s551 s426), p0:(OR (LEQ 1 s544) (GT 2 s574))], 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 400 ms.
Product exploration explored 100000 steps with 0 reset in 506 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:38:22] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:22] [INFO ] Invariant cache hit.
[2023-03-12 13:38:22] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:38:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:38:22] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:22] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 13:38:23] [INFO ] After 89ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:23] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-12 13:38:23] [INFO ] After 538ms 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 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1274
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 447 transition count 1272
Applied a total of 387 rules in 100 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 447/639 places, 1272/1658 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 572020 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 572020 steps, saw 350753 distinct states, run finished after 3003 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:38:26] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2023-03-12 13:38:26] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 13:38:26] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-12 13:38:26] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:26] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-12 13:38:26] [INFO ] After 44ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:26] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 13:38:26] [INFO ] After 344ms 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 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 50 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 48 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2023-03-12 13:38:26] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2023-03-12 13:38:26] [INFO ] Invariant cache hit.
[2023-03-12 13:38:27] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-12 13:38:27] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2023-03-12 13:38:27] [INFO ] Invariant cache hit.
[2023-03-12 13:38:27] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-12 13:38:28] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-12 13:38:28] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 13:38:28] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2023-03-12 13:38:28] [INFO ] Invariant cache hit.
[2023-03-12 13:38:28] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1643 ms. Remains : 447/447 places, 1272/1272 transitions.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
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 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
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 4 with 2 rules applied. Total rules applied 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 37 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2023-03-12 13:38:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 13:38:28] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:38:28] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:38:28] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:28] [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-12 13:38:28] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 200 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 79 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))]
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 85 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2023-03-12 13:38:28] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2023-03-12 13:38:28] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 13:38:29] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-12 13:38:29] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:29] [INFO ] Invariant cache hit.
[2023-03-12 13:38:29] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 13:38:31] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
[2023-03-12 13:38:31] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 13:38:31] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:31] [INFO ] Invariant cache hit.
[2023-03-12 13:38:31] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2985 ms. Remains : 639/639 places, 1658/1658 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 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 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) 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-12 13:38:32] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:32] [INFO ] Invariant cache hit.
[2023-03-12 13:38:32] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:38:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:38:32] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:32] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 13:38:32] [INFO ] After 94ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:32] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-12 13:38:32] [INFO ] After 522ms 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 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1274
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 447 transition count 1272
Applied a total of 387 rules in 99 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 447/639 places, 1272/1658 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 572026 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 572026 steps, saw 350758 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:38:35] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2023-03-12 13:38:35] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 13:38:36] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:38:36] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:36] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-12 13:38:36] [INFO ] After 48ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:36] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 13:38:36] [INFO ] After 355ms 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 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 49 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 48 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2023-03-12 13:38:36] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2023-03-12 13:38:36] [INFO ] Invariant cache hit.
[2023-03-12 13:38:36] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 13:38:36] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2023-03-12 13:38:36] [INFO ] Invariant cache hit.
[2023-03-12 13:38:37] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-12 13:38:37] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2023-03-12 13:38:37] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 13:38:37] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2023-03-12 13:38:37] [INFO ] Invariant cache hit.
[2023-03-12 13:38:38] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1720 ms. Remains : 447/447 places, 1272/1272 transitions.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
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 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
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 4 with 2 rules applied. Total rules applied 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 29 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2023-03-12 13:38:38] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 13:38:38] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:38:38] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:38:38] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:38] [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-12 13:38:38] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 232 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 432 ms.
Product exploration explored 100000 steps with 0 reset in 487 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 78 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2023-03-12 13:38:39] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2023-03-12 13:38:39] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:38:40] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-12 13:38:40] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:40] [INFO ] Invariant cache hit.
[2023-03-12 13:38:40] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-12 13:38:41] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-12 13:38:42] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 13:38:42] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2023-03-12 13:38:42] [INFO ] Invariant cache hit.
[2023-03-12 13:38:42] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2832 ms. Remains : 639/639 places, 1658/1658 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-04 finished in 24811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
Support contains 3 out of 769 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Graph (complete) has 4361 edges and 769 vertex of which 767 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 752 transition count 1940
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 752 transition count 1940
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 752 transition count 1936
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 740 transition count 1904
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 740 transition count 1904
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 728 transition count 1870
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 728 transition count 1870
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 95 place count 716 transition count 1842
Iterating global reduction 1 with 12 rules applied. Total rules applied 107 place count 716 transition count 1842
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 704 transition count 1818
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 704 transition count 1818
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 141 place count 694 transition count 1798
Iterating global reduction 1 with 10 rules applied. Total rules applied 151 place count 694 transition count 1798
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 159 place count 686 transition count 1782
Iterating global reduction 1 with 8 rules applied. Total rules applied 167 place count 686 transition count 1782
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 174 place count 679 transition count 1768
Iterating global reduction 1 with 7 rules applied. Total rules applied 181 place count 679 transition count 1768
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 675 transition count 1760
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 675 transition count 1760
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 193 place count 671 transition count 1746
Iterating global reduction 1 with 4 rules applied. Total rules applied 197 place count 671 transition count 1746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 202 place count 666 transition count 1726
Iterating global reduction 1 with 5 rules applied. Total rules applied 207 place count 666 transition count 1726
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 212 place count 661 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 217 place count 661 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 222 place count 656 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 227 place count 656 transition count 1702
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 232 place count 651 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 237 place count 651 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 242 place count 646 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 247 place count 646 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 252 place count 641 transition count 1672
Iterating global reduction 1 with 5 rules applied. Total rules applied 257 place count 641 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 259 place count 639 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 261 place count 639 transition count 1668
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 269 place count 639 transition count 1660
Applied a total of 269 rules in 514 ms. Remains 639 /769 variables (removed 130) and now considering 1660/1976 (removed 316) transitions.
[2023-03-12 13:38:43] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2023-03-12 13:38:43] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:38:43] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-12 13:38:43] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:43] [INFO ] Invariant cache hit.
[2023-03-12 13:38:43] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-12 13:38:45] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2023-03-12 13:38:45] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 13:38:45] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:45] [INFO ] Invariant cache hit.
[2023-03-12 13:38:45] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 639/769 places, 1660/1976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3062 ms. Remains : 639/769 places, 1660/1976 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s537 0), p0:(GT 2 s555), p1:(GT s571 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 468 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) 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 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:38:47] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:47] [INFO ] Invariant cache hit.
[2023-03-12 13:38:47] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:38:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:38:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:38:47] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:47] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-12 13:38:48] [INFO ] After 131ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:48] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 13:38:48] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Graph (complete) has 2769 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1276
Applied a total of 385 rules in 50 ms. Remains 447 /639 variables (removed 192) and now considering 1276/1660 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 447/639 places, 1276/1660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 364358 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364358 steps, saw 223427 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:38:51] [INFO ] Flow matrix only has 729 transitions (discarded 547 similar events)
// Phase 1: matrix 729 rows 447 cols
[2023-03-12 13:38:51] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 13:38:51] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:38:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:38:51] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:51] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 13:38:51] [INFO ] After 93ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:51] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-12 13:38:52] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 447/447 places, 1276/1276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1276/1276 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1276/1276 (removed 0) transitions.
[2023-03-12 13:38:52] [INFO ] Flow matrix only has 729 transitions (discarded 547 similar events)
[2023-03-12 13:38:52] [INFO ] Invariant cache hit.
[2023-03-12 13:38:52] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 13:38:52] [INFO ] Flow matrix only has 729 transitions (discarded 547 similar events)
[2023-03-12 13:38:52] [INFO ] Invariant cache hit.
[2023-03-12 13:38:52] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 13:38:53] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-12 13:38:53] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 13:38:53] [INFO ] Flow matrix only has 729 transitions (discarded 547 similar events)
[2023-03-12 13:38:53] [INFO ] Invariant cache hit.
[2023-03-12 13:38:53] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1656 ms. Remains : 447/447 places, 1276/1276 transitions.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 447 transition count 715
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 433 transition count 715
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 433 transition count 634
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 352 transition count 634
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 997 place count 222 transition count 504
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1061 place count 158 transition count 376
Iterating global reduction 2 with 64 rules applied. Total rules applied 1125 place count 158 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1126 place count 158 transition count 375
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1189 place count 95 transition count 249
Iterating global reduction 3 with 63 rules applied. Total rules applied 1252 place count 95 transition count 249
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1315 place count 32 transition count 123
Iterating global reduction 3 with 63 rules applied. Total rules applied 1378 place count 32 transition count 123
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1441 place count 32 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1441 place count 32 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 31 transition count 59
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 4 with 2 rules applied. Total rules applied 1445 place count 30 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1451 place count 27 transition count 58
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1454 place count 27 transition count 55
Applied a total of 1454 rules in 26 ms. Remains 27 /447 variables (removed 420) and now considering 55/1276 (removed 1221) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 55 rows 27 cols
[2023-03-12 13:38:53] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 13:38:53] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:38:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:38:53] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:38:53] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:38:53] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 13:38:53] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 81 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-12 13:38:54] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2023-03-12 13:38:54] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 13:38:54] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-12 13:38:54] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:54] [INFO ] Invariant cache hit.
[2023-03-12 13:38:55] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-12 13:38:56] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2023-03-12 13:38:56] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 13:38:56] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:56] [INFO ] Invariant cache hit.
[2023-03-12 13:38:56] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2605 ms. Remains : 639/639 places, 1660/1660 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :2
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-12 13:38:57] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:57] [INFO ] Invariant cache hit.
[2023-03-12 13:38:57] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:38:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:38:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:38:57] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:57] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-12 13:38:58] [INFO ] After 112ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:38:58] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-12 13:38:58] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Graph (complete) has 2769 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 387 place count 445 transition count 1272
Iterating global reduction 1 with 2 rules applied. Total rules applied 389 place count 445 transition count 1272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 391 place count 445 transition count 1270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 393 place count 443 transition count 1266
Iterating global reduction 2 with 2 rules applied. Total rules applied 395 place count 443 transition count 1266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 397 place count 441 transition count 1262
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 441 transition count 1262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 402 place count 438 transition count 1252
Iterating global reduction 2 with 3 rules applied. Total rules applied 405 place count 438 transition count 1252
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 408 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 411 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 414 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 417 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 420 place count 429 transition count 1232
Iterating global reduction 2 with 3 rules applied. Total rules applied 423 place count 429 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 426 place count 426 transition count 1226
Iterating global reduction 2 with 3 rules applied. Total rules applied 429 place count 426 transition count 1226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 432 place count 423 transition count 1220
Iterating global reduction 2 with 3 rules applied. Total rules applied 435 place count 423 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 438 place count 420 transition count 1214
Iterating global reduction 2 with 3 rules applied. Total rules applied 441 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 442 place count 419 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 443 place count 419 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 444 place count 418 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 445 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 446 place count 417 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 447 place count 417 transition count 1208
Applied a total of 447 rules in 160 ms. Remains 417 /639 variables (removed 222) and now considering 1208/1660 (removed 452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 417/639 places, 1208/1660 transitions.
Finished random walk after 6746 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=421 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 1 reset in 469 ms.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 92 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-12 13:38:59] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:38:59] [INFO ] Invariant cache hit.
[2023-03-12 13:39:00] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-12 13:39:00] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:39:00] [INFO ] Invariant cache hit.
[2023-03-12 13:39:00] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-12 13:39:01] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2023-03-12 13:39:01] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 13:39:01] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2023-03-12 13:39:01] [INFO ] Invariant cache hit.
[2023-03-12 13:39:02] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2613 ms. Remains : 639/639 places, 1660/1660 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-05 finished in 19901 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(p0))))'
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 767 transition count 1976
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 751 transition count 1938
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 751 transition count 1938
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 751 transition count 1932
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 53 place count 738 transition count 1900
Iterating global reduction 2 with 13 rules applied. Total rules applied 66 place count 738 transition count 1900
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 79 place count 725 transition count 1868
Iterating global reduction 2 with 13 rules applied. Total rules applied 92 place count 725 transition count 1868
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 710 transition count 1830
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 710 transition count 1830
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 136 place count 696 transition count 1796
Iterating global reduction 2 with 14 rules applied. Total rules applied 150 place count 696 transition count 1796
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 162 place count 684 transition count 1772
Iterating global reduction 2 with 12 rules applied. Total rules applied 174 place count 684 transition count 1772
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 673 transition count 1746
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 673 transition count 1746
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 206 place count 663 transition count 1722
Iterating global reduction 2 with 10 rules applied. Total rules applied 216 place count 663 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 224 place count 655 transition count 1706
Iterating global reduction 2 with 8 rules applied. Total rules applied 232 place count 655 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 240 place count 647 transition count 1686
Iterating global reduction 2 with 8 rules applied. Total rules applied 248 place count 647 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 253 place count 642 transition count 1670
Iterating global reduction 2 with 5 rules applied. Total rules applied 258 place count 642 transition count 1670
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 263 place count 637 transition count 1658
Iterating global reduction 2 with 5 rules applied. Total rules applied 268 place count 637 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 273 place count 632 transition count 1648
Iterating global reduction 2 with 5 rules applied. Total rules applied 278 place count 632 transition count 1648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 281 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 284 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 287 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 290 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 293 place count 623 transition count 1630
Iterating global reduction 2 with 3 rules applied. Total rules applied 296 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 622 transition count 1628
Applied a total of 298 rules in 302 ms. Remains 622 /769 variables (removed 147) and now considering 1628/1976 (removed 348) transitions.
[2023-03-12 13:39:02] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2023-03-12 13:39:02] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 13:39:03] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-12 13:39:03] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:03] [INFO ] Invariant cache hit.
[2023-03-12 13:39:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:39:05] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
[2023-03-12 13:39:05] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:05] [INFO ] Invariant cache hit.
[2023-03-12 13:39:05] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 622/769 places, 1628/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2985 ms. Remains : 622/769 places, 1628/1976 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06 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 p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ s550 s540)], 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]]
Product exploration explored 100000 steps with 0 reset in 364 ms.
Product exploration explored 100000 steps with 0 reset in 454 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 515285 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 515285 steps, saw 334454 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:39:09] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:09] [INFO ] Invariant cache hit.
[2023-03-12 13:39:09] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:39:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:39:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:39:10] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:10] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:39:10] [INFO ] After 68ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:10] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 13:39:10] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1244
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 430 transition count 1238
Applied a total of 391 rules in 98 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 430/622 places, 1238/1628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 614872 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614872 steps, saw 377029 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:39:13] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
// Phase 1: matrix 702 rows 430 cols
[2023-03-12 13:39:13] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 13:39:13] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:39:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:39:13] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 13:39:13] [INFO ] After 39ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:13] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 13:39:13] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 48 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 430/430 places, 1238/1238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2023-03-12 13:39:14] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
[2023-03-12 13:39:14] [INFO ] Invariant cache hit.
[2023-03-12 13:39:14] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-12 13:39:14] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
[2023-03-12 13:39:14] [INFO ] Invariant cache hit.
[2023-03-12 13:39:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 13:39:15] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2023-03-12 13:39:15] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 13:39:15] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
[2023-03-12 13:39:15] [INFO ] Invariant cache hit.
[2023-03-12 13:39:15] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1630 ms. Remains : 430/430 places, 1238/1238 transitions.
Ensure Unique test removed 536 transitions
Reduce isomorphic transitions removed 536 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 430 transition count 693
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 554 place count 421 transition count 693
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 554 place count 421 transition count 617
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 706 place count 345 transition count 617
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 2 with 258 rules applied. Total rules applied 964 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 152 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 152 transition count 359
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 89 transition count 233
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 89 transition count 233
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 26 transition count 107
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 26 transition count 107
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 26 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 26 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 25 transition count 43
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 4 with 2 rules applied. Total rules applied 1412 place count 24 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 4 with 2 rules applied. Total rules applied 1414 place count 23 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 23 transition count 41
Applied a total of 1415 rules in 26 ms. Remains 23 /430 variables (removed 407) and now considering 41/1238 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 23 cols
[2023-03-12 13:39:15] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 13:39:15] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:39:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:39:15] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:39:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:15] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 13:39:15] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2023-03-12 13:39:16] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2023-03-12 13:39:16] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 13:39:16] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 13:39:16] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:16] [INFO ] Invariant cache hit.
[2023-03-12 13:39:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:39:18] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
[2023-03-12 13:39:18] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:18] [INFO ] Invariant cache hit.
[2023-03-12 13:39:19] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3069 ms. Remains : 622/622 places, 1628/1628 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) 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 524685 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524685 steps, saw 340554 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:39:22] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:22] [INFO ] Invariant cache hit.
[2023-03-12 13:39:22] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:39:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:39:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:39:22] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:39:22] [INFO ] After 64ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:22] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 13:39:22] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1244
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 430 transition count 1238
Applied a total of 391 rules in 93 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 430/622 places, 1238/1628 transitions.
Incomplete random walk after 10002 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 613843 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613843 steps, saw 376397 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:39:26] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
// Phase 1: matrix 702 rows 430 cols
[2023-03-12 13:39:26] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:39:26] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:39:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:39:26] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 13:39:26] [INFO ] After 46ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:26] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 13:39:26] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 45 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 430/430 places, 1238/1238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 49 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2023-03-12 13:39:26] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
[2023-03-12 13:39:26] [INFO ] Invariant cache hit.
[2023-03-12 13:39:26] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-12 13:39:26] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
[2023-03-12 13:39:26] [INFO ] Invariant cache hit.
[2023-03-12 13:39:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-12 13:39:27] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2023-03-12 13:39:27] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 13:39:27] [INFO ] Flow matrix only has 702 transitions (discarded 536 similar events)
[2023-03-12 13:39:27] [INFO ] Invariant cache hit.
[2023-03-12 13:39:28] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1699 ms. Remains : 430/430 places, 1238/1238 transitions.
Ensure Unique test removed 536 transitions
Reduce isomorphic transitions removed 536 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 430 transition count 693
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 554 place count 421 transition count 693
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 554 place count 421 transition count 617
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 706 place count 345 transition count 617
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 2 with 258 rules applied. Total rules applied 964 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 152 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 152 transition count 359
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 89 transition count 233
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 89 transition count 233
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 26 transition count 107
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 26 transition count 107
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 26 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 26 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 25 transition count 43
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 4 with 2 rules applied. Total rules applied 1412 place count 24 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 4 with 2 rules applied. Total rules applied 1414 place count 23 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 23 transition count 41
Applied a total of 1415 rules in 23 ms. Remains 23 /430 variables (removed 407) and now considering 41/1238 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 23 cols
[2023-03-12 13:39:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 13:39:28] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:39:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:39:28] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:39:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:39:28] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 13:39:28] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Product exploration explored 100000 steps with 0 reset in 408 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 19 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2023-03-12 13:39:29] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2023-03-12 13:39:29] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:39:30] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-12 13:39:30] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:30] [INFO ] Invariant cache hit.
[2023-03-12 13:39:30] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:39:31] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2023-03-12 13:39:31] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:31] [INFO ] Invariant cache hit.
[2023-03-12 13:39:32] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2656 ms. Remains : 622/622 places, 1628/1628 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 29836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 767 transition count 1976
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 750 transition count 1936
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 750 transition count 1936
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 750 transition count 1930
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 56 place count 736 transition count 1896
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 736 transition count 1896
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 84 place count 722 transition count 1860
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 722 transition count 1860
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 706 transition count 1818
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 706 transition count 1818
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 145 place count 691 transition count 1782
Iterating global reduction 2 with 15 rules applied. Total rules applied 160 place count 691 transition count 1782
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 173 place count 678 transition count 1756
Iterating global reduction 2 with 13 rules applied. Total rules applied 186 place count 678 transition count 1756
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 198 place count 666 transition count 1728
Iterating global reduction 2 with 12 rules applied. Total rules applied 210 place count 666 transition count 1728
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 221 place count 655 transition count 1702
Iterating global reduction 2 with 11 rules applied. Total rules applied 232 place count 655 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 241 place count 646 transition count 1684
Iterating global reduction 2 with 9 rules applied. Total rules applied 250 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 258 place count 638 transition count 1664
Iterating global reduction 2 with 8 rules applied. Total rules applied 266 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 271 place count 633 transition count 1648
Iterating global reduction 2 with 5 rules applied. Total rules applied 276 place count 633 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 281 place count 628 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 286 place count 628 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 291 place count 623 transition count 1626
Iterating global reduction 2 with 5 rules applied. Total rules applied 296 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 299 place count 620 transition count 1620
Iterating global reduction 2 with 3 rules applied. Total rules applied 302 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 617 transition count 1614
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 311 place count 614 transition count 1608
Iterating global reduction 2 with 3 rules applied. Total rules applied 314 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 613 transition count 1606
Applied a total of 316 rules in 280 ms. Remains 613 /769 variables (removed 156) and now considering 1606/1976 (removed 370) transitions.
[2023-03-12 13:39:32] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 13:39:32] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 13:39:33] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-12 13:39:33] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 13:39:33] [INFO ] Invariant cache hit.
[2023-03-12 13:39:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:39:34] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2023-03-12 13:39:34] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 13:39:34] [INFO ] Invariant cache hit.
[2023-03-12 13:39:35] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/769 places, 1606/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2629 ms. Remains : 613/769 places, 1606/1976 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s540)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-07 finished in 2746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Graph (complete) has 4361 edges and 769 vertex of which 768 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 752 transition count 1940
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 752 transition count 1940
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 39 place count 752 transition count 1934
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 739 transition count 1900
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 739 transition count 1900
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 78 place count 726 transition count 1864
Iterating global reduction 1 with 13 rules applied. Total rules applied 91 place count 726 transition count 1864
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 106 place count 711 transition count 1824
Iterating global reduction 1 with 15 rules applied. Total rules applied 121 place count 711 transition count 1824
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 135 place count 697 transition count 1790
Iterating global reduction 1 with 14 rules applied. Total rules applied 149 place count 697 transition count 1790
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 161 place count 685 transition count 1766
Iterating global reduction 1 with 12 rules applied. Total rules applied 173 place count 685 transition count 1766
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 185 place count 673 transition count 1738
Iterating global reduction 1 with 12 rules applied. Total rules applied 197 place count 673 transition count 1738
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 208 place count 662 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 219 place count 662 transition count 1712
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 227 place count 654 transition count 1696
Iterating global reduction 1 with 8 rules applied. Total rules applied 235 place count 654 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 241 place count 648 transition count 1684
Iterating global reduction 1 with 6 rules applied. Total rules applied 247 place count 648 transition count 1684
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 251 place count 644 transition count 1672
Iterating global reduction 1 with 4 rules applied. Total rules applied 255 place count 644 transition count 1672
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 259 place count 640 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 263 place count 640 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 267 place count 636 transition count 1652
Iterating global reduction 1 with 4 rules applied. Total rules applied 271 place count 636 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 273 place count 634 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 275 place count 634 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 277 place count 632 transition count 1644
Iterating global reduction 1 with 2 rules applied. Total rules applied 279 place count 632 transition count 1644
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 281 place count 630 transition count 1640
Iterating global reduction 1 with 2 rules applied. Total rules applied 283 place count 630 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 285 place count 628 transition count 1636
Iterating global reduction 1 with 2 rules applied. Total rules applied 287 place count 628 transition count 1636
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 293 place count 628 transition count 1630
Applied a total of 293 rules in 459 ms. Remains 628 /769 variables (removed 141) and now considering 1630/1976 (removed 346) transitions.
[2023-03-12 13:39:35] [INFO ] Flow matrix only has 1091 transitions (discarded 539 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-12 13:39:35] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 13:39:36] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-12 13:39:36] [INFO ] Flow matrix only has 1091 transitions (discarded 539 similar events)
[2023-03-12 13:39:36] [INFO ] Invariant cache hit.
[2023-03-12 13:39:36] [INFO ] State equation strengthened by 270 read => feed constraints.
[2023-03-12 13:39:37] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-12 13:39:37] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 13:39:37] [INFO ] Flow matrix only has 1091 transitions (discarded 539 similar events)
[2023-03-12 13:39:37] [INFO ] Invariant cache hit.
[2023-03-12 13:39:37] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 628/769 places, 1630/1976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2772 ms. Remains : 628/769 places, 1630/1976 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s534 s563)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Stack based approach found an accepted trace after 157 steps with 0 reset with depth 158 and stack size 158 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-11 finished in 3221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Graph (complete) has 4361 edges and 769 vertex of which 767 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 750 transition count 1936
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 750 transition count 1936
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 39 place count 750 transition count 1932
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 735 transition count 1894
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 735 transition count 1894
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 84 place count 720 transition count 1854
Iterating global reduction 1 with 15 rules applied. Total rules applied 99 place count 720 transition count 1854
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 116 place count 703 transition count 1810
Iterating global reduction 1 with 17 rules applied. Total rules applied 133 place count 703 transition count 1810
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 149 place count 687 transition count 1772
Iterating global reduction 1 with 16 rules applied. Total rules applied 165 place count 687 transition count 1772
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 179 place count 673 transition count 1744
Iterating global reduction 1 with 14 rules applied. Total rules applied 193 place count 673 transition count 1744
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 206 place count 660 transition count 1714
Iterating global reduction 1 with 13 rules applied. Total rules applied 219 place count 660 transition count 1714
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 231 place count 648 transition count 1686
Iterating global reduction 1 with 12 rules applied. Total rules applied 243 place count 648 transition count 1686
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 251 place count 640 transition count 1670
Iterating global reduction 1 with 8 rules applied. Total rules applied 259 place count 640 transition count 1670
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 266 place count 633 transition count 1652
Iterating global reduction 1 with 7 rules applied. Total rules applied 273 place count 633 transition count 1652
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 277 place count 629 transition count 1640
Iterating global reduction 1 with 4 rules applied. Total rules applied 281 place count 629 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 285 place count 625 transition count 1632
Iterating global reduction 1 with 4 rules applied. Total rules applied 289 place count 625 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 293 place count 621 transition count 1624
Iterating global reduction 1 with 4 rules applied. Total rules applied 297 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 299 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 301 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 303 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 305 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 307 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 309 place count 615 transition count 1612
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 313 place count 615 transition count 1608
Applied a total of 313 rules in 431 ms. Remains 615 /769 variables (removed 154) and now considering 1608/1976 (removed 368) transitions.
[2023-03-12 13:39:38] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-12 13:39:38] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 13:39:39] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-12 13:39:39] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 13:39:39] [INFO ] Invariant cache hit.
[2023-03-12 13:39:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:39:40] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2023-03-12 13:39:40] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 13:39:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 13:39:40] [INFO ] Invariant cache hit.
[2023-03-12 13:39:41] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/769 places, 1608/1976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2967 ms. Remains : 615/769 places, 1608/1976 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s537 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 345 ms.
Product exploration explored 100000 steps with 1 reset in 424 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 3094 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=773 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 13:39:42] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 13:39:42] [INFO ] Invariant cache hit.
[2023-03-12 13:39:43] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 13:39:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 13:39:43] [INFO ] Invariant cache hit.
[2023-03-12 13:39:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:39:44] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
[2023-03-12 13:39:44] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 13:39:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 13:39:44] [INFO ] Invariant cache hit.
[2023-03-12 13:39:45] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2666 ms. Remains : 615/615 places, 1608/1608 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished Best-First random walk after 4679 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1169 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 348 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-12 finished in 7990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 767 transition count 1976
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 750 transition count 1936
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 750 transition count 1936
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 750 transition count 1930
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 56 place count 736 transition count 1894
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 736 transition count 1894
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 84 place count 722 transition count 1856
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 722 transition count 1856
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 706 transition count 1814
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 706 transition count 1814
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 145 place count 691 transition count 1778
Iterating global reduction 2 with 15 rules applied. Total rules applied 160 place count 691 transition count 1778
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 174 place count 677 transition count 1750
Iterating global reduction 2 with 14 rules applied. Total rules applied 188 place count 677 transition count 1750
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 201 place count 664 transition count 1720
Iterating global reduction 2 with 13 rules applied. Total rules applied 214 place count 664 transition count 1720
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 226 place count 652 transition count 1692
Iterating global reduction 2 with 12 rules applied. Total rules applied 238 place count 652 transition count 1692
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 247 place count 643 transition count 1674
Iterating global reduction 2 with 9 rules applied. Total rules applied 256 place count 643 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 264 place count 635 transition count 1654
Iterating global reduction 2 with 8 rules applied. Total rules applied 272 place count 635 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 277 place count 630 transition count 1638
Iterating global reduction 2 with 5 rules applied. Total rules applied 282 place count 630 transition count 1638
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 287 place count 625 transition count 1626
Iterating global reduction 2 with 5 rules applied. Total rules applied 292 place count 625 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 297 place count 620 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 302 place count 620 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 617 transition count 1610
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 617 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 311 place count 614 transition count 1604
Iterating global reduction 2 with 3 rules applied. Total rules applied 314 place count 614 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 317 place count 611 transition count 1598
Iterating global reduction 2 with 3 rules applied. Total rules applied 320 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 321 place count 610 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 610 transition count 1596
Applied a total of 322 rules in 269 ms. Remains 610 /769 variables (removed 159) and now considering 1596/1976 (removed 380) transitions.
[2023-03-12 13:39:46] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 610 cols
[2023-03-12 13:39:46] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:39:47] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-12 13:39:47] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-12 13:39:47] [INFO ] Invariant cache hit.
[2023-03-12 13:39:47] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:39:48] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2023-03-12 13:39:48] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2023-03-12 13:39:48] [INFO ] Invariant cache hit.
[2023-03-12 13:39:48] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 610/769 places, 1596/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 610/769 places, 1596/1976 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s527 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Product exploration explored 100000 steps with 50000 reset in 656 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 : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-13 finished in 4065 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((G(p0) U X(p1))))'
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 767 transition count 1976
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 750 transition count 1936
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 750 transition count 1936
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 750 transition count 1930
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 56 place count 736 transition count 1896
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 736 transition count 1896
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 84 place count 722 transition count 1860
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 722 transition count 1860
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 706 transition count 1818
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 706 transition count 1818
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 145 place count 691 transition count 1782
Iterating global reduction 2 with 15 rules applied. Total rules applied 160 place count 691 transition count 1782
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 173 place count 678 transition count 1756
Iterating global reduction 2 with 13 rules applied. Total rules applied 186 place count 678 transition count 1756
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 198 place count 666 transition count 1728
Iterating global reduction 2 with 12 rules applied. Total rules applied 210 place count 666 transition count 1728
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 221 place count 655 transition count 1702
Iterating global reduction 2 with 11 rules applied. Total rules applied 232 place count 655 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 241 place count 646 transition count 1684
Iterating global reduction 2 with 9 rules applied. Total rules applied 250 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 258 place count 638 transition count 1664
Iterating global reduction 2 with 8 rules applied. Total rules applied 266 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 271 place count 633 transition count 1648
Iterating global reduction 2 with 5 rules applied. Total rules applied 276 place count 633 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 281 place count 628 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 286 place count 628 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 291 place count 623 transition count 1626
Iterating global reduction 2 with 5 rules applied. Total rules applied 296 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 299 place count 620 transition count 1620
Iterating global reduction 2 with 3 rules applied. Total rules applied 302 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 617 transition count 1614
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 311 place count 614 transition count 1608
Iterating global reduction 2 with 3 rules applied. Total rules applied 314 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 613 transition count 1606
Applied a total of 316 rules in 301 ms. Remains 613 /769 variables (removed 156) and now considering 1606/1976 (removed 370) transitions.
[2023-03-12 13:39:50] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-12 13:39:50] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:39:51] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-12 13:39:51] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 13:39:51] [INFO ] Invariant cache hit.
[2023-03-12 13:39:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:39:52] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2023-03-12 13:39:52] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-12 13:39:52] [INFO ] Invariant cache hit.
[2023-03-12 13:39:53] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/769 places, 1606/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2809 ms. Remains : 613/769 places, 1606/1976 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s533), p1:(OR (LEQ 1 s364) (LEQ 1 s533))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-14 finished in 2993 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(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' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
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(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLCardinality-06
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 769/769 places, 1976/1976 transitions.
Graph (complete) has 4361 edges and 769 vertex of which 767 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 751 transition count 1938
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 751 transition count 1938
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 39 place count 751 transition count 1932
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 738 transition count 1900
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 738 transition count 1900
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 78 place count 725 transition count 1868
Iterating global reduction 1 with 13 rules applied. Total rules applied 91 place count 725 transition count 1868
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 106 place count 710 transition count 1830
Iterating global reduction 1 with 15 rules applied. Total rules applied 121 place count 710 transition count 1830
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 135 place count 696 transition count 1796
Iterating global reduction 1 with 14 rules applied. Total rules applied 149 place count 696 transition count 1796
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 161 place count 684 transition count 1772
Iterating global reduction 1 with 12 rules applied. Total rules applied 173 place count 684 transition count 1772
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 184 place count 673 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 195 place count 673 transition count 1746
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 205 place count 663 transition count 1722
Iterating global reduction 1 with 10 rules applied. Total rules applied 215 place count 663 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 223 place count 655 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 231 place count 655 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 239 place count 647 transition count 1686
Iterating global reduction 1 with 8 rules applied. Total rules applied 247 place count 647 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 252 place count 642 transition count 1670
Iterating global reduction 1 with 5 rules applied. Total rules applied 257 place count 642 transition count 1670
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 262 place count 637 transition count 1658
Iterating global reduction 1 with 5 rules applied. Total rules applied 267 place count 637 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 272 place count 632 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 277 place count 632 transition count 1648
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 280 place count 629 transition count 1642
Iterating global reduction 1 with 3 rules applied. Total rules applied 283 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 286 place count 626 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 289 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 292 place count 623 transition count 1630
Iterating global reduction 1 with 3 rules applied. Total rules applied 295 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 296 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 297 place count 622 transition count 1628
Applied a total of 297 rules in 339 ms. Remains 622 /769 variables (removed 147) and now considering 1628/1976 (removed 348) transitions.
[2023-03-12 13:39:54] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2023-03-12 13:39:54] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:39:54] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-12 13:39:54] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:54] [INFO ] Invariant cache hit.
[2023-03-12 13:39:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:39:56] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 2495 ms to find 0 implicit places.
[2023-03-12 13:39:56] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:39:56] [INFO ] Invariant cache hit.
[2023-03-12 13:39:57] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 622/769 places, 1628/1976 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3324 ms. Remains : 622/769 places, 1628/1976 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06 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 p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ s550 s540)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 347 ms.
Product exploration explored 100000 steps with 0 reset in 413 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 513175 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 513175 steps, saw 333083 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:40:01] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:01] [INFO ] Invariant cache hit.
[2023-03-12 13:40:01] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:01] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:40:01] [INFO ] After 66ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:01] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 13:40:01] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1244
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 430 transition count 1238
Applied a total of 391 rules in 93 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 430/622 places, 1238/1628 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
Finished Best-First random walk after 2461 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=820 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 20 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2023-03-12 13:40:02] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:02] [INFO ] Invariant cache hit.
[2023-03-12 13:40:02] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-12 13:40:02] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:02] [INFO ] Invariant cache hit.
[2023-03-12 13:40:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:40:04] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2023-03-12 13:40:04] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:04] [INFO ] Invariant cache hit.
[2023-03-12 13:40:04] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2420 ms. Remains : 622/622 places, 1628/1628 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 5071 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1267 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 355 ms.
Product exploration explored 100000 steps with 0 reset in 406 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2023-03-12 13:40:06] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:06] [INFO ] Invariant cache hit.
[2023-03-12 13:40:06] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 13:40:06] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:06] [INFO ] Invariant cache hit.
[2023-03-12 13:40:06] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:40:08] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2023-03-12 13:40:08] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 13:40:08] [INFO ] Invariant cache hit.
[2023-03-12 13:40:08] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2377 ms. Remains : 622/622 places, 1628/1628 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 15109 ms.
[2023-03-12 13:40:08] [INFO ] Flatten gal took : 74 ms
[2023-03-12 13:40:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 13:40:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 769 places, 1976 transitions and 8030 arcs took 14 ms.
Total runtime 133452 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1793/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1793/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1793/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-04
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-05
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-06
BK_STOP 1678628410981
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-c004-LTLCardinality-04
ltl formula formula --ltl=/tmp/1793/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 769 places, 1976 transitions and 8030 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.060 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1793/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1793/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1793/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1793/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FunctionPointer-PT-c004-LTLCardinality-05
ltl formula formula --ltl=/tmp/1793/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 769 places, 1976 transitions and 8030 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.050 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1793/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1793/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1793/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1793/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name FunctionPointer-PT-c004-LTLCardinality-06
ltl formula formula --ltl=/tmp/1793/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 769 places, 1976 transitions and 8030 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.050 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1793/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1793/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1793/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1793/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c004"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856300723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;