About the Execution of LTSMin+red for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 484.724 | 70367.00 | 111531.00 | 667.70 | F?FFFTFTTFF?FTFF | 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.r137-smll-167819418500459.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 DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500459
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678858193374
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=DoubleExponent-PT-003
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:29:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:29:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:29:55] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-15 05:29:56] [INFO ] Transformed 163 places.
[2023-03-15 05:29:56] [INFO ] Transformed 148 transitions.
[2023-03-15 05:29:56] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-003-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 148
Applied a total of 3 rules in 26 ms. Remains 160 /163 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 160 cols
[2023-03-15 05:29:56] [INFO ] Computed 17 place invariants in 23 ms
[2023-03-15 05:29:56] [INFO ] Implicit Places using invariants in 391 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 451 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 147
Applied a total of 2 rules in 24 ms. Remains 158 /159 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 158 cols
[2023-03-15 05:29:56] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-15 05:29:56] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-15 05:29:56] [INFO ] Invariant cache hit.
[2023-03-15 05:29:57] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/163 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 895 ms. Remains : 158/163 places, 147/148 transitions.
Support contains 46 out of 158 places after structural reductions.
[2023-03-15 05:29:57] [INFO ] Flatten gal took : 58 ms
[2023-03-15 05:29:57] [INFO ] Flatten gal took : 24 ms
[2023-03-15 05:29:57] [INFO ] Input system was already deterministic with 147 transitions.
Support contains 45 out of 158 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 27) seen :5
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-15 05:29:58] [INFO ] Invariant cache hit.
[2023-03-15 05:29:59] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-15 05:29:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-15 05:29:59] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 7 ms returned sat
[2023-03-15 05:29:59] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2023-03-15 05:29:59] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 11 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 333 ms
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 1 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2023-03-15 05:30:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2023-03-15 05:30:00] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-15 05:30:01] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-15 05:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-15 05:30:01] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2023-03-15 05:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 05:30:01] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-15 05:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-15 05:30:01] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2023-03-15 05:30:01] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2023-03-15 05:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-15 05:30:01] [INFO ] After 2124ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :20
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-15 05:30:01] [INFO ] After 2753ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :20
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 592 ms.
Support contains 34 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 147/147 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 158 transition count 133
Reduce places removed 14 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 22 rules applied. Total rules applied 36 place count 144 transition count 125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 44 place count 136 transition count 125
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 44 place count 136 transition count 120
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 54 place count 131 transition count 120
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 80 place count 118 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 116 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 116 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 115 transition count 106
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 100 place count 115 transition count 92
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 114 place count 101 transition count 92
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 121 place count 101 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 100 transition count 91
Applied a total of 122 rules in 73 ms. Remains 100 /158 variables (removed 58) and now considering 91/147 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 100/158 places, 91/147 transitions.
Incomplete random walk after 10000 steps, including 700 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10000 steps, including 547 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 540 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 543 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 556 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 558 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 556 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 542 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 540 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 567 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 550 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 556 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 542 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 575 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 545 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 91 rows 100 cols
[2023-03-15 05:30:06] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-15 05:30:06] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 05:30:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 05:30:06] [INFO ] [Nat]Absence check using 3 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-15 05:30:06] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 05:30:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:06] [INFO ] After 114ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-15 05:30:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-15 05:30:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-15 05:30:06] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-15 05:30:06] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2023-03-15 05:30:06] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2023-03-15 05:30:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 231 ms
[2023-03-15 05:30:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:30:07] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2023-03-15 05:30:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-15 05:30:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-15 05:30:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2023-03-15 05:30:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-15 05:30:07] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-15 05:30:07] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 23 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 91/91 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 98 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 98 transition count 87
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 96 transition count 87
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 91 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 91 transition count 82
Applied a total of 20 rules in 27 ms. Remains 91 /100 variables (removed 9) and now considering 82/91 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 91/100 places, 82/91 transitions.
Incomplete random walk after 10000 steps, including 716 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 562 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 556 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 566 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 558 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 548 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 544 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 564 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 557 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 560 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 534 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 524 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 553 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Finished probabilistic random walk after 1873299 steps, run visited all 14 properties in 6733 ms. (steps per millisecond=278 )
Probabilistic random walk after 1873299 steps, saw 936871 distinct states, run finished after 6734 ms. (steps per millisecond=278 ) properties seen :14
FORMULA DoubleExponent-PT-003-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DoubleExponent-PT-003-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 262 edges and 158 vertex of which 155 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 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)||G((p1&&X(G(!p0)))))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 155 transition count 116
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 126 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 124 transition count 114
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 63 place count 124 transition count 106
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 116 transition count 106
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 131 place count 90 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 87 transition count 80
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 87 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 86 transition count 79
Applied a total of 139 rules in 31 ms. Remains 86 /158 variables (removed 72) and now considering 79/147 (removed 68) transitions.
// Phase 1: matrix 79 rows 86 cols
[2023-03-15 05:30:18] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 05:30:18] [INFO ] Implicit Places using invariants in 83 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/158 places, 79/147 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 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 78
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 2 with 2 rules applied. Total rules applied 4 place count 83 transition count 77
Applied a total of 4 rules in 10 ms. Remains 83 /85 variables (removed 2) and now considering 77/79 (removed 2) transitions.
// Phase 1: matrix 77 rows 83 cols
[2023-03-15 05:30:18] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:30:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-15 05:30:18] [INFO ] Invariant cache hit.
[2023-03-15 05:30:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:18] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/158 places, 77/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 83/158 places, 77/147 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s22 s76), p1:(LEQ s5 s15)], nbAcceptance=2, 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 16559 steps with 2311 reset in 139 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-00 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U (G(p1)&&F(p2))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-15 05:30:19] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 05:30:19] [INFO ] Implicit Places using invariants in 91 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s131 s15), p0:(LEQ s127 s130), p2:(LEQ s119 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3320 reset in 235 ms.
Product exploration explored 100000 steps with 3329 reset in 350 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 485 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 322 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 794726 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{1=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 794726 steps, saw 397408 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 156 cols
[2023-03-15 05:30:25] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 05:30:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:30:25] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-15 05:30:25] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 570 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 156 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 154 transition count 112
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 121 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 119 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 71 place count 119 transition count 105
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 81 place count 114 transition count 105
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 133 place count 88 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 85 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 84 transition count 78
Applied a total of 140 rules in 22 ms. Remains 84 /156 variables (removed 72) and now considering 78/147 (removed 69) transitions.
// Phase 1: matrix 78 rows 84 cols
[2023-03-15 05:30:26] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:30:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-15 05:30:26] [INFO ] Invariant cache hit.
[2023-03-15 05:30:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:26] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-15 05:30:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:30:26] [INFO ] Invariant cache hit.
[2023-03-15 05:30:26] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/156 places, 78/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 84/156 places, 78/147 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 226 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1363 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:30:27] [INFO ] Invariant cache hit.
[2023-03-15 05:30:27] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:30:27] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-15 05:30:27] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:27] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:27] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 05:30:27] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 78/78 transitions.
Graph (complete) has 216 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 82 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 77 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 76 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 27 place count 76 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 38 place count 65 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 48 place count 65 transition count 60
Applied a total of 48 rules in 20 ms. Remains 65 /84 variables (removed 19) and now considering 60/78 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 65/84 places, 60/78 transitions.
Finished random walk after 8504 steps, including 1111 resets, run visited all 1 properties in 11 ms. (steps per millisecond=773 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 13830 reset in 115 ms.
Product exploration explored 100000 steps with 13872 reset in 345 ms.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 78/78 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 81 transition count 76
Applied a total of 6 rules in 8 ms. Remains 81 /84 variables (removed 3) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 81 cols
[2023-03-15 05:30:28] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:30:28] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-15 05:30:28] [INFO ] Invariant cache hit.
[2023-03-15 05:30:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-15 05:30:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 05:30:29] [INFO ] Invariant cache hit.
[2023-03-15 05:30:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 76/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 81/84 places, 76/78 transitions.
Treatment of property DoubleExponent-PT-003-LTLCardinality-01 finished in 10001 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(X(F(G((X(!(X(p0) U X(p1)))&&p0)))))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 111
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 121 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 71 place count 120 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 114 transition count 104
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 137 place count 87 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 83 transition count 77
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 83 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 82 transition count 76
Applied a total of 148 rules in 23 ms. Remains 82 /158 variables (removed 76) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 82 cols
[2023-03-15 05:30:29] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:29] [INFO ] Implicit Places using invariants in 80 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/158 places, 76/147 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 74
Applied a total of 4 rules in 4 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 79 cols
[2023-03-15 05:30:29] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-15 05:30:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-15 05:30:29] [INFO ] Invariant cache hit.
[2023-03-15 05:30:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:30:29] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/158 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 79/158 places, 74/147 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 1 s2), p0:(GT s29 s26)], 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 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-02 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-15 05:30:29] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 05:30:29] [INFO ] Implicit Places using invariants in 82 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT 3 s71) (GT s60 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-04 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1&&X((p2&&F(p1)))))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
[2023-03-15 05:30:29] [INFO ] Invariant cache hit.
[2023-03-15 05:30:29] [INFO ] Implicit Places using invariants in 91 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p1)), true, (AND p1 (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s95 s87), p0:(AND (LEQ s72 s53) (LEQ 1 s143)), p2:(GT 1 s143)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1730 steps with 61 reset in 8 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-06 finished in 332 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 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
[2023-03-15 05:30:30] [INFO ] Invariant cache hit.
[2023-03-15 05:30:30] [INFO ] Implicit Places using invariants in 96 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s21 s48)], 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 289 ms.
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 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 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-07 finished in 830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
[2023-03-15 05:30:30] [INFO ] Invariant cache hit.
[2023-03-15 05:30:31] [INFO ] Implicit Places using invariants in 95 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s50 s124), p0:(LEQ s114 s103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-08 finished in 774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 155 transition count 110
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 120 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 71 place count 120 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 115 transition count 105
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 137 place count 87 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 143 place count 84 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 83 transition count 76
Applied a total of 144 rules in 16 ms. Remains 83 /158 variables (removed 75) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 83 cols
[2023-03-15 05:30:31] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:31] [INFO ] Implicit Places using invariants in 105 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/158 places, 76/147 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 80 transition count 74
Applied a total of 4 rules in 4 ms. Remains 80 /82 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 80 cols
[2023-03-15 05:30:31] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:30:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-15 05:30:31] [INFO ] Invariant cache hit.
[2023-03-15 05:30:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:32] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/158 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 80/158 places, 74/147 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s38), p1:(GT s22 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-09 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(F(p1)&&F(p2))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-15 05:30:32] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 05:30:32] [INFO ] Implicit Places using invariants in 102 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s67 s82), p1:(LEQ s17 s135), p2:(GT s150 s155)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-10 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 157 transition count 112
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 123 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 122 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 70 place count 122 transition count 104
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 84 place count 115 transition count 104
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 140 place count 87 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 84 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 83 transition count 75
Applied a total of 147 rules in 16 ms. Remains 83 /158 variables (removed 75) and now considering 75/147 (removed 72) transitions.
// Phase 1: matrix 75 rows 83 cols
[2023-03-15 05:30:32] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-15 05:30:32] [INFO ] Implicit Places using invariants in 78 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/158 places, 75/147 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 80 transition count 73
Applied a total of 4 rules in 4 ms. Remains 80 /82 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-15 05:30:32] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:32] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-15 05:30:32] [INFO ] Invariant cache hit.
[2023-03-15 05:30:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:30:32] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/158 places, 73/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 80/158 places, 73/147 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s14 s63), p0:(LEQ s24 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13859 reset in 111 ms.
Product exploration explored 100000 steps with 13944 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 231 edges and 80 vertex of which 77 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1036441 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1036441 steps, saw 518376 distinct states, run finished after 3002 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:30:36] [INFO ] Invariant cache hit.
[2023-03-15 05:30:36] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 05:30:36] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 05:30:36] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:30:36] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:36] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-15 05:30:36] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 73/73 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 26 place count 67 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 36 place count 67 transition count 60
Applied a total of 36 rules in 7 ms. Remains 67 /80 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 67/80 places, 60/73 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1103009 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1103009 steps, saw 551648 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 67 cols
[2023-03-15 05:30:39] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:39] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 05:30:39] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 05:30:39] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:39] [INFO ] After 9ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:39] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-15 05:30:39] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 67/67 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-15 05:30:39] [INFO ] Invariant cache hit.
[2023-03-15 05:30:40] [INFO ] Implicit Places using invariants in 97 ms returned [35, 40, 58, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/67 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 58
Applied a total of 4 rules in 3 ms. Remains 61 /63 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 61 cols
[2023-03-15 05:30:40] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:30:40] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 05:30:40] [INFO ] Invariant cache hit.
[2023-03-15 05:30:40] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:40] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/67 places, 58/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 366 ms. Remains : 61/67 places, 58/60 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1210669 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :{}
Probabilistic random walk after 1210669 steps, saw 605441 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:30:43] [INFO ] Invariant cache hit.
[2023-03-15 05:30:43] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 05:30:43] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:30:43] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:43] [INFO ] After 11ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:43] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-03-15 05:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 05:30:43] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 05:30:43] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-15 05:30:43] [INFO ] Invariant cache hit.
[2023-03-15 05:30:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 05:30:43] [INFO ] Invariant cache hit.
[2023-03-15 05:30:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-15 05:30:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:30:43] [INFO ] Invariant cache hit.
[2023-03-15 05:30:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 61/61 places, 58/58 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 55
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 56 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 53
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 12 place count 55 transition count 52
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 50
Applied a total of 16 rules in 9 ms. Remains 53 /61 variables (removed 8) and now considering 50/58 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 53 cols
[2023-03-15 05:30:43] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 05:30:43] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 05:30:43] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:30:43] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:30:43] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:43] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 05:30:43] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-15 05:30:44] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-15 05:30:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-15 05:30:44] [INFO ] Invariant cache hit.
[2023-03-15 05:30:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:30:44] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-15 05:30:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:30:44] [INFO ] Invariant cache hit.
[2023-03-15 05:30:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 80/80 places, 73/73 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 231 edges and 80 vertex of which 77 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1038434 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1038434 steps, saw 519373 distinct states, run finished after 3006 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:30:47] [INFO ] Invariant cache hit.
[2023-03-15 05:30:47] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 05:30:47] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:30:47] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:30:47] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:47] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 05:30:47] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 73/73 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 26 place count 67 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 36 place count 67 transition count 60
Applied a total of 36 rules in 8 ms. Remains 67 /80 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 67/80 places, 60/73 transitions.
Incomplete random walk after 10000 steps, including 1241 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1131891 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1131891 steps, saw 566030 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 67 cols
[2023-03-15 05:30:51] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-15 05:30:51] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 05:30:51] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-15 05:30:51] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:51] [INFO ] After 9ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:51] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 05:30:51] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 67/67 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-15 05:30:51] [INFO ] Invariant cache hit.
[2023-03-15 05:30:51] [INFO ] Implicit Places using invariants in 102 ms returned [35, 40, 58, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/67 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 58
Applied a total of 4 rules in 5 ms. Remains 61 /63 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 61 cols
[2023-03-15 05:30:51] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-15 05:30:51] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-15 05:30:51] [INFO ] Invariant cache hit.
[2023-03-15 05:30:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:51] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/67 places, 58/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 341 ms. Remains : 61/67 places, 58/60 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1217230 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 1217230 steps, saw 608716 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 05:30:54] [INFO ] Invariant cache hit.
[2023-03-15 05:30:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 05:30:54] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:30:54] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:54] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:54] [INFO ] After 12ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:54] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-15 05:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 05:30:54] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 05:30:54] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-15 05:30:54] [INFO ] Invariant cache hit.
[2023-03-15 05:30:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-15 05:30:54] [INFO ] Invariant cache hit.
[2023-03-15 05:30:54] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 05:30:54] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-15 05:30:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 05:30:54] [INFO ] Invariant cache hit.
[2023-03-15 05:30:55] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 61/61 places, 58/58 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 55
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 56 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 53
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 12 place count 55 transition count 52
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 50
Applied a total of 16 rules in 6 ms. Remains 53 /61 variables (removed 8) and now considering 50/58 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 53 cols
[2023-03-15 05:30:55] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 05:30:55] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:30:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 05:30:55] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 05:30:55] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:30:55] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:30:55] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-15 05:30:55] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13921 reset in 109 ms.
Product exploration explored 100000 steps with 13898 reset in 120 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 73/73 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 71
Applied a total of 4 rules in 5 ms. Remains 78 /80 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 78 cols
[2023-03-15 05:30:55] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-15 05:30:55] [INFO ] Invariant cache hit.
[2023-03-15 05:30:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-15 05:30:55] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-15 05:30:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:30:56] [INFO ] Invariant cache hit.
[2023-03-15 05:30:56] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/80 places, 71/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 78/80 places, 71/73 transitions.
Treatment of property DoubleExponent-PT-003-LTLCardinality-11 finished in 23618 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(p0)||F(p1)) U !p0)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 3 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-15 05:30:56] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:56] [INFO ] Implicit Places using invariants in 87 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s46 s65), p0:(LEQ s96 s139)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-14 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U (G(p1)&&F(p2))))))'
Found a Lengthening insensitive property : DoubleExponent-PT-003-LTLCardinality-01
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 114
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 122 transition count 112
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 122 transition count 107
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 117 transition count 107
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 129 place count 91 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 88 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 87 transition count 80
Applied a total of 136 rules in 12 ms. Remains 87 /158 variables (removed 71) and now considering 80/147 (removed 67) transitions.
// Phase 1: matrix 80 rows 87 cols
[2023-03-15 05:30:56] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 05:30:56] [INFO ] Implicit Places using invariants in 72 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 86/158 places, 80/147 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 78
Applied a total of 4 rules in 4 ms. Remains 84 /86 variables (removed 2) and now considering 78/80 (removed 2) transitions.
// Phase 1: matrix 78 rows 84 cols
[2023-03-15 05:30:57] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-15 05:30:57] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-15 05:30:57] [INFO ] Invariant cache hit.
[2023-03-15 05:30:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:57] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 84/158 places, 78/147 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 403 ms. Remains : 84/158 places, 78/147 transitions.
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s69 s10), p0:(LEQ s66 s68), p2:(LEQ s62 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13842 reset in 132 ms.
Product exploration explored 100000 steps with 14040 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 226 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 453 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 796 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2023-03-15 05:30:58] [INFO ] Invariant cache hit.
[2023-03-15 05:30:58] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 05:30:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:30:58] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 05:30:58] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 05:30:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:30:58] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 05:30:58] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 05:30:58] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 78/78 transitions.
Graph (complete) has 216 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 82 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 77 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 76 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 27 place count 76 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 38 place count 65 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 48 place count 65 transition count 60
Applied a total of 48 rules in 10 ms. Remains 65 /84 variables (removed 19) and now considering 60/78 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 65/84 places, 60/78 transitions.
Finished random walk after 1344 steps, including 182 resets, run visited all 1 properties in 3 ms. (steps per millisecond=448 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 547 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-15 05:30:59] [INFO ] Invariant cache hit.
[2023-03-15 05:30:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-15 05:30:59] [INFO ] Invariant cache hit.
[2023-03-15 05:30:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:31:00] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-15 05:31:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 05:31:00] [INFO ] Invariant cache hit.
[2023-03-15 05:31:00] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 84/84 places, 78/78 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 226 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Finished random walk after 4803 steps, including 690 resets, run visited all 3 properties in 105 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 13897 reset in 114 ms.
Product exploration explored 100000 steps with 13843 reset in 127 ms.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 78/78 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 81 transition count 76
Applied a total of 6 rules in 5 ms. Remains 81 /84 variables (removed 3) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 81 cols
[2023-03-15 05:31:01] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 05:31:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-15 05:31:01] [INFO ] Invariant cache hit.
[2023-03-15 05:31:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-15 05:31:02] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-15 05:31:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 05:31:02] [INFO ] Invariant cache hit.
[2023-03-15 05:31:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 76/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 81/84 places, 76/78 transitions.
Treatment of property DoubleExponent-PT-003-LTLCardinality-01 finished in 5858 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&&G(F(p1)))))'
[2023-03-15 05:31:02] [INFO ] Flatten gal took : 23 ms
[2023-03-15 05:31:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 05:31:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 147 transitions and 409 arcs took 7 ms.
Total runtime 66579 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1740/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1740/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-003-LTLCardinality-01
Could not compute solution for formula : DoubleExponent-PT-003-LTLCardinality-11
BK_STOP 1678858263741
--------------------
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 DoubleExponent-PT-003-LTLCardinality-01
ltl formula formula --ltl=/tmp/1740/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 158 places, 147 transitions and 409 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1740/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1740/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1740/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1740/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DoubleExponent-PT-003-LTLCardinality-11
ltl formula formula --ltl=/tmp/1740/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 158 places, 147 transitions and 409 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1740/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1740/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1740/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1740/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
0: pnml2lts-mc(+0xa23f4) [0x559c2d7693f4]
1: pnml2lts-mc(+0xa2496) [0x559c2d769496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f94c6857140]
3: pnml2lts-mc(+0x405be5) [0x559c2daccbe5]
4: pnml2lts-mc(+0x16b3f9) [0x559c2d8323f9]
5: pnml2lts-mc(+0x164ac4) [0x559c2d82bac4]
6: pnml2lts-mc(+0x272e0a) [0x559c2d939e0a]
7: pnml2lts-mc(+0xb61f0) [0x559c2d77d1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f94c66aa4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f94c66aa67a]
10: pnml2lts-mc(+0xa1581) [0x559c2d768581]
11: pnml2lts-mc(+0xa1910) [0x559c2d768910]
12: pnml2lts-mc(+0xa32a2) [0x559c2d76a2a2]
13: pnml2lts-mc(+0xa50f4) [0x559c2d76c0f4]
14: pnml2lts-mc(+0x3f34b3) [0x559c2daba4b3]
15: pnml2lts-mc(+0x7c63d) [0x559c2d74363d]
16: pnml2lts-mc(+0x67d86) [0x559c2d72ed86]
17: pnml2lts-mc(+0x60a8a) [0x559c2d727a8a]
18: pnml2lts-mc(+0x5eb15) [0x559c2d725b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f94c6692d0a]
20: pnml2lts-mc(+0x6075e) [0x559c2d72775e]
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r137-smll-167819418500459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 ;