About the Execution of LTSMin+red for NoC3x3-PT-3B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 741.871 | 101114.00 | 170278.00 | 805.10 | FTFTTFTTFFF?FFTF | 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.r265-smll-167863539800267.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 NoC3x3-PT-3B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800267
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 581K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678888896923
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 14:01:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 14:01:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:01:40] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2023-03-15 14:01:40] [INFO ] Transformed 2117 places.
[2023-03-15 14:01:40] [INFO ] Transformed 2435 transitions.
[2023-03-15 14:01:40] [INFO ] Found NUPN structural information;
[2023-03-15 14:01:40] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-3B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2112 transition count 2435
Discarding 529 places :
Symmetric choice reduction at 1 with 529 rule applications. Total rules 534 place count 1583 transition count 1906
Iterating global reduction 1 with 529 rules applied. Total rules applied 1063 place count 1583 transition count 1906
Discarding 183 places :
Symmetric choice reduction at 1 with 183 rule applications. Total rules 1246 place count 1400 transition count 1723
Iterating global reduction 1 with 183 rules applied. Total rules applied 1429 place count 1400 transition count 1723
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1432 place count 1400 transition count 1720
Discarding 194 places :
Symmetric choice reduction at 2 with 194 rule applications. Total rules 1626 place count 1206 transition count 1510
Iterating global reduction 2 with 194 rules applied. Total rules applied 1820 place count 1206 transition count 1510
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1870 place count 1156 transition count 1418
Iterating global reduction 2 with 50 rules applied. Total rules applied 1920 place count 1156 transition count 1418
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 18 rules applied. Total rules applied 1938 place count 1154 transition count 1402
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 1972 place count 1120 transition count 1368
Iterating global reduction 3 with 34 rules applied. Total rules applied 2006 place count 1120 transition count 1368
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 2008 place count 1118 transition count 1368
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2033 place count 1093 transition count 1318
Iterating global reduction 4 with 25 rules applied. Total rules applied 2058 place count 1093 transition count 1318
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2082 place count 1069 transition count 1294
Iterating global reduction 4 with 24 rules applied. Total rules applied 2106 place count 1069 transition count 1294
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 2109 place count 1066 transition count 1294
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 2131 place count 1044 transition count 1272
Iterating global reduction 5 with 22 rules applied. Total rules applied 2153 place count 1044 transition count 1272
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2175 place count 1044 transition count 1250
Applied a total of 2175 rules in 1196 ms. Remains 1044 /2117 variables (removed 1073) and now considering 1250/2435 (removed 1185) transitions.
// Phase 1: matrix 1250 rows 1044 cols
[2023-03-15 14:01:41] [INFO ] Computed 56 place invariants in 28 ms
[2023-03-15 14:01:42] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-15 14:01:42] [INFO ] Invariant cache hit.
[2023-03-15 14:01:44] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned [72, 80, 138, 141, 145, 146, 154, 157, 249, 252, 256, 257, 318, 319, 330, 333, 337, 428, 429, 430, 431, 435, 436, 437, 445, 448, 451, 459, 462, 465, 646, 647, 651, 652, 653, 654, 658, 659, 660, 771, 772, 780, 838, 839, 840, 844, 854, 965, 966, 967, 971, 972]
Discarding 52 places :
Implicit Place search using SMT with State Equation took 2434 ms to find 52 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 992/2117 places, 1250/2435 transitions.
Applied a total of 0 rules in 30 ms. Remains 992 /992 variables (removed 0) and now considering 1250/1250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3661 ms. Remains : 992/2117 places, 1250/2435 transitions.
Support contains 21 out of 992 places after structural reductions.
[2023-03-15 14:01:44] [INFO ] Flatten gal took : 245 ms
[2023-03-15 14:01:44] [INFO ] Flatten gal took : 133 ms
[2023-03-15 14:01:45] [INFO ] Input system was already deterministic with 1250 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1250 rows 992 cols
[2023-03-15 14:01:46] [INFO ] Computed 42 place invariants in 12 ms
[2023-03-15 14:01:46] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 14:01:46] [INFO ] [Nat]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-15 14:01:47] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 14:01:48] [INFO ] After 1442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-03-15 14:01:48] [INFO ] After 2261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 5 properties in 54 ms.
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Graph (trivial) has 806 edges and 992 vertex of which 72 / 992 are part of one of the 9 SCC in 7 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 929 transition count 1033
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 784 transition count 1031
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 293 place count 784 transition count 946
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 463 place count 699 transition count 946
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 495 place count 667 transition count 879
Iterating global reduction 2 with 32 rules applied. Total rules applied 527 place count 667 transition count 879
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 529 place count 667 transition count 877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 530 place count 666 transition count 877
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 530 place count 666 transition count 873
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 538 place count 662 transition count 873
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 542 place count 658 transition count 867
Iterating global reduction 4 with 4 rules applied. Total rules applied 546 place count 658 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 547 place count 658 transition count 866
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 548 place count 657 transition count 864
Iterating global reduction 5 with 1 rules applied. Total rules applied 549 place count 657 transition count 864
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 550 place count 656 transition count 863
Iterating global reduction 5 with 1 rules applied. Total rules applied 551 place count 656 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 552 place count 656 transition count 862
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 6 with 686 rules applied. Total rules applied 1238 place count 313 transition count 519
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1254 place count 297 transition count 489
Iterating global reduction 6 with 16 rules applied. Total rules applied 1270 place count 297 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1272 place count 297 transition count 487
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1277 place count 292 transition count 477
Iterating global reduction 7 with 5 rules applied. Total rules applied 1282 place count 292 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1285 place count 292 transition count 474
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1287 place count 290 transition count 470
Iterating global reduction 8 with 2 rules applied. Total rules applied 1289 place count 290 transition count 470
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1321 place count 274 transition count 501
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 1344 place count 274 transition count 478
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1374 place count 251 transition count 471
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1418 place count 251 transition count 437
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 54 rules applied. Total rules applied 1472 place count 207 transition count 427
Applied a total of 1472 rules in 757 ms. Remains 207 /992 variables (removed 785) and now considering 427/1250 (removed 823) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 757 ms. Remains : 207/992 places, 427/1250 transitions.
Finished random walk after 6230 steps, including 84 resets, run visited all 1 properties in 50 ms. (steps per millisecond=124 )
Computed a total of 68 stabilizing places and 68 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' '!(G(F(p0)))'
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Graph (trivial) has 805 edges and 992 vertex of which 72 / 992 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 928 transition count 1042
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 291 place count 784 transition count 1040
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 291 place count 784 transition count 963
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 445 place count 707 transition count 963
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 477 place count 675 transition count 896
Iterating global reduction 2 with 32 rules applied. Total rules applied 509 place count 675 transition count 896
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 511 place count 675 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 512 place count 674 transition count 894
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 512 place count 674 transition count 892
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 516 place count 672 transition count 892
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 521 place count 667 transition count 884
Iterating global reduction 4 with 5 rules applied. Total rules applied 526 place count 667 transition count 884
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 528 place count 667 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 529 place count 666 transition count 882
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 531 place count 664 transition count 879
Iterating global reduction 6 with 2 rules applied. Total rules applied 533 place count 664 transition count 879
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 535 place count 662 transition count 876
Iterating global reduction 6 with 2 rules applied. Total rules applied 537 place count 662 transition count 876
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 539 place count 662 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 540 place count 661 transition count 874
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 541 place count 660 transition count 873
Iterating global reduction 8 with 1 rules applied. Total rules applied 542 place count 660 transition count 873
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 543 place count 660 transition count 872
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 9 with 694 rules applied. Total rules applied 1237 place count 313 transition count 525
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1252 place count 298 transition count 497
Iterating global reduction 9 with 15 rules applied. Total rules applied 1267 place count 298 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1269 place count 298 transition count 495
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1274 place count 293 transition count 485
Iterating global reduction 10 with 5 rules applied. Total rules applied 1279 place count 293 transition count 485
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1282 place count 293 transition count 482
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1284 place count 291 transition count 478
Iterating global reduction 11 with 2 rules applied. Total rules applied 1286 place count 291 transition count 478
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1312 place count 278 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1313 place count 277 transition count 476
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1322 place count 268 transition count 476
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 1370 place count 244 transition count 452
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 12 with 24 rules applied. Total rules applied 1394 place count 244 transition count 428
Applied a total of 1394 rules in 729 ms. Remains 244 /992 variables (removed 748) and now considering 428/1250 (removed 822) transitions.
[2023-03-15 14:01:50] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
// Phase 1: matrix 420 rows 244 cols
[2023-03-15 14:01:50] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-15 14:01:50] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-15 14:01:50] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2023-03-15 14:01:50] [INFO ] Invariant cache hit.
[2023-03-15 14:01:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:01:51] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [204]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 739 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/992 places, 428/1250 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 427
Applied a total of 2 rules in 15 ms. Remains 242 /243 variables (removed 1) and now considering 427/428 (removed 1) transitions.
[2023-03-15 14:01:51] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 242 cols
[2023-03-15 14:01:51] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-15 14:01:51] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-15 14:01:51] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2023-03-15 14:01:51] [INFO ] Invariant cache hit.
[2023-03-15 14:01:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:01:52] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/992 places, 427/1250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2127 ms. Remains : 242/992 places, 427/1250 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s159 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 495 steps with 6 reset in 11 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-00 finished in 2453 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)))'
Support contains 1 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 976 transition count 1233
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 976 transition count 1233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 976 transition count 1232
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 964 transition count 1216
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 964 transition count 1216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 964 transition count 1215
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 71 place count 951 transition count 1199
Iterating global reduction 2 with 13 rules applied. Total rules applied 84 place count 951 transition count 1199
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 944 transition count 1189
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 944 transition count 1189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 944 transition count 1188
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 938 transition count 1180
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 938 transition count 1180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 938 transition count 1179
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 116 place count 934 transition count 1174
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 934 transition count 1174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 934 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 124 place count 931 transition count 1170
Iterating global reduction 5 with 3 rules applied. Total rules applied 127 place count 931 transition count 1170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 129 place count 931 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 130 place count 930 transition count 1167
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 930 transition count 1167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 132 place count 930 transition count 1166
Applied a total of 132 rules in 304 ms. Remains 930 /992 variables (removed 62) and now considering 1166/1250 (removed 84) transitions.
// Phase 1: matrix 1166 rows 930 cols
[2023-03-15 14:01:52] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-15 14:01:53] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-15 14:01:53] [INFO ] Invariant cache hit.
[2023-03-15 14:01:54] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned [775]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1601 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/992 places, 1166/1250 transitions.
Applied a total of 0 rules in 27 ms. Remains 929 /929 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1934 ms. Remains : 929/992 places, 1166/1250 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s915 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1250 ms.
Product exploration explored 100000 steps with 50000 reset in 973 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3B-LTLCardinality-04 finished in 4383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Graph (trivial) has 807 edges and 992 vertex of which 72 / 992 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 928 transition count 1041
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 783 transition count 1039
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 293 place count 783 transition count 962
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 447 place count 706 transition count 962
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 480 place count 673 transition count 894
Iterating global reduction 2 with 33 rules applied. Total rules applied 513 place count 673 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 515 place count 673 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 672 transition count 892
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 516 place count 672 transition count 889
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 522 place count 669 transition count 889
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 527 place count 664 transition count 881
Iterating global reduction 4 with 5 rules applied. Total rules applied 532 place count 664 transition count 881
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 534 place count 664 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 535 place count 663 transition count 879
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 537 place count 661 transition count 876
Iterating global reduction 6 with 2 rules applied. Total rules applied 539 place count 661 transition count 876
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 541 place count 659 transition count 873
Iterating global reduction 6 with 2 rules applied. Total rules applied 543 place count 659 transition count 873
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 545 place count 659 transition count 871
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 546 place count 658 transition count 871
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 547 place count 657 transition count 870
Iterating global reduction 8 with 1 rules applied. Total rules applied 548 place count 657 transition count 870
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 549 place count 657 transition count 869
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 0 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 9 with 692 rules applied. Total rules applied 1241 place count 311 transition count 523
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1256 place count 296 transition count 495
Iterating global reduction 9 with 15 rules applied. Total rules applied 1271 place count 296 transition count 495
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1273 place count 296 transition count 493
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1277 place count 292 transition count 485
Iterating global reduction 10 with 4 rules applied. Total rules applied 1281 place count 292 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1283 place count 292 transition count 483
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1285 place count 290 transition count 479
Iterating global reduction 11 with 2 rules applied. Total rules applied 1287 place count 290 transition count 479
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1313 place count 277 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1314 place count 276 transition count 477
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1323 place count 267 transition count 477
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 1371 place count 243 transition count 453
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 12 with 24 rules applied. Total rules applied 1395 place count 243 transition count 429
Applied a total of 1395 rules in 230 ms. Remains 243 /992 variables (removed 749) and now considering 429/1250 (removed 821) transitions.
[2023-03-15 14:01:56] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
// Phase 1: matrix 421 rows 243 cols
[2023-03-15 14:01:56] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-15 14:01:57] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-15 14:01:57] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
[2023-03-15 14:01:57] [INFO ] Invariant cache hit.
[2023-03-15 14:01:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:01:57] [INFO ] Implicit Places using invariants and state equation in 445 ms returned [199]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 905 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/992 places, 429/1250 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 428
Applied a total of 2 rules in 12 ms. Remains 241 /242 variables (removed 1) and now considering 428/429 (removed 1) transitions.
[2023-03-15 14:01:57] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
// Phase 1: matrix 420 rows 241 cols
[2023-03-15 14:01:57] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-15 14:01:58] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-15 14:01:58] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2023-03-15 14:01:58] [INFO ] Invariant cache hit.
[2023-03-15 14:01:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:01:58] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 241/992 places, 428/1250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1756 ms. Remains : 241/992 places, 428/1250 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-05 finished in 1813 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 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 979 transition count 1237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 979 transition count 1237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 979 transition count 1236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 970 transition count 1223
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 970 transition count 1223
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 958 transition count 1209
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 958 transition count 1209
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 952 transition count 1200
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 952 transition count 1200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 952 transition count 1199
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 947 transition count 1192
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 947 transition count 1192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 943 transition count 1187
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 943 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 943 transition count 1186
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 940 transition count 1183
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 940 transition count 1183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 940 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 939 transition count 1180
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 939 transition count 1180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 939 transition count 1179
Applied a total of 112 rules in 273 ms. Remains 939 /992 variables (removed 53) and now considering 1179/1250 (removed 71) transitions.
// Phase 1: matrix 1179 rows 939 cols
[2023-03-15 14:01:58] [INFO ] Computed 42 place invariants in 7 ms
[2023-03-15 14:01:59] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-15 14:01:59] [INFO ] Invariant cache hit.
[2023-03-15 14:02:00] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned [784]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1620 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 938/992 places, 1179/1250 transitions.
Applied a total of 0 rules in 31 ms. Remains 938 /938 variables (removed 0) and now considering 1179/1179 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1926 ms. Remains : 938/992 places, 1179/1250 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s644 0) (EQ s533 1)), p1:(OR (EQ s691 0) (EQ s837 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 50000 reset in 939 ms.
Product exploration explored 100000 steps with 50000 reset in 811 ms.
Computed a total of 67 stabilizing places and 67 stable transitions
Computed a total of 67 stabilizing places and 67 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3B-LTLCardinality-06 finished in 4006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(p2))))'
Support contains 5 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 980 transition count 1237
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 980 transition count 1237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 980 transition count 1235
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 971 transition count 1223
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 971 transition count 1223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 971 transition count 1222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 963 transition count 1212
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 963 transition count 1212
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 958 transition count 1205
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 958 transition count 1205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 958 transition count 1204
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 954 transition count 1199
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 954 transition count 1199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 954 transition count 1198
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 952 transition count 1196
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 952 transition count 1196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 952 transition count 1195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 951 transition count 1194
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 951 transition count 1194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 951 transition count 1193
Applied a total of 89 rules in 273 ms. Remains 951 /992 variables (removed 41) and now considering 1193/1250 (removed 57) transitions.
// Phase 1: matrix 1193 rows 951 cols
[2023-03-15 14:02:02] [INFO ] Computed 42 place invariants in 9 ms
[2023-03-15 14:02:03] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-15 14:02:03] [INFO ] Invariant cache hit.
[2023-03-15 14:02:04] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned [789]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1545 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 950/992 places, 1193/1250 transitions.
Applied a total of 0 rules in 33 ms. Remains 950 /950 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1852 ms. Remains : 950/992 places, 1193/1250 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s903 0) (EQ s83 1)), p1:(EQ s791 1), p0:(OR (EQ s638 0) (EQ s457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33176 reset in 715 ms.
Product exploration explored 100000 steps with 33365 reset in 662 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/950 stabilizing places and 66/1193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (OR (AND p1 p2) (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (OR (AND p1 p2) (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1184 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1193 rows 950 cols
[2023-03-15 14:02:07] [INFO ] Computed 42 place invariants in 5 ms
[2023-03-15 14:02:08] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 14:02:08] [INFO ] [Nat]Absence check using 42 positive place invariants in 29 ms returned sat
[2023-03-15 14:02:09] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 14:02:09] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-15 14:02:09] [INFO ] After 1397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 28 ms.
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Graph (trivial) has 760 edges and 950 vertex of which 72 / 950 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 887 transition count 997
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 249 place count 763 transition count 997
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 249 place count 763 transition count 909
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 425 place count 675 transition count 909
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 447 place count 653 transition count 853
Iterating global reduction 2 with 22 rules applied. Total rules applied 469 place count 653 transition count 853
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1151 place count 312 transition count 512
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1162 place count 301 transition count 492
Iterating global reduction 2 with 11 rules applied. Total rules applied 1173 place count 301 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1175 place count 301 transition count 490
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1177 place count 299 transition count 486
Iterating global reduction 3 with 2 rules applied. Total rules applied 1179 place count 299 transition count 486
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1181 place count 297 transition count 482
Iterating global reduction 3 with 2 rules applied. Total rules applied 1183 place count 297 transition count 482
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1217 place count 280 transition count 521
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1237 place count 280 transition count 501
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1264 place count 260 transition count 494
Free-agglomeration rule (complex) applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1312 place count 260 transition count 460
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 1370 place count 212 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1371 place count 212 transition count 450
Applied a total of 1371 rules in 147 ms. Remains 212 /950 variables (removed 738) and now considering 450/1193 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 212/950 places, 450/1193 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 686131 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 686131 steps, saw 88351 distinct states, run finished after 3002 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:02:12] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
// Phase 1: matrix 445 rows 212 cols
[2023-03-15 14:02:12] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-15 14:02:13] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:13] [INFO ] [Nat]Absence check using 42 positive place invariants in 11 ms returned sat
[2023-03-15 14:02:13] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:13] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-15 14:02:13] [INFO ] After 131ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:13] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 14:02:13] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 14 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 212/212 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2023-03-15 14:02:13] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
[2023-03-15 14:02:13] [INFO ] Invariant cache hit.
[2023-03-15 14:02:14] [INFO ] Implicit Places using invariants in 451 ms returned [8, 29, 52, 71, 98, 136, 158, 201]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 453 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 204/212 places, 450/450 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 183 transition count 429
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 183 transition count 408
Applied a total of 63 rules in 17 ms. Remains 183 /204 variables (removed 21) and now considering 408/450 (removed 42) transitions.
[2023-03-15 14:02:14] [INFO ] Flow matrix only has 403 transitions (discarded 5 similar events)
// Phase 1: matrix 403 rows 183 cols
[2023-03-15 14:02:14] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 14:02:14] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-15 14:02:14] [INFO ] Flow matrix only has 403 transitions (discarded 5 similar events)
[2023-03-15 14:02:14] [INFO ] Invariant cache hit.
[2023-03-15 14:02:14] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-15 14:02:14] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [39, 73, 110, 129]
Discarding 4 places :
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 919 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 179/212 places, 398/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1402 ms. Remains : 179/212 places, 398/450 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 765960 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 765960 steps, saw 111890 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:02:18] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
// Phase 1: matrix 393 rows 179 cols
[2023-03-15 14:02:18] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 14:02:18] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-15 14:02:18] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 14:02:18] [INFO ] After 39ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:18] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-15 14:02:18] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2023-03-15 14:02:18] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:18] [INFO ] Invariant cache hit.
[2023-03-15 14:02:18] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-15 14:02:18] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:18] [INFO ] Invariant cache hit.
[2023-03-15 14:02:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 14:02:19] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-15 14:02:19] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-15 14:02:19] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:19] [INFO ] Invariant cache hit.
[2023-03-15 14:02:19] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1468 ms. Remains : 179/179 places, 398/398 transitions.
Graph (trivial) has 69 edges and 179 vertex of which 48 / 179 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 476 edges and 155 vertex of which 79 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.2 ms
Discarding 76 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 85 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 79 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 78 transition count 151
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 78 transition count 150
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 131 place count 78 transition count 150
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 78 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 77 transition count 148
Applied a total of 133 rules in 13 ms. Remains 77 /179 variables (removed 102) and now considering 148/398 (removed 250) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:02:19] [INFO ] Flow matrix only has 142 transitions (discarded 6 similar events)
// Phase 1: matrix 142 rows 77 cols
[2023-03-15 14:02:19] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 14:02:20] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-15 14:02:20] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 14:02:20] [INFO ] After 26ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:20] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2023-03-15 14:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 14:02:20] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-15 14:02:20] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (OR (AND p1 p2) (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (OR (AND p1 p2) (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (F (NOT (OR (AND p2 p1) (AND p2 p0)))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 1378 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Applied a total of 0 rules in 28 ms. Remains 950 /950 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
// Phase 1: matrix 1193 rows 950 cols
[2023-03-15 14:02:22] [INFO ] Computed 42 place invariants in 5 ms
[2023-03-15 14:02:22] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-15 14:02:22] [INFO ] Invariant cache hit.
[2023-03-15 14:02:23] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2023-03-15 14:02:23] [INFO ] Invariant cache hit.
[2023-03-15 14:02:24] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2451 ms. Remains : 950/950 places, 1193/1193 transitions.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/950 stabilizing places and 66/1193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1009 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 14:02:26] [INFO ] Invariant cache hit.
[2023-03-15 14:02:26] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 14:02:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 49 ms returned sat
[2023-03-15 14:02:27] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 14:02:28] [INFO ] Deduced a trap composed of 73 places in 719 ms of which 2 ms to minimize.
[2023-03-15 14:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 812 ms
[2023-03-15 14:02:28] [INFO ] After 1965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 506 ms.
[2023-03-15 14:02:29] [INFO ] After 2858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 109 ms.
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Graph (trivial) has 760 edges and 950 vertex of which 72 / 950 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 887 transition count 997
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 249 place count 763 transition count 997
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 249 place count 763 transition count 909
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 425 place count 675 transition count 909
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 447 place count 653 transition count 853
Iterating global reduction 2 with 22 rules applied. Total rules applied 469 place count 653 transition count 853
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1151 place count 312 transition count 512
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1162 place count 301 transition count 492
Iterating global reduction 2 with 11 rules applied. Total rules applied 1173 place count 301 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1175 place count 301 transition count 490
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1177 place count 299 transition count 486
Iterating global reduction 3 with 2 rules applied. Total rules applied 1179 place count 299 transition count 486
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1181 place count 297 transition count 482
Iterating global reduction 3 with 2 rules applied. Total rules applied 1183 place count 297 transition count 482
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1217 place count 280 transition count 521
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1237 place count 280 transition count 501
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1264 place count 260 transition count 494
Free-agglomeration rule (complex) applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1312 place count 260 transition count 460
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 1370 place count 212 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1371 place count 212 transition count 450
Applied a total of 1371 rules in 164 ms. Remains 212 /950 variables (removed 738) and now considering 450/1193 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 212/950 places, 450/1193 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 480205 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 480205 steps, saw 64267 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 14:02:33] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
// Phase 1: matrix 445 rows 212 cols
[2023-03-15 14:02:33] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-15 14:02:33] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 14:02:33] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-15 14:02:34] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 14:02:34] [INFO ] State equation strengthened by 143 read => feed constraints.
[2023-03-15 14:02:34] [INFO ] After 228ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 14:02:34] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-15 14:02:34] [INFO ] After 963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 88 ms.
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 212/212 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2023-03-15 14:02:34] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
[2023-03-15 14:02:34] [INFO ] Invariant cache hit.
[2023-03-15 14:02:35] [INFO ] Implicit Places using invariants in 391 ms returned [8, 29, 52, 71, 98, 136, 158, 201]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 402 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 204/212 places, 450/450 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 183 transition count 429
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 183 transition count 408
Applied a total of 63 rules in 25 ms. Remains 183 /204 variables (removed 21) and now considering 408/450 (removed 42) transitions.
[2023-03-15 14:02:35] [INFO ] Flow matrix only has 403 transitions (discarded 5 similar events)
// Phase 1: matrix 403 rows 183 cols
[2023-03-15 14:02:35] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 14:02:35] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-15 14:02:35] [INFO ] Flow matrix only has 403 transitions (discarded 5 similar events)
[2023-03-15 14:02:35] [INFO ] Invariant cache hit.
[2023-03-15 14:02:35] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-15 14:02:36] [INFO ] Implicit Places using invariants and state equation in 561 ms returned [39, 73, 110, 129]
Discarding 4 places :
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 1082 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 179/212 places, 398/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1522 ms. Remains : 179/212 places, 398/450 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:02:36] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
// Phase 1: matrix 393 rows 179 cols
[2023-03-15 14:02:36] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 14:02:36] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-15 14:02:36] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:36] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 14:02:36] [INFO ] After 38ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:36] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-15 14:02:36] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 398/398 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 790392 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 790392 steps, saw 115078 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:02:40] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:40] [INFO ] Invariant cache hit.
[2023-03-15 14:02:40] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-15 14:02:40] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:40] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 14:02:40] [INFO ] After 41ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:40] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 14:02:40] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2023-03-15 14:02:40] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:40] [INFO ] Invariant cache hit.
[2023-03-15 14:02:40] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-15 14:02:40] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:40] [INFO ] Invariant cache hit.
[2023-03-15 14:02:40] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 14:02:41] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2023-03-15 14:02:41] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-15 14:02:41] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2023-03-15 14:02:41] [INFO ] Invariant cache hit.
[2023-03-15 14:02:41] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1312 ms. Remains : 179/179 places, 398/398 transitions.
Graph (trivial) has 69 edges and 179 vertex of which 48 / 179 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 476 edges and 155 vertex of which 79 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.0 ms
Discarding 76 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 85 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 79 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 78 transition count 151
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 78 transition count 150
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 131 place count 78 transition count 150
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 78 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 77 transition count 148
Applied a total of 133 rules in 7 ms. Remains 77 /179 variables (removed 102) and now considering 148/398 (removed 250) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:02:41] [INFO ] Flow matrix only has 142 transitions (discarded 6 similar events)
// Phase 1: matrix 142 rows 77 cols
[2023-03-15 14:02:41] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 14:02:41] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 14:02:42] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 14:02:42] [INFO ] After 17ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2023-03-15 14:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 14:02:42] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-15 14:02:42] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (F (NOT (OR (AND p2 p1) (AND p2 p0)))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 1028 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33233 reset in 643 ms.
Product exploration explored 100000 steps with 33258 reset in 655 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Graph (trivial) has 760 edges and 950 vertex of which 72 / 950 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 887 transition count 1130
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 125 place count 887 transition count 1174
Deduced a syphon composed of 170 places in 3 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 171 place count 887 transition count 1174
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 196 place count 862 transition count 1124
Deduced a syphon composed of 164 places in 4 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 221 place count 862 transition count 1124
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 221 place count 862 transition count 1130
Deduced a syphon composed of 167 places in 3 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 862 transition count 1130
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 243 place count 843 transition count 1083
Deduced a syphon composed of 148 places in 3 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 262 place count 843 transition count 1083
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 262 place count 843 transition count 1088
Deduced a syphon composed of 153 places in 2 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 267 place count 843 transition count 1088
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: -210
Deduced a syphon composed of 504 places in 1 ms
Iterating global reduction 1 with 351 rules applied. Total rules applied 618 place count 843 transition count 1298
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 687 place count 774 transition count 1202
Deduced a syphon composed of 449 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 756 place count 774 transition count 1202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 760 place count 774 transition count 1198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 765 place count 769 transition count 1191
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 770 place count 769 transition count 1191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 772 place count 767 transition count 1186
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 767 transition count 1186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 447 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 775 place count 767 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 776 place count 766 transition count 1185
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 777 place count 766 transition count 1185
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 481 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 812 place count 766 transition count 1423
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 835 place count 743 transition count 1322
Deduced a syphon composed of 458 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 858 place count 743 transition count 1322
Deduced a syphon composed of 458 places in 1 ms
Applied a total of 858 rules in 602 ms. Remains 743 /950 variables (removed 207) and now considering 1322/1193 (removed -129) transitions.
[2023-03-15 14:02:46] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-15 14:02:46] [INFO ] Flow matrix only has 1314 transitions (discarded 8 similar events)
// Phase 1: matrix 1314 rows 743 cols
[2023-03-15 14:02:46] [INFO ] Computed 42 place invariants in 21 ms
[2023-03-15 14:02:47] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 743/950 places, 1322/1193 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1930 ms. Remains : 743/950 places, 1322/1193 transitions.
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Applied a total of 0 rules in 42 ms. Remains 950 /950 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
// Phase 1: matrix 1193 rows 950 cols
[2023-03-15 14:02:47] [INFO ] Computed 42 place invariants in 4 ms
[2023-03-15 14:02:47] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-15 14:02:47] [INFO ] Invariant cache hit.
[2023-03-15 14:02:49] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2023-03-15 14:02:49] [INFO ] Invariant cache hit.
[2023-03-15 14:02:50] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2828 ms. Remains : 950/950 places, 1193/1193 transitions.
Treatment of property NoC3x3-PT-3B-LTLCardinality-10 finished in 47960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(X(G(p1))))))))'
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 978 transition count 1235
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 978 transition count 1235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 978 transition count 1233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 968 transition count 1221
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 968 transition count 1221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 968 transition count 1220
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 62 place count 957 transition count 1206
Iterating global reduction 2 with 11 rules applied. Total rules applied 73 place count 957 transition count 1206
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 951 transition count 1197
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 951 transition count 1197
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 945 transition count 1189
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 945 transition count 1189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 945 transition count 1188
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 941 transition count 1183
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 941 transition count 1183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 941 transition count 1182
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 938 transition count 1179
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 938 transition count 1179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 938 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 937 transition count 1176
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 937 transition count 1176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 937 transition count 1175
Applied a total of 118 rules in 253 ms. Remains 937 /992 variables (removed 55) and now considering 1175/1250 (removed 75) transitions.
// Phase 1: matrix 1175 rows 937 cols
[2023-03-15 14:02:50] [INFO ] Computed 42 place invariants in 4 ms
[2023-03-15 14:02:51] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-15 14:02:51] [INFO ] Invariant cache hit.
[2023-03-15 14:02:52] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2023-03-15 14:02:52] [INFO ] Invariant cache hit.
[2023-03-15 14:02:53] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 937/992 places, 1175/1250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2854 ms. Remains : 937/992 places, 1175/1250 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (EQ s899 0) (EQ s779 1)), p1:(OR (EQ s899 0) (EQ s779 1) (EQ s580 0) (EQ s777 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 158 reset in 331 ms.
Product exploration explored 100000 steps with 158 reset in 544 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:02:54] [INFO ] Invariant cache hit.
[2023-03-15 14:02:55] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:55] [INFO ] [Nat]Absence check using 42 positive place invariants in 29 ms returned sat
[2023-03-15 14:02:55] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:56] [INFO ] After 675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 14:02:56] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 464 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=154 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 267 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 937/937 places, 1175/1175 transitions.
Applied a total of 0 rules in 22 ms. Remains 937 /937 variables (removed 0) and now considering 1175/1175 (removed 0) transitions.
[2023-03-15 14:02:56] [INFO ] Invariant cache hit.
[2023-03-15 14:02:57] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-15 14:02:57] [INFO ] Invariant cache hit.
[2023-03-15 14:02:58] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2023-03-15 14:02:58] [INFO ] Invariant cache hit.
[2023-03-15 14:02:59] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2679 ms. Remains : 937/937 places, 1175/1175 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 238990 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{0=1}
Probabilistic random walk after 238990 steps, saw 133247 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-15 14:03:03] [INFO ] Invariant cache hit.
[2023-03-15 14:03:03] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:03:03] [INFO ] [Nat]Absence check using 42 positive place invariants in 28 ms returned sat
[2023-03-15 14:03:04] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:03:04] [INFO ] After 645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 14:03:04] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 819 steps, including 2 resets, run visited all 1 properties in 13 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 249 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 163 reset in 282 ms.
Product exploration explored 100000 steps with 162 reset in 316 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 937/937 places, 1175/1175 transitions.
Graph (trivial) has 750 edges and 937 vertex of which 72 / 937 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 874 transition count 1112
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 124 place count 874 transition count 1156
Deduced a syphon composed of 169 places in 2 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 170 place count 874 transition count 1156
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 194 place count 850 transition count 1109
Deduced a syphon composed of 163 places in 3 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 218 place count 850 transition count 1109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 218 place count 850 transition count 1115
Deduced a syphon composed of 166 places in 3 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 221 place count 850 transition count 1115
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 239 place count 832 transition count 1071
Deduced a syphon composed of 148 places in 3 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 257 place count 832 transition count 1071
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 257 place count 832 transition count 1076
Deduced a syphon composed of 153 places in 2 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 262 place count 832 transition count 1076
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: -205
Deduced a syphon composed of 497 places in 1 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 606 place count 832 transition count 1281
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 675 place count 763 transition count 1185
Deduced a syphon composed of 442 places in 0 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 744 place count 763 transition count 1185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 748 place count 763 transition count 1181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 753 place count 758 transition count 1174
Deduced a syphon composed of 439 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 758 place count 758 transition count 1174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 760 place count 756 transition count 1167
Deduced a syphon composed of 439 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 762 place count 756 transition count 1167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 440 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 763 place count 756 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 764 place count 755 transition count 1166
Deduced a syphon composed of 439 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 765 place count 755 transition count 1166
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -244
Deduced a syphon composed of 474 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 800 place count 755 transition count 1410
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 823 place count 732 transition count 1310
Deduced a syphon composed of 451 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 846 place count 732 transition count 1310
Deduced a syphon composed of 451 places in 1 ms
Applied a total of 846 rules in 253 ms. Remains 732 /937 variables (removed 205) and now considering 1310/1175 (removed -135) transitions.
[2023-03-15 14:03:06] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-15 14:03:06] [INFO ] Flow matrix only has 1300 transitions (discarded 10 similar events)
// Phase 1: matrix 1300 rows 732 cols
[2023-03-15 14:03:06] [INFO ] Computed 42 place invariants in 11 ms
[2023-03-15 14:03:07] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 732/937 places, 1310/1175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1145 ms. Remains : 732/937 places, 1310/1175 transitions.
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 937/937 places, 1175/1175 transitions.
Applied a total of 0 rules in 22 ms. Remains 937 /937 variables (removed 0) and now considering 1175/1175 (removed 0) transitions.
// Phase 1: matrix 1175 rows 937 cols
[2023-03-15 14:03:07] [INFO ] Computed 42 place invariants in 4 ms
[2023-03-15 14:03:07] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-15 14:03:07] [INFO ] Invariant cache hit.
[2023-03-15 14:03:08] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2023-03-15 14:03:08] [INFO ] Invariant cache hit.
[2023-03-15 14:03:09] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2314 ms. Remains : 937/937 places, 1175/1175 transitions.
Treatment of property NoC3x3-PT-3B-LTLCardinality-11 finished in 19073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Graph (trivial) has 805 edges and 992 vertex of which 72 / 992 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 928 transition count 1042
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 291 place count 784 transition count 1040
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 291 place count 784 transition count 963
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 445 place count 707 transition count 963
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 479 place count 673 transition count 894
Iterating global reduction 2 with 34 rules applied. Total rules applied 513 place count 673 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 515 place count 673 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 672 transition count 892
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 516 place count 672 transition count 889
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 522 place count 669 transition count 889
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 526 place count 665 transition count 882
Iterating global reduction 4 with 4 rules applied. Total rules applied 530 place count 665 transition count 882
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 531 place count 665 transition count 881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 532 place count 664 transition count 881
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 534 place count 662 transition count 878
Iterating global reduction 6 with 2 rules applied. Total rules applied 536 place count 662 transition count 878
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 538 place count 660 transition count 875
Iterating global reduction 6 with 2 rules applied. Total rules applied 540 place count 660 transition count 875
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 542 place count 660 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 543 place count 659 transition count 873
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 544 place count 658 transition count 872
Iterating global reduction 8 with 1 rules applied. Total rules applied 545 place count 658 transition count 872
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 546 place count 658 transition count 871
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 9 with 690 rules applied. Total rules applied 1236 place count 313 transition count 526
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 1252 place count 297 transition count 496
Iterating global reduction 9 with 16 rules applied. Total rules applied 1268 place count 297 transition count 496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1270 place count 297 transition count 494
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1275 place count 292 transition count 484
Iterating global reduction 10 with 5 rules applied. Total rules applied 1280 place count 292 transition count 484
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1283 place count 292 transition count 481
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1285 place count 290 transition count 477
Iterating global reduction 11 with 2 rules applied. Total rules applied 1287 place count 290 transition count 477
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 11 with 28 rules applied. Total rules applied 1315 place count 276 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1316 place count 275 transition count 475
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1325 place count 266 transition count 475
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 1373 place count 242 transition count 451
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 12 with 24 rules applied. Total rules applied 1397 place count 242 transition count 427
Applied a total of 1397 rules in 192 ms. Remains 242 /992 variables (removed 750) and now considering 427/1250 (removed 823) transitions.
[2023-03-15 14:03:09] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 242 cols
[2023-03-15 14:03:09] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-15 14:03:10] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-15 14:03:10] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2023-03-15 14:03:10] [INFO ] Invariant cache hit.
[2023-03-15 14:03:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:03:10] [INFO ] Implicit Places using invariants and state equation in 409 ms returned [200]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 742 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/992 places, 427/1250 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 240 transition count 426
Applied a total of 2 rules in 8 ms. Remains 240 /241 variables (removed 1) and now considering 426/427 (removed 1) transitions.
[2023-03-15 14:03:10] [INFO ] Flow matrix only has 418 transitions (discarded 8 similar events)
// Phase 1: matrix 418 rows 240 cols
[2023-03-15 14:03:10] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-15 14:03:10] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-15 14:03:10] [INFO ] Flow matrix only has 418 transitions (discarded 8 similar events)
[2023-03-15 14:03:10] [INFO ] Invariant cache hit.
[2023-03-15 14:03:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:03:11] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 240/992 places, 426/1250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1588 ms. Remains : 240/992 places, 426/1250 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s233 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 371 steps with 4 reset in 6 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-13 finished in 1693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Graph (trivial) has 806 edges and 992 vertex of which 72 / 992 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 928 transition count 1041
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 783 transition count 1039
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 293 place count 783 transition count 962
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 447 place count 706 transition count 962
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 481 place count 672 transition count 893
Iterating global reduction 2 with 34 rules applied. Total rules applied 515 place count 672 transition count 893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 672 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 518 place count 671 transition count 891
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 518 place count 671 transition count 888
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 524 place count 668 transition count 888
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 529 place count 663 transition count 880
Iterating global reduction 4 with 5 rules applied. Total rules applied 534 place count 663 transition count 880
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 536 place count 663 transition count 878
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 537 place count 662 transition count 878
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 539 place count 660 transition count 875
Iterating global reduction 6 with 2 rules applied. Total rules applied 541 place count 660 transition count 875
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 543 place count 658 transition count 872
Iterating global reduction 6 with 2 rules applied. Total rules applied 545 place count 658 transition count 872
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 547 place count 658 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 548 place count 657 transition count 870
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 549 place count 656 transition count 869
Iterating global reduction 8 with 1 rules applied. Total rules applied 550 place count 656 transition count 869
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 551 place count 656 transition count 868
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 0 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 9 with 688 rules applied. Total rules applied 1239 place count 312 transition count 524
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1254 place count 297 transition count 496
Iterating global reduction 9 with 15 rules applied. Total rules applied 1269 place count 297 transition count 496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1271 place count 297 transition count 494
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1275 place count 293 transition count 486
Iterating global reduction 10 with 4 rules applied. Total rules applied 1279 place count 293 transition count 486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1281 place count 293 transition count 484
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1283 place count 291 transition count 480
Iterating global reduction 11 with 2 rules applied. Total rules applied 1285 place count 291 transition count 480
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1311 place count 278 transition count 479
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1313 place count 278 transition count 479
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1314 place count 277 transition count 478
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1323 place count 268 transition count 478
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 1371 place count 244 transition count 454
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 12 with 24 rules applied. Total rules applied 1395 place count 244 transition count 430
Applied a total of 1395 rules in 174 ms. Remains 244 /992 variables (removed 748) and now considering 430/1250 (removed 820) transitions.
[2023-03-15 14:03:11] [INFO ] Flow matrix only has 422 transitions (discarded 8 similar events)
// Phase 1: matrix 422 rows 244 cols
[2023-03-15 14:03:11] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-15 14:03:11] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-15 14:03:11] [INFO ] Flow matrix only has 422 transitions (discarded 8 similar events)
[2023-03-15 14:03:11] [INFO ] Invariant cache hit.
[2023-03-15 14:03:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:03:12] [INFO ] Implicit Places using invariants and state equation in 446 ms returned [200]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 650 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/992 places, 430/1250 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 429
Applied a total of 2 rules in 7 ms. Remains 242 /243 variables (removed 1) and now considering 429/430 (removed 1) transitions.
[2023-03-15 14:03:12] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
// Phase 1: matrix 421 rows 242 cols
[2023-03-15 14:03:12] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-15 14:03:12] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-15 14:03:12] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
[2023-03-15 14:03:12] [INFO ] Invariant cache hit.
[2023-03-15 14:03:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-15 14:03:12] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/992 places, 429/1250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1528 ms. Remains : 242/992 places, 429/1250 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s209 0) (NEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-15 finished in 1587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(p2))))'
Found a Lengthening insensitive property : NoC3x3-PT-3B-LTLCardinality-10
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 992/992 places, 1250/1250 transitions.
Graph (trivial) has 801 edges and 992 vertex of which 72 / 992 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 928 transition count 1043
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 289 place count 785 transition count 1041
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 289 place count 785 transition count 964
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 443 place count 708 transition count 964
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 472 place count 679 transition count 901
Iterating global reduction 2 with 29 rules applied. Total rules applied 501 place count 679 transition count 901
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 502 place count 679 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 502 place count 679 transition count 898
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 506 place count 677 transition count 898
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 509 place count 674 transition count 893
Iterating global reduction 3 with 3 rules applied. Total rules applied 512 place count 674 transition count 893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 513 place count 674 transition count 892
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 514 place count 673 transition count 890
Iterating global reduction 4 with 1 rules applied. Total rules applied 515 place count 673 transition count 890
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 516 place count 672 transition count 889
Iterating global reduction 4 with 1 rules applied. Total rules applied 517 place count 672 transition count 889
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 518 place count 672 transition count 888
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 5 with 702 rules applied. Total rules applied 1220 place count 321 transition count 537
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1235 place count 306 transition count 509
Iterating global reduction 5 with 15 rules applied. Total rules applied 1250 place count 306 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1252 place count 306 transition count 507
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1256 place count 302 transition count 499
Iterating global reduction 6 with 4 rules applied. Total rules applied 1260 place count 302 transition count 499
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1262 place count 302 transition count 497
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1264 place count 300 transition count 493
Iterating global reduction 7 with 2 rules applied. Total rules applied 1266 place count 300 transition count 493
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1292 place count 287 transition count 492
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1293 place count 287 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1294 place count 286 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1295 place count 285 transition count 491
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1299 place count 283 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1301 place count 283 transition count 487
Applied a total of 1301 rules in 166 ms. Remains 283 /992 variables (removed 709) and now considering 487/1250 (removed 763) transitions.
[2023-03-15 14:03:13] [INFO ] Flow matrix only has 479 transitions (discarded 8 similar events)
// Phase 1: matrix 479 rows 283 cols
[2023-03-15 14:03:13] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-15 14:03:13] [INFO ] Implicit Places using invariants in 286 ms returned [7, 31, 64, 87, 122, 178, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 288 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 276/992 places, 487/1250 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 257 transition count 468
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 57 place count 257 transition count 449
Applied a total of 57 rules in 9 ms. Remains 257 /276 variables (removed 19) and now considering 449/487 (removed 38) transitions.
[2023-03-15 14:03:13] [INFO ] Flow matrix only has 441 transitions (discarded 8 similar events)
// Phase 1: matrix 441 rows 257 cols
[2023-03-15 14:03:13] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 14:03:13] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-15 14:03:13] [INFO ] Flow matrix only has 441 transitions (discarded 8 similar events)
[2023-03-15 14:03:13] [INFO ] Invariant cache hit.
[2023-03-15 14:03:14] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-15 14:03:14] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [208]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 699 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 256/992 places, 449/1250 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 448
Applied a total of 2 rules in 8 ms. Remains 255 /256 variables (removed 1) and now considering 448/449 (removed 1) transitions.
[2023-03-15 14:03:14] [INFO ] Flow matrix only has 440 transitions (discarded 8 similar events)
// Phase 1: matrix 440 rows 255 cols
[2023-03-15 14:03:14] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 14:03:14] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-15 14:03:14] [INFO ] Flow matrix only has 440 transitions (discarded 8 similar events)
[2023-03-15 14:03:14] [INFO ] Invariant cache hit.
[2023-03-15 14:03:14] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-15 14:03:15] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 255/992 places, 448/1250 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2032 ms. Remains : 255/992 places, 448/1250 transitions.
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s243 0) (EQ s8 1)), p1:(EQ s209 1), p0:(OR (EQ s166 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16459 steps with 2550 reset in 136 ms.
Treatment of property NoC3x3-PT-3B-LTLCardinality-10 finished in 2452 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-10 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(X(X((p0&&X(X(G(p1))))))))'
[2023-03-15 14:03:15] [INFO ] Flatten gal took : 59 ms
[2023-03-15 14:03:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-15 14:03:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 992 places, 1250 transitions and 3091 arcs took 11 ms.
Total runtime 95829 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1565/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1565/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NoC3x3-PT-3B-LTLCardinality-10
Could not compute solution for formula : NoC3x3-PT-3B-LTLCardinality-11
BK_STOP 1678888998037
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name NoC3x3-PT-3B-LTLCardinality-10
ltl formula formula --ltl=/tmp/1565/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 992 places, 1250 transitions and 3091 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.350 real 0.070 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1565/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1565/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1565/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1565/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name NoC3x3-PT-3B-LTLCardinality-11
ltl formula formula --ltl=/tmp/1565/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 992 places, 1250 transitions and 3091 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.310 real 0.030 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1565/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1565/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1565/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1565/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 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:
corrupted size vs. prev_size in fastbins
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="NoC3x3-PT-3B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-3B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863539800267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;