About the Execution of LTSMin+red for LamportFastMutEx-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2293.716 | 844872.00 | 3037286.00 | 1009.30 | ?FTFF??FTFF?TFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418800380.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 LamportFastMutEx-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K 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 LamportFastMutEx-COL-7-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679511822368
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 19:03:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 19:03:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:03:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 19:03:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 19:03:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2023-03-22 19:03:44] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 19:03:44] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2023-03-22 19:03:44] [INFO ] Skeletonized 12 HLPN properties in 2 ms. Removed 4 properties that had guard overlaps.
Initial state reduction rules removed 4 formulas.
FORMULA LamportFastMutEx-COL-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 2287 steps, including 0 resets, run visited all 11 properties in 40 ms. (steps per millisecond=57 )
[2023-03-22 19:03:44] [INFO ] Flatten gal took : 14 ms
[2023-03-22 19:03:44] [INFO ] Flatten gal took : 4 ms
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 19:03:44] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 22 ms.
[2023-03-22 19:03:44] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-COL-7-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 149 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:03:45] [INFO ] Computed 65 place invariants in 20 ms
[2023-03-22 19:03:45] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-22 19:03:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:45] [INFO ] Invariant cache hit.
[2023-03-22 19:03:45] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:03:45] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-22 19:03:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:45] [INFO ] Invariant cache hit.
[2023-03-22 19:03:45] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 219/219 places, 462/462 transitions.
Support contains 149 out of 219 places after structural reductions.
[2023-03-22 19:03:45] [INFO ] Flatten gal took : 48 ms
[2023-03-22 19:03:45] [INFO ] Flatten gal took : 47 ms
[2023-03-22 19:03:46] [INFO ] Input system was already deterministic with 462 transitions.
Finished random walk after 59 steps, including 0 resets, run visited all 16 properties in 15 ms. (steps per millisecond=3 )
Computed a total of 1 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)))))))'
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:46] [INFO ] Invariant cache hit.
[2023-03-22 19:03:46] [INFO ] Implicit Places using invariants in 143 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 148 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s21 1) (GEQ s51 1)) (AND (GEQ s17 1) (GEQ s56 1)) (AND (GEQ s22 1) (GEQ s53 1)) (AND (GEQ s16 1) (GEQ s54 1)) (AND (GEQ s22 1) (GEQ s51 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7135 reset in 536 ms.
Product exploration explored 100000 steps with 7123 reset in 416 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 274 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:48] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:03:48] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-22 19:03:48] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 19:03:48] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:48] [INFO ] Invariant cache hit.
[2023-03-22 19:03:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:03:49] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-22 19:03:49] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:49] [INFO ] Invariant cache hit.
[2023-03-22 19:03:49] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 49 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7106 reset in 373 ms.
Product exploration explored 100000 steps with 7136 reset in 438 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 7 rules in 36 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:51] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-22 19:03:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:03:51] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 19:03:51] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:03:51] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-22 19:03:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-22 19:03:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:52] [INFO ] Invariant cache hit.
[2023-03-22 19:03:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:03:52] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-22 19:03:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:52] [INFO ] Invariant cache hit.
[2023-03-22 19:03:52] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-00 finished in 6292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&(G(!p1) U p2)))))'
Support contains 106 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 17 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:03:52] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-22 19:03:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 19:03:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:52] [INFO ] Invariant cache hit.
[2023-03-22 19:03:52] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:03:52] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-22 19:03:53] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 19:03:53] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:53] [INFO ] Invariant cache hit.
[2023-03-22 19:03:53] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p2) p1), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), p1]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) (GEQ s39 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-03 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:53] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:53] [INFO ] Invariant cache hit.
[2023-03-22 19:03:53] [INFO ] Implicit Places using invariants in 128 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 129 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s22 1) (LT s60 1)) (OR (LT s22 1) (LT s58 1)) (OR (LT s22 1) (LT s64 1)) (OR (LT s17 1) (LT s61 1)) (OR (LT s22 1) (LT s62 1)) (OR (LT s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-04 finished in 286 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)||X(X(F(!p1)))) U (!p2 U (p3||G(!p2))))))'
Support contains 44 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:03:53] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:03:53] [INFO ] Invariant cache hit.
[2023-03-22 19:03:53] [INFO ] Implicit Places using invariants in 139 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 141 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p0) p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15712 reset in 896 ms.
Product exploration explored 100000 steps with 15798 reset in 884 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p3) p2 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
Knowledge based reduction with 11 factoid took 935 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:03:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:03:57] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-22 19:03:57] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-22 19:03:57] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:03:57] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:03:58] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:03:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:03:58] [INFO ] After 342ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:03:58] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 4 ms to minimize.
[2023-03-22 19:03:58] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:03:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1253 ms
[2023-03-22 19:03:59] [INFO ] After 1872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-22 19:04:00] [INFO ] After 2592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 18 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 205/212 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 872884 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 872884 steps, saw 385729 distinct states, run finished after 3003 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:04:03] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 19:04:03] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 19:04:03] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2023-03-22 19:04:03] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:04:03] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:04:04] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:04] [INFO ] After 277ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:04] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-22 19:04:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-22 19:04:04] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-22 19:04:04] [INFO ] After 1308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:04:04] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:04:04] [INFO ] Invariant cache hit.
[2023-03-22 19:04:05] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-22 19:04:05] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:04:05] [INFO ] Invariant cache hit.
[2023-03-22 19:04:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:05] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-22 19:04:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 19:04:05] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:04:05] [INFO ] Invariant cache hit.
[2023-03-22 19:04:05] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 28 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 19:04:05] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 19:04:05] [INFO ] [Real]Absence check using 16 positive place invariants in 39 ms returned sat
[2023-03-22 19:04:05] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:04:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 19:04:06] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:06] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-22 19:04:06] [INFO ] After 926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p3) p2 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 1222 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 244 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:08] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:08] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 19:04:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-22 19:04:08] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:08] [INFO ] Invariant cache hit.
[2023-03-22 19:04:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:08] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-22 19:04:08] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:08] [INFO ] Invariant cache hit.
[2023-03-22 19:04:09] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 740 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:04:10] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:10] [INFO ] Invariant cache hit.
[2023-03-22 19:04:10] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-22 19:04:10] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:04:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:04:10] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:11] [INFO ] After 289ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:11] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-22 19:04:11] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:04:11] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:04:11] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:04:12] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:04:12] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 4 ms to minimize.
[2023-03-22 19:04:12] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:04:12] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:04:12] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2023-03-22 19:04:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1079 ms
[2023-03-22 19:04:12] [INFO ] After 1658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-22 19:04:12] [INFO ] After 2386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 13 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 205/212 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 912380 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 912380 steps, saw 401925 distinct states, run finished after 3002 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:04:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 19:04:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 19:04:16] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:04:16] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:04:16] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:04:16] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:16] [INFO ] After 270ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:17] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-22 19:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-22 19:04:17] [INFO ] After 680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-22 19:04:17] [INFO ] After 1470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:04:17] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:04:17] [INFO ] Invariant cache hit.
[2023-03-22 19:04:18] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-22 19:04:18] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:04:18] [INFO ] Invariant cache hit.
[2023-03-22 19:04:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:18] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-22 19:04:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 19:04:18] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:04:18] [INFO ] Invariant cache hit.
[2023-03-22 19:04:18] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1035 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 35 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 19:04:18] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 19:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 101 ms returned sat
[2023-03-22 19:04:19] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:04:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 112 ms returned sat
[2023-03-22 19:04:19] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:04:20] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-22 19:04:20] [INFO ] After 1106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 837 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 353 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 241 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15871 reset in 742 ms.
Product exploration explored 100000 steps with 15708 reset in 769 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 228 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 20 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 19:04:23] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:23] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:04:24] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 687 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:24] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:24] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:04:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 19:04:24] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:24] [INFO ] Invariant cache hit.
[2023-03-22 19:04:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:24] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-22 19:04:24] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:24] [INFO ] Invariant cache hit.
[2023-03-22 19:04:25] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-05 finished in 31463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p1)||p0))))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:25] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:04:25] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 19:04:25] [INFO ] Implicit Places using invariants in 258 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 259 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (OR (LT s8 1) (LT s65 1)) (OR (LT s9 1) (LT s66 1)) (OR (LT s10 1) (LT s67 1)) (OR (LT s11 1) (LT s68 1)) (OR (LT s12 1) (LT s69 1)) (OR (LT s13 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4121 reset in 303 ms.
Product exploration explored 100000 steps with 4099 reset in 307 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 117 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-22 19:04:26] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:26] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 19:04:27] [INFO ] [Real]Absence check using 58 positive place invariants in 41 ms returned sat
[2023-03-22 19:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:27] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-22 19:04:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:04:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-22 19:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:27] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-22 19:04:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 1 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 4 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:04:28] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:04:29] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2318 ms
[2023-03-22 19:04:29] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 25 ms.
[2023-03-22 19:04:31] [INFO ] Added : 242 causal constraints over 49 iterations in 1555 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:31] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:31] [INFO ] Invariant cache hit.
[2023-03-22 19:04:31] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-22 19:04:31] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:31] [INFO ] Invariant cache hit.
[2023-03-22 19:04:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:32] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-22 19:04:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:32] [INFO ] Invariant cache hit.
[2023-03-22 19:04:32] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-22 19:04:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:32] [INFO ] Invariant cache hit.
[2023-03-22 19:04:33] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-22 19:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:33] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-22 19:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:04:33] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-22 19:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:33] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-22 19:04:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2023-03-22 19:04:33] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 5 ms to minimize.
[2023-03-22 19:04:33] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:04:33] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:04:34] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-22 19:04:35] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:04:35] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2023-03-22 19:04:35] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 19:04:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1540 ms
[2023-03-22 19:04:35] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 34 ms.
[2023-03-22 19:04:36] [INFO ] Added : 240 causal constraints over 48 iterations in 1591 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 4123 reset in 320 ms.
Product exploration explored 100000 steps with 4110 reset in 329 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 19:04:37] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:37] [INFO ] Invariant cache hit.
[2023-03-22 19:04:37] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:37] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:37] [INFO ] Invariant cache hit.
[2023-03-22 19:04:38] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-22 19:04:38] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:38] [INFO ] Invariant cache hit.
[2023-03-22 19:04:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:38] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-22 19:04:38] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:38] [INFO ] Invariant cache hit.
[2023-03-22 19:04:38] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-06 finished in 13433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:38] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:04:38] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 19:04:38] [INFO ] Implicit Places using invariants in 153 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 155 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (LT s24 1) (LT s205 1)) (OR (LT s34 1) (LT s210 1)) (OR (LT s26 1) (LT s206 1)) (OR (LT s32 1) (LT s209 1)) (OR (LT s28 1) (LT s207 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5107 reset in 313 ms.
Product exploration explored 100000 steps with 5154 reset in 324 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 48 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 19:04:40] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:40] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 19:04:40] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-22 19:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:40] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-22 19:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:04:41] [INFO ] [Nat]Absence check using 58 positive place invariants in 23 ms returned sat
[2023-03-22 19:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:41] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-22 19:04:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 11 ms to minimize.
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:04:41] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:04:42] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-22 19:04:43] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-22 19:04:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-22 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1782 ms
[2023-03-22 19:04:43] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 35 ms.
[2023-03-22 19:04:44] [INFO ] Added : 222 causal constraints over 45 iterations in 1440 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:44] [INFO ] Invariant cache hit.
[2023-03-22 19:04:44] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 19:04:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:44] [INFO ] Invariant cache hit.
[2023-03-22 19:04:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:44] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-22 19:04:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:44] [INFO ] Invariant cache hit.
[2023-03-22 19:04:45] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 162 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 19:04:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:46] [INFO ] Invariant cache hit.
[2023-03-22 19:04:46] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-22 19:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:46] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-22 19:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:04:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-22 19:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:04:46] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-22 19:04:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2023-03-22 19:04:46] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 1 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:04:47] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:04:48] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:04:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1282 ms
[2023-03-22 19:04:48] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 23 ms.
[2023-03-22 19:04:49] [INFO ] Added : 205 causal constraints over 41 iterations in 1348 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 5147 reset in 316 ms.
Product exploration explored 100000 steps with 5114 reset in 325 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 20 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 19:04:50] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:50] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 19:04:50] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:50] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 19:04:50] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:04:50] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 19:04:50] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:50] [INFO ] Invariant cache hit.
[2023-03-22 19:04:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:51] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-22 19:04:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:51] [INFO ] Invariant cache hit.
[2023-03-22 19:04:51] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-07 finished in 12708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 56 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 19 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:04:51] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 19:04:51] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-22 19:04:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:51] [INFO ] Invariant cache hit.
[2023-03-22 19:04:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:04:51] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-22 19:04:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 19:04:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:51] [INFO ] Invariant cache hit.
[2023-03-22 19:04:51] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s135 1) (GEQ s142 1) (GEQ s143 1) (GEQ s144 1) (GEQ s145 1) (GEQ s146 1) (GEQ s147 1) (GEQ s148 1)) (AND (GEQ s136 1) (GEQ s149 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 287 ms.
Stack based approach found an accepted trace after 358 steps with 0 reset with depth 359 and stack size 359 in 1 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-09 finished in 1034 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 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:52] [INFO ] Invariant cache hit.
[2023-03-22 19:04:52] [INFO ] Implicit Places using invariants in 159 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 175 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-10 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:(AND (OR (AND (GEQ s15 1) (GEQ s186 1)) (AND (GEQ s20 1) (GEQ s187 1)) (AND (GEQ s15 1) (GEQ s184 1)) (AND (GEQ s20 1) (GEQ s189 1)) (AND (GEQ s15 1) (...], 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 LamportFastMutEx-COL-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-10 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||G(p1))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:04:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 19:04:52] [INFO ] Invariant cache hit.
[2023-03-22 19:04:52] [INFO ] Implicit Places using invariants in 142 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 159 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) (GEQ s39 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5177 reset in 604 ms.
Product exploration explored 100000 steps with 5154 reset in 620 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, false, (AND p0 (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 347 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[p0, false, (AND p0 (NOT p1))]
Support contains 22 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 455
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 198 transition count 448
Applied a total of 28 rules in 25 ms. Remains 198 /212 variables (removed 14) and now considering 448/462 (removed 14) transitions.
[2023-03-22 19:04:55] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:04:55] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:04:55] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 19:04:55] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:04:55] [INFO ] Invariant cache hit.
[2023-03-22 19:04:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:55] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-22 19:04:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 19:04:55] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:04:55] [INFO ] Invariant cache hit.
[2023-03-22 19:04:55] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 198/212 places, 448/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 198/212 places, 448/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 421 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, false, (AND p0 (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 520 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[p0, false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[p0, false, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 9302 reset in 680 ms.
Product exploration explored 100000 steps with 9355 reset in 682 ms.
Support contains 22 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 21 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:04:58] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:04:58] [INFO ] Invariant cache hit.
[2023-03-22 19:04:58] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-22 19:04:58] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:04:58] [INFO ] Invariant cache hit.
[2023-03-22 19:04:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:04:59] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-22 19:04:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 19:04:59] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:04:59] [INFO ] Invariant cache hit.
[2023-03-22 19:04:59] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 705 ms. Remains : 198/198 places, 448/448 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-11 finished in 6774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 29 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 12 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 19:04:59] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 19:04:59] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 19:04:59] [INFO ] Implicit Places using invariants in 180 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 194 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 9 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 19:04:59] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:04:59] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:04:59] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-22 19:04:59] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:04:59] [INFO ] Invariant cache hit.
[2023-03-22 19:05:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:00] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 838 ms. Remains : 198/219 places, 448/462 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s57 1)) (AND (GEQ s15 1) (GEQ s56 1)) (AND (GEQ s15 1) (GEQ s55 1)) (AND (GEQ s15 1) (GEQ s54 1)) (AND (GEQ s15 1) (GEQ s53 1...], 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 6324 reset in 318 ms.
Stack based approach found an accepted trace after 13121 steps with 1419 reset with depth 250 and stack size 250 in 38 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-14 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:05:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:05:00] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 19:05:00] [INFO ] Implicit Places using invariants in 143 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 167 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s8 1) (LT s65 1)) (OR (LT s9 1) (LT s66 1)) (OR (LT s10 1) (LT s67 1)) (OR (LT s11 1) (LT s68 1)) (OR (LT s12 1) (LT s69 1)) (OR (LT s13 1...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-15 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)))))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-7-LTLFireability-00
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 7 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 19:05:01] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 19:05:01] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-22 19:05:01] [INFO ] Implicit Places using invariants in 138 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 139 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 10 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 19:05:01] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:05:01] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 19:05:01] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-22 19:05:01] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:01] [INFO ] Invariant cache hit.
[2023-03-22 19:05:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:02] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 986 ms. Remains : 198/219 places, 448/462 transitions.
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s21 1) (GEQ s51 1)) (AND (GEQ s17 1) (GEQ s56 1)) (AND (GEQ s22 1) (GEQ s53 1)) (AND (GEQ s16 1) (GEQ s54 1)) (AND (GEQ s22 1) (GEQ s51 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7105 reset in 372 ms.
Product exploration explored 100000 steps with 7160 reset in 382 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 166 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:05:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:03] [INFO ] Invariant cache hit.
[2023-03-22 19:05:03] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 19:05:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:03] [INFO ] Invariant cache hit.
[2023-03-22 19:05:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:04] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-22 19:05:04] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:04] [INFO ] Invariant cache hit.
[2023-03-22 19:05:04] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 198/198 places, 448/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 105 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7127 reset in 372 ms.
Product exploration explored 100000 steps with 7131 reset in 381 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:05:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 19:05:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:06] [INFO ] Invariant cache hit.
[2023-03-22 19:05:06] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 198/198 places, 448/448 transitions.
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:05:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:06] [INFO ] Invariant cache hit.
[2023-03-22 19:05:06] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-22 19:05:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:06] [INFO ] Invariant cache hit.
[2023-03-22 19:05:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:06] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-22 19:05:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:06] [INFO ] Invariant cache hit.
[2023-03-22 19:05:07] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 198/198 places, 448/448 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-00 finished in 6224 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)||X(X(F(!p1)))) U (!p2 U (p3||G(!p2))))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-7-LTLFireability-05
Stuttering acceptance computed with spot in 277 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p0) p1)]
Support contains 44 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 6 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 19:05:07] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 19:05:07] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 19:05:07] [INFO ] Implicit Places using invariants in 133 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 134 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 153 ms. Remains : 205/219 places, 455/462 transitions.
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15802 reset in 924 ms.
Product exploration explored 100000 steps with 15688 reset in 918 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p3) p2 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
Knowledge based reduction with 11 factoid took 726 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:05:10] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 19:05:10] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:05:11] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:05:11] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:05:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:11] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:11] [INFO ] After 258ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:12] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2023-03-22 19:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-22 19:05:12] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-22 19:05:12] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 455/455 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 930658 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 930658 steps, saw 408692 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:05:15] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:15] [INFO ] Invariant cache hit.
[2023-03-22 19:05:15] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:15] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:05:15] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:16] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:16] [INFO ] After 254ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:16] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-22 19:05:16] [INFO ] After 1184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:16] [INFO ] Invariant cache hit.
[2023-03-22 19:05:17] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-22 19:05:17] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:17] [INFO ] Invariant cache hit.
[2023-03-22 19:05:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:17] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-22 19:05:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 19:05:17] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:17] [INFO ] Invariant cache hit.
[2023-03-22 19:05:17] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 12 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 19:05:17] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-22 19:05:17] [INFO ] [Real]Absence check using 16 positive place invariants in 52 ms returned sat
[2023-03-22 19:05:17] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:05:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 65 ms returned sat
[2023-03-22 19:05:18] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:18] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-22 19:05:18] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p3) p2 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 840 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 225 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 19:05:20] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:05:20] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-22 19:05:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:20] [INFO ] Invariant cache hit.
[2023-03-22 19:05:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:20] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-22 19:05:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:20] [INFO ] Invariant cache hit.
[2023-03-22 19:05:20] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 205/205 places, 455/455 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 773 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:05:21] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:22] [INFO ] Invariant cache hit.
[2023-03-22 19:05:22] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:22] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:05:22] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:05:22] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:22] [INFO ] After 253ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:23] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-22 19:05:23] [INFO ] After 1179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 205/205 places, 455/455 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 937527 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 937527 steps, saw 411496 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:05:26] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:26] [INFO ] Invariant cache hit.
[2023-03-22 19:05:26] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:26] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:05:26] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:05:27] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:27] [INFO ] After 405ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:27] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 309 ms.
[2023-03-22 19:05:28] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:28] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:28] [INFO ] Invariant cache hit.
[2023-03-22 19:05:28] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-22 19:05:28] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:28] [INFO ] Invariant cache hit.
[2023-03-22 19:05:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:28] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-22 19:05:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 19:05:28] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:28] [INFO ] Invariant cache hit.
[2023-03-22 19:05:28] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 22 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 19:05:28] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 19:05:28] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 19:05:29] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:05:29] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 248 ms.
[2023-03-22 19:05:29] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 893 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 273 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 251 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15811 reset in 810 ms.
Product exploration explored 100000 steps with 15746 reset in 796 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 264 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 19:05:33] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 19:05:33] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 19:05:33] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 205/205 places, 455/455 transitions.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:33] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:33] [INFO ] Invariant cache hit.
[2023-03-22 19:05:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 19:05:33] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:33] [INFO ] Invariant cache hit.
[2023-03-22 19:05:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:33] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-22 19:05:33] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:33] [INFO ] Invariant cache hit.
[2023-03-22 19:05:33] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 205/205 places, 455/455 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-05 finished in 26733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p1)||p0))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-7-LTLFireability-06
Stuttering acceptance computed with spot in 69 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 19:05:34] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:05:34] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-22 19:05:34] [INFO ] Implicit Places using invariants in 148 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 455
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 6 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 19:05:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 19:05:34] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 19:05:34] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-22 19:05:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:34] [INFO ] Invariant cache hit.
[2023-03-22 19:05:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:34] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 205/219 places, 455/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 621 ms. Remains : 205/219 places, 455/462 transitions.
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (OR (LT s8 1) (LT s65 1)) (OR (LT s9 1) (LT s66 1)) (OR (LT s10 1) (LT s67 1)) (OR (LT s11 1) (LT s68 1)) (OR (LT s12 1) (LT s69 1)) (OR (LT s13 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4115 reset in 298 ms.
Product exploration explored 100000 steps with 4104 reset in 308 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 74 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-22 19:05:35] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:35] [INFO ] Invariant cache hit.
[2023-03-22 19:05:36] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-22 19:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:36] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-22 19:05:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:36] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-22 19:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:36] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 19:05:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2193 ms
[2023-03-22 19:05:38] [INFO ] Computed and/alt/rep : 287/1617/287 causal constraints (skipped 35 transitions) in 22 ms.
[2023-03-22 19:05:40] [INFO ] Added : 205 causal constraints over 41 iterations in 1268 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:40] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:40] [INFO ] Invariant cache hit.
[2023-03-22 19:05:40] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 19:05:40] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:40] [INFO ] Invariant cache hit.
[2023-03-22 19:05:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:40] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-22 19:05:40] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:40] [INFO ] Invariant cache hit.
[2023-03-22 19:05:40] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 205/205 places, 455/455 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 306 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-22 19:05:41] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:41] [INFO ] Invariant cache hit.
[2023-03-22 19:05:41] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-22 19:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:41] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-22 19:05:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:41] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 19:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:41] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-22 19:05:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:05:42] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-22 19:05:43] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-22 19:05:44] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:05:44] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:05:44] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2153 ms
[2023-03-22 19:05:44] [INFO ] Computed and/alt/rep : 287/1617/287 causal constraints (skipped 35 transitions) in 23 ms.
[2023-03-22 19:05:45] [INFO ] Added : 205 causal constraints over 41 iterations in 1269 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 4142 reset in 326 ms.
Product exploration explored 100000 steps with 4128 reset in 341 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:46] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 19:05:46] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:46] [INFO ] Invariant cache hit.
[2023-03-22 19:05:46] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 205/205 places, 455/455 transitions.
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 19:05:46] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:46] [INFO ] Invariant cache hit.
[2023-03-22 19:05:46] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-22 19:05:46] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:46] [INFO ] Invariant cache hit.
[2023-03-22 19:05:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:46] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-22 19:05:46] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 19:05:47] [INFO ] Invariant cache hit.
[2023-03-22 19:05:47] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 205/205 places, 455/455 transitions.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-06 finished in 13243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Found a Lengthening insensitive property : LamportFastMutEx-COL-7-LTLFireability-07
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 10 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 19:05:47] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 19:05:47] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-22 19:05:47] [INFO ] Implicit Places using invariants in 138 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 139 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 6 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 19:05:47] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:05:47] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:05:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-22 19:05:47] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:05:47] [INFO ] Invariant cache hit.
[2023-03-22 19:05:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:05:47] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 545 ms. Remains : 198/219 places, 448/462 transitions.
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (LT s24 1) (LT s191 1)) (OR (LT s34 1) (LT s196 1)) (OR (LT s26 1) (LT s192 1)) (OR (LT s32 1) (LT s195 1)) (OR (LT s28 1) (LT s193 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42002 steps with 2141 reset in 138 ms.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-07 finished in 888 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||G(p1))))'
[2023-03-22 19:05:48] [INFO ] Flatten gal took : 29 ms
[2023-03-22 19:05:48] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2023-03-22 19:05:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 462 transitions and 2016 arcs took 3 ms.
Total runtime 124184 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3543/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3543/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 13881880 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16122668 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3543/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3543/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3543/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : LamportFastMutEx-COL-7-LTLFireability-00
Could not compute solution for formula : LamportFastMutEx-COL-7-LTLFireability-05
Could not compute solution for formula : LamportFastMutEx-COL-7-LTLFireability-06
Could not compute solution for formula : LamportFastMutEx-COL-7-LTLFireability-07
Could not compute solution for formula : LamportFastMutEx-COL-7-LTLFireability-11
BK_STOP 1679512667240
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name LamportFastMutEx-COL-7-LTLFireability-00
ltl formula formula --ltl=/tmp/3543/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 219 places, 462 transitions and 2016 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.110 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3543/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3543/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3543/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3543/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name LamportFastMutEx-COL-7-LTLFireability-05
ltl formula formula --ltl=/tmp/3543/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 219 places, 462 transitions and 2016 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.090 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3543/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3543/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3543/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3543/ltl_1_
Killing (15) : 3555 3556 3557 3558 3559
Killing (9) : 3555 3556 3557 3558 3559
ltl formula name LamportFastMutEx-COL-7-LTLFireability-06
ltl formula formula --ltl=/tmp/3543/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
pnml2lts-mc( 0/ 4): Petri net has 219 places, 462 transitions and 2016 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3543/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3543/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3543/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3543/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name LamportFastMutEx-COL-7-LTLFireability-07
ltl formula formula --ltl=/tmp/3543/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 219 places, 462 transitions and 2016 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3543/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3543/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3543/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3543/ltl_3_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
ltl formula name LamportFastMutEx-COL-7-LTLFireability-11
ltl formula formula --ltl=/tmp/3543/ltl_4_
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
pnml2lts-mc( 0/ 4): Petri net has 219 places, 462 transitions and 2016 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3543/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3543/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3543/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3543/ltl_4_
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
*** 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
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="LamportFastMutEx-COL-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418800380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;