About the Execution of LoLa+red for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1126.487 | 3415916.00 | 3713916.00 | 10638.50 | ?FFF?FF??TFFTFTF | 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.r135-smll-167819414500484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414500484
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 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.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 340K 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-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678349939348
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:19:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:19:03] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-09 08:19:03] [INFO ] Transformed 1064 places.
[2023-03-09 08:19:03] [INFO ] Transformed 998 transitions.
[2023-03-09 08:19:03] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 153 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:19:04] [INFO ] Invariants computation overflowed in 227 ms
[2023-03-09 08:19:05] [INFO ] Implicit Places using invariants in 1619 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:19:05] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-09 08:19:24] [INFO ] Implicit Places using invariants and state equation in 19356 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21022 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 315 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:19:25] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-09 08:19:26] [INFO ] Implicit Places using invariants in 831 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:19:26] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-09 08:19:48] [INFO ] Implicit Places using invariants and state equation in 22809 ms returned []
Implicit Place search using SMT with State Equation took 23648 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45139 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 42 out of 1057 places after structural reductions.
[2023-03-09 08:19:49] [INFO ] Flatten gal took : 169 ms
[2023-03-09 08:19:49] [INFO ] Flatten gal took : 86 ms
[2023-03-09 08:19:49] [INFO ] Input system was already deterministic with 997 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:19:51] [INFO ] Invariants computation overflowed in 198 ms
[2023-03-09 08:19:54] [INFO ] After 1786ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:21
[2023-03-09 08:19:56] [INFO ] Deduced a trap composed of 18 places in 760 ms of which 11 ms to minimize.
[2023-03-09 08:19:57] [INFO ] Deduced a trap composed of 77 places in 875 ms of which 3 ms to minimize.
[2023-03-09 08:19:57] [INFO ] Deduced a trap composed of 16 places in 839 ms of which 2 ms to minimize.
[2023-03-09 08:19:58] [INFO ] Deduced a trap composed of 101 places in 677 ms of which 4 ms to minimize.
[2023-03-09 08:19:59] [INFO ] Deduced a trap composed of 115 places in 587 ms of which 2 ms to minimize.
[2023-03-09 08:19:59] [INFO ] Deduced a trap composed of 113 places in 367 ms of which 1 ms to minimize.
[2023-03-09 08:20:00] [INFO ] Deduced a trap composed of 151 places in 464 ms of which 2 ms to minimize.
[2023-03-09 08:20:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5255 ms
[2023-03-09 08:20:01] [INFO ] Deduced a trap composed of 235 places in 203 ms of which 1 ms to minimize.
[2023-03-09 08:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-09 08:20:01] [INFO ] After 8327ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-09 08:20:01] [INFO ] After 9424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-09 08:20:18] [INFO ] After 16249ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-03-09 08:20:19] [INFO ] Deduced a trap composed of 139 places in 638 ms of which 2 ms to minimize.
[2023-03-09 08:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 851 ms
[2023-03-09 08:20:20] [INFO ] Deduced a trap composed of 131 places in 570 ms of which 1 ms to minimize.
[2023-03-09 08:20:21] [INFO ] Deduced a trap composed of 127 places in 462 ms of which 1 ms to minimize.
[2023-03-09 08:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1425 ms
[2023-03-09 08:20:22] [INFO ] Deduced a trap composed of 101 places in 610 ms of which 2 ms to minimize.
[2023-03-09 08:20:23] [INFO ] Deduced a trap composed of 103 places in 671 ms of which 2 ms to minimize.
[2023-03-09 08:20:23] [INFO ] Deduced a trap composed of 151 places in 556 ms of which 1 ms to minimize.
[2023-03-09 08:20:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2194 ms
[2023-03-09 08:20:26] [INFO ] Deduced a trap composed of 125 places in 575 ms of which 3 ms to minimize.
[2023-03-09 08:20:27] [INFO ] Deduced a trap composed of 9 places in 879 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:20:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 08:20:27] [INFO ] After 25906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 1 properties in 31017 ms.
Support contains 33 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 211 rules applied. Total rules applied 212 place count 1055 transition count 785
Reduce places removed 210 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 219 rules applied. Total rules applied 431 place count 845 transition count 776
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 440 place count 836 transition count 776
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 440 place count 836 transition count 736
Deduced a syphon composed of 40 places in 11 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 520 place count 796 transition count 736
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 4 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 866 place count 623 transition count 563
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 12 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 936 place count 588 transition count 563
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 937 place count 588 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 938 place count 587 transition count 562
Free-agglomeration rule (complex) applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 1011 place count 587 transition count 489
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 1084 place count 514 transition count 489
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 5 with 86 rules applied. Total rules applied 1170 place count 514 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1171 place count 513 transition count 488
Applied a total of 1171 rules in 364 ms. Remains 513 /1057 variables (removed 544) and now considering 488/997 (removed 509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 513/1057 places, 488/997 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 83725 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83725 steps, saw 41881 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 488 rows 513 cols
[2023-03-09 08:21:02] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 08:21:04] [INFO ] After 994ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-09 08:21:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-09 08:21:04] [INFO ] After 517ms SMT Verify possible using 72 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 08:21:04] [INFO ] After 1940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 08:21:07] [INFO ] After 2470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-09 08:21:14] [INFO ] After 6380ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-09 08:21:14] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 2 ms to minimize.
[2023-03-09 08:21:15] [INFO ] Deduced a trap composed of 9 places in 377 ms of which 1 ms to minimize.
[2023-03-09 08:21:15] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 1 ms to minimize.
[2023-03-09 08:21:16] [INFO ] Deduced a trap composed of 8 places in 376 ms of which 1 ms to minimize.
[2023-03-09 08:21:16] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 1 ms to minimize.
[2023-03-09 08:21:16] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2023-03-09 08:21:16] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 1 ms to minimize.
[2023-03-09 08:21:17] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 1 ms to minimize.
[2023-03-09 08:21:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2671 ms
[2023-03-09 08:21:17] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-09 08:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-09 08:21:18] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2023-03-09 08:21:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-09 08:21:19] [INFO ] Deduced a trap composed of 158 places in 471 ms of which 2 ms to minimize.
[2023-03-09 08:21:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2023-03-09 08:21:20] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2023-03-09 08:21:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-09 08:21:22] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2023-03-09 08:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-09 08:21:22] [INFO ] After 14784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3869 ms.
[2023-03-09 08:21:26] [INFO ] After 21798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 30000 ms.
Support contains 33 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 488/488 transitions.
Applied a total of 0 rules in 47 ms. Remains 513 /513 variables (removed 0) and now considering 488/488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 513/513 places, 488/488 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 488/488 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 488/488 (removed 0) transitions.
// Phase 1: matrix 488 rows 513 cols
[2023-03-09 08:21:56] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-09 08:21:57] [INFO ] Implicit Places using invariants in 526 ms returned []
// Phase 1: matrix 488 rows 513 cols
[2023-03-09 08:21:57] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-09 08:21:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-09 08:22:27] [INFO ] Performed 432/513 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:22:38] [INFO ] Implicit Places using invariants and state equation in 40993 ms returned [449]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 41523 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 512/513 places, 488/488 transitions.
Applied a total of 0 rules in 23 ms. Remains 512 /512 variables (removed 0) and now considering 488/488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41581 ms. Remains : 512/513 places, 488/488 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 U p1))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 55 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:22:38] [INFO ] Invariants computation overflowed in 175 ms
[2023-03-09 08:22:39] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:22:39] [INFO ] Invariants computation overflowed in 170 ms
[2023-03-09 08:22:40] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:22:40] [INFO ] Invariants computation overflowed in 175 ms
[2023-03-09 08:22:41] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3246 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 435 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s922 1) (LT s591 1)), p0:(GEQ s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3347 reset in 553 ms.
Product exploration explored 100000 steps with 3328 reset in 455 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 154877 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154877 steps, saw 77456 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:22:47] [INFO ] Invariants computation overflowed in 153 ms
[2023-03-09 08:22:50] [INFO ] After 3411ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 08:22:54] [INFO ] After 3259ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 08:22:55] [INFO ] Deduced a trap composed of 39 places in 656 ms of which 2 ms to minimize.
[2023-03-09 08:22:55] [INFO ] Deduced a trap composed of 42 places in 529 ms of which 1 ms to minimize.
[2023-03-09 08:22:56] [INFO ] Deduced a trap composed of 18 places in 577 ms of which 1 ms to minimize.
[2023-03-09 08:22:56] [INFO ] Deduced a trap composed of 127 places in 487 ms of which 3 ms to minimize.
[2023-03-09 08:22:57] [INFO ] Deduced a trap composed of 113 places in 359 ms of which 3 ms to minimize.
[2023-03-09 08:22:57] [INFO ] Deduced a trap composed of 115 places in 456 ms of which 2 ms to minimize.
[2023-03-09 08:22:58] [INFO ] Deduced a trap composed of 101 places in 544 ms of which 2 ms to minimize.
[2023-03-09 08:22:59] [INFO ] Deduced a trap composed of 103 places in 559 ms of which 2 ms to minimize.
[2023-03-09 08:22:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5027 ms
[2023-03-09 08:23:00] [INFO ] After 8941ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-09 08:23:00] [INFO ] After 9521ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2002 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 1079 place count 556 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 1158 place count 477 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1237 place count 477 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 476 transition count 453
Applied a total of 1238 rules in 165 ms. Remains 476 /1057 variables (removed 581) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 476/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1287 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 246563 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246563 steps, saw 123335 distinct states, run finished after 3005 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 08:23:05] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:23:07] [INFO ] After 1199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 08:23:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:23:08] [INFO ] After 1083ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-09 08:23:08] [INFO ] After 1170ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:23:08] [INFO ] After 2522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:23:09] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:23:09] [INFO ] After 142ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:23:10] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-09 08:23:10] [INFO ] After 1624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 468 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 17 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 18 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 08:23:10] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-09 08:23:11] [INFO ] Implicit Places using invariants in 927 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 08:23:11] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 08:23:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:23:34] [INFO ] Implicit Places using invariants and state equation in 22598 ms returned [119, 198, 225, 231, 260, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 414, 420, 442, 447, 468, 474]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 23533 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 454/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 454 transition count 445
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 446 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 446 transition count 445
Applied a total of 21 rules in 45 ms. Remains 446 /454 variables (removed 8) and now considering 445/453 (removed 8) transitions.
// Phase 1: matrix 445 rows 446 cols
[2023-03-09 08:23:34] [INFO ] Computed 77 place invariants in 67 ms
[2023-03-09 08:23:36] [INFO ] Implicit Places using invariants in 1887 ms returned [42, 48, 68, 73, 94, 99, 124, 145, 150, 151, 171, 176, 202, 209, 249, 424]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1889 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 430/476 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 430 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 420 transition count 435
Applied a total of 20 rules in 27 ms. Remains 420 /430 variables (removed 10) and now considering 435/445 (removed 10) transitions.
// Phase 1: matrix 435 rows 420 cols
[2023-03-09 08:23:36] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 08:23:36] [INFO ] Implicit Places using invariants in 670 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-09 08:23:36] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 08:23:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:23:52] [INFO ] Implicit Places using invariants and state equation in 16253 ms returned []
Implicit Place search using SMT with State Equation took 16926 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 420/476 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 42440 ms. Remains : 420/476 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 251214 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251214 steps, saw 125627 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 435 rows 420 cols
[2023-03-09 08:23:56] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 08:23:57] [INFO ] After 969ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 08:23:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:23:58] [INFO ] After 656ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:23:58] [INFO ] After 1730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:23:59] [INFO ] After 1139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:23:59] [INFO ] After 350ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:23:59] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-09 08:23:59] [INFO ] After 1827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 471 ms.
Support contains 3 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 37 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 420/420 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 23 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 420 cols
[2023-03-09 08:24:00] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 08:24:01] [INFO ] Implicit Places using invariants in 793 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-09 08:24:01] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 08:24:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:24:31] [INFO ] Performed 409/420 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:24:32] [INFO ] Implicit Places using invariants and state equation in 31140 ms returned []
Implicit Place search using SMT with State Equation took 31934 ms to find 0 implicit places.
[2023-03-09 08:24:32] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-09 08:24:32] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 08:24:32] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32509 ms. Remains : 420/420 places, 435/435 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 518 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 81 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:24:33] [INFO ] Invariants computation overflowed in 238 ms
[2023-03-09 08:24:34] [INFO ] Implicit Places using invariants in 1025 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:24:34] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-09 08:24:36] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:24:36] [INFO ] Invariants computation overflowed in 220 ms
[2023-03-09 08:24:37] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3721 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 196413 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196413 steps, saw 98220 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:24:41] [INFO ] Invariants computation overflowed in 236 ms
[2023-03-09 08:24:44] [INFO ] After 2774ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:24:45] [INFO ] Deduced a trap composed of 39 places in 838 ms of which 2 ms to minimize.
[2023-03-09 08:24:46] [INFO ] Deduced a trap composed of 18 places in 811 ms of which 2 ms to minimize.
[2023-03-09 08:24:46] [INFO ] Deduced a trap composed of 115 places in 504 ms of which 1 ms to minimize.
[2023-03-09 08:24:47] [INFO ] Deduced a trap composed of 113 places in 500 ms of which 1 ms to minimize.
[2023-03-09 08:24:47] [INFO ] Deduced a trap composed of 145 places in 434 ms of which 1 ms to minimize.
[2023-03-09 08:24:48] [INFO ] Deduced a trap composed of 174 places in 508 ms of which 1 ms to minimize.
[2023-03-09 08:24:48] [INFO ] Deduced a trap composed of 150 places in 354 ms of which 1 ms to minimize.
[2023-03-09 08:24:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4605 ms
[2023-03-09 08:24:48] [INFO ] After 7693ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:24:48] [INFO ] After 7944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:24:51] [INFO ] After 2667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:24:52] [INFO ] Deduced a trap composed of 42 places in 552 ms of which 1 ms to minimize.
[2023-03-09 08:24:53] [INFO ] Deduced a trap composed of 18 places in 727 ms of which 2 ms to minimize.
[2023-03-09 08:24:54] [INFO ] Deduced a trap composed of 113 places in 631 ms of which 2 ms to minimize.
[2023-03-09 08:24:54] [INFO ] Deduced a trap composed of 115 places in 606 ms of which 1 ms to minimize.
[2023-03-09 08:24:55] [INFO ] Deduced a trap composed of 127 places in 479 ms of which 1 ms to minimize.
[2023-03-09 08:24:55] [INFO ] Deduced a trap composed of 142 places in 486 ms of which 1 ms to minimize.
[2023-03-09 08:24:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3956 ms
[2023-03-09 08:24:56] [INFO ] After 6744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-09 08:24:56] [INFO ] After 7109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 446 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 15 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 5 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 930 place count 591 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1006 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 1083 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1239 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1240 place count 475 transition count 453
Applied a total of 1240 rules in 262 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281562 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281562 steps, saw 140868 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:24:59] [INFO ] Computed 99 place invariants in 44 ms
[2023-03-09 08:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:25:00] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 48 ms returned sat
[2023-03-09 08:25:00] [INFO ] After 403ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:25:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:25:00] [INFO ] After 382ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:25:00] [INFO ] After 943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:25:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:25:01] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 64 ms returned sat
[2023-03-09 08:25:01] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:25:02] [INFO ] After 707ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:25:02] [INFO ] After 793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 08:25:02] [INFO ] After 1651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 23 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 22 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-09 08:25:02] [INFO ] Invariant cache hit.
[2023-03-09 08:25:05] [INFO ] Implicit Places using invariants in 3222 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3226 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 51 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:25:06] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:25:06] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:25:06] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:25:07] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:25:36] [INFO ] Implicit Places using invariants and state equation in 29732 ms returned []
Implicit Place search using SMT with State Equation took 30464 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33764 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 346083 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346083 steps, saw 173075 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:25:39] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:25:40] [INFO ] After 683ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:25:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:25:40] [INFO ] After 472ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:25:40] [INFO ] After 1272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:25:41] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:25:41] [INFO ] After 155ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:25:41] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:25:41] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 119 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 17 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:25:41] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:25:42] [INFO ] Implicit Places using invariants in 797 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:25:42] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-09 08:25:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:26:06] [INFO ] Implicit Places using invariants and state equation in 23722 ms returned []
Implicit Place search using SMT with State Equation took 24521 ms to find 0 implicit places.
[2023-03-09 08:26:06] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:26:06] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 08:26:06] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25012 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 61 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-09 08:26:06] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 08:26:07] [INFO ] After 907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:26:08] [INFO ] After 936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:26:08] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:26:09] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:26:09] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2023-03-09 08:26:09] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2023-03-09 08:26:09] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 1 ms to minimize.
[2023-03-09 08:26:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1079 ms
[2023-03-09 08:26:09] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 08:26:10] [INFO ] After 2230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3313 reset in 242 ms.
Product exploration explored 100000 steps with 3351 reset in 261 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1056 transition count 996
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 239 place count 1056 transition count 1035
Deduced a syphon composed of 280 places in 19 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 281 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 285 place count 1052 transition count 1031
Deduced a syphon composed of 276 places in 20 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 289 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 458 places in 12 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 471 place count 1052 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 472 place count 1051 transition count 1069
Deduced a syphon composed of 457 places in 12 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 473 place count 1051 transition count 1069
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -251
Deduced a syphon composed of 497 places in 11 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 513 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 554 place count 1010 transition count 1238
Deduced a syphon composed of 456 places in 11 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 595 place count 1010 transition count 1238
Deduced a syphon composed of 456 places in 9 ms
Applied a total of 595 rules in 856 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2023-03-09 08:26:12] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2023-03-09 08:26:12] [INFO ] Invariants computation overflowed in 206 ms
[2023-03-09 08:26:14] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2500 ms. Remains : 1010/1057 places, 1238/997 transitions.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 53 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:26:14] [INFO ] Invariants computation overflowed in 148 ms
[2023-03-09 08:26:14] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:26:15] [INFO ] Invariants computation overflowed in 194 ms
[2023-03-09 08:26:38] [INFO ] Implicit Places using invariants and state equation in 24016 ms returned []
Implicit Place search using SMT with State Equation took 24811 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:26:39] [INFO ] Invariants computation overflowed in 153 ms
[2023-03-09 08:26:40] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26118 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 242101 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)&&F((p1&&X((p1 U (p0||G(p1)))))))))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 4 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 120 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-09 08:26:40] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-09 08:26:41] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2023-03-09 08:26:41] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 08:26:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:26:55] [INFO ] Implicit Places using invariants and state equation in 14191 ms returned []
Implicit Place search using SMT with State Equation took 14750 ms to find 0 implicit places.
[2023-03-09 08:26:55] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2023-03-09 08:26:55] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-09 08:26:56] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15646 ms. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s44 1), p1:(GEQ s321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-02 finished in 15833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 927 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1003 place count 554 transition count 532
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1004 place count 554 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1005 place count 553 transition count 531
Applied a total of 1005 rules in 135 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:26:56] [INFO ] Computed 99 place invariants in 68 ms
[2023-03-09 08:26:56] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-09 08:26:56] [INFO ] Invariant cache hit.
[2023-03-09 08:26:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:27:27] [INFO ] Performed 223/553 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:27:57] [INFO ] Performed 486/553 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-09 08:28:05] [INFO ] Implicit Places using invariants and state equation in 68123 ms returned []
Implicit Place search using SMT with State Equation took 68723 ms to find 0 implicit places.
[2023-03-09 08:28:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 08:28:05] [INFO ] Invariant cache hit.
[2023-03-09 08:28:05] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69358 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s353 1) (LT s365 1)) (OR (LT s177 1) (LT s185 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13792 reset in 166 ms.
Product exploration explored 100000 steps with 13816 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 271491 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271491 steps, saw 135794 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:28:09] [INFO ] Invariant cache hit.
[2023-03-09 08:28:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:28:09] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 62 ms returned sat
[2023-03-09 08:28:10] [INFO ] After 928ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:28:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:28:11] [INFO ] After 698ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:28:11] [INFO ] After 1806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:28:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:28:11] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 53 ms returned sat
[2023-03-09 08:28:11] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:28:12] [INFO ] After 987ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:28:13] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-09 08:28:13] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 2 ms to minimize.
[2023-03-09 08:28:13] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 0 ms to minimize.
[2023-03-09 08:28:14] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 4 ms to minimize.
[2023-03-09 08:28:14] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 1 ms to minimize.
[2023-03-09 08:28:14] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 3 ms to minimize.
[2023-03-09 08:28:14] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 1 ms to minimize.
[2023-03-09 08:28:15] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 2 ms to minimize.
[2023-03-09 08:28:15] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 1 ms to minimize.
[2023-03-09 08:28:15] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2023-03-09 08:28:16] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 1 ms to minimize.
[2023-03-09 08:28:16] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 1 ms to minimize.
[2023-03-09 08:28:16] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:28:16] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2023-03-09 08:28:17] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 1 ms to minimize.
[2023-03-09 08:28:17] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 1 ms to minimize.
[2023-03-09 08:28:17] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 0 ms to minimize.
[2023-03-09 08:28:18] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:28:18] [INFO ] Deduced a trap composed of 26 places in 291 ms of which 0 ms to minimize.
[2023-03-09 08:28:19] [INFO ] Deduced a trap composed of 22 places in 323 ms of which 2 ms to minimize.
[2023-03-09 08:28:19] [INFO ] Deduced a trap composed of 22 places in 314 ms of which 1 ms to minimize.
[2023-03-09 08:28:19] [INFO ] Deduced a trap composed of 18 places in 325 ms of which 1 ms to minimize.
[2023-03-09 08:28:20] [INFO ] Deduced a trap composed of 18 places in 325 ms of which 1 ms to minimize.
[2023-03-09 08:28:20] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:28:20] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2023-03-09 08:28:20] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7861 ms
[2023-03-09 08:28:21] [INFO ] After 9280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-09 08:28:21] [INFO ] After 10430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 83 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 307006 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307006 steps, saw 153596 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2023-03-09 08:28:26] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 08:28:26] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:28:27] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:28:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:28:28] [INFO ] After 1586ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:28:29] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 0 ms to minimize.
[2023-03-09 08:28:29] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 0 ms to minimize.
[2023-03-09 08:28:29] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 1 ms to minimize.
[2023-03-09 08:28:29] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 1 ms to minimize.
[2023-03-09 08:28:30] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 0 ms to minimize.
[2023-03-09 08:28:30] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 1 ms to minimize.
[2023-03-09 08:28:30] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 1 ms to minimize.
[2023-03-09 08:28:31] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 0 ms to minimize.
[2023-03-09 08:28:31] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2023-03-09 08:28:31] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 1 ms to minimize.
[2023-03-09 08:28:32] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 1 ms to minimize.
[2023-03-09 08:28:32] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 1 ms to minimize.
[2023-03-09 08:28:32] [INFO ] Deduced a trap composed of 79 places in 324 ms of which 1 ms to minimize.
[2023-03-09 08:28:33] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2023-03-09 08:28:33] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 1 ms to minimize.
[2023-03-09 08:28:34] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 1 ms to minimize.
[2023-03-09 08:28:34] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2023-03-09 08:28:34] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5432 ms
[2023-03-09 08:28:34] [INFO ] After 7237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 769 ms.
[2023-03-09 08:28:35] [INFO ] After 8581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1024 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 13 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2023-03-09 08:28:36] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 08:28:37] [INFO ] Implicit Places using invariants in 660 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2023-03-09 08:28:37] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 08:28:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:29:01] [INFO ] Implicit Places using invariants and state equation in 24542 ms returned [94, 99, 289, 310, 338, 343, 365, 371, 392, 394, 418, 424, 446, 451, 455, 472, 478]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 25220 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 463 transition count 451
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 451
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 456 transition count 451
Applied a total of 17 rules in 34 ms. Remains 456 /463 variables (removed 7) and now considering 451/458 (removed 7) transitions.
// Phase 1: matrix 451 rows 456 cols
[2023-03-09 08:29:01] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 08:29:02] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 451 rows 456 cols
[2023-03-09 08:29:02] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:29:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:29:19] [INFO ] Implicit Places using invariants and state equation in 17313 ms returned [68, 230, 281, 385]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 17809 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 452/480 places, 451/458 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 452 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 450 transition count 449
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 450 transition count 449
Applied a total of 6 rules in 30 ms. Remains 450 /452 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 450 cols
[2023-03-09 08:29:19] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:29:20] [INFO ] Implicit Places using invariants in 713 ms returned []
// Phase 1: matrix 449 rows 450 cols
[2023-03-09 08:29:20] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:29:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:29:41] [INFO ] Implicit Places using invariants and state equation in 21468 ms returned [197, 210, 224, 257]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 22183 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 446/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 448
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 445 transition count 448
Applied a total of 5 rules in 28 ms. Remains 445 /446 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 445 cols
[2023-03-09 08:29:41] [INFO ] Computed 74 place invariants in 48 ms
[2023-03-09 08:29:42] [INFO ] Implicit Places using invariants in 927 ms returned [42, 48, 72, 115, 121, 148, 171, 176, 202, 247]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 929 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 435/480 places, 448/458 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 435 transition count 441
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 428 transition count 441
Applied a total of 14 rules in 34 ms. Remains 428 /435 variables (removed 7) and now considering 441/448 (removed 7) transitions.
// Phase 1: matrix 441 rows 428 cols
[2023-03-09 08:29:42] [INFO ] Computed 64 place invariants in 83 ms
[2023-03-09 08:29:43] [INFO ] Implicit Places using invariants in 839 ms returned []
[2023-03-09 08:29:43] [INFO ] Invariant cache hit.
[2023-03-09 08:29:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:30:11] [INFO ] Implicit Places using invariants and state equation in 28461 ms returned []
Implicit Place search using SMT with State Equation took 29301 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 95582 ms. Remains : 428/480 places, 441/458 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 22 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:30:12] [INFO ] Computed 99 place invariants in 107 ms
[2023-03-09 08:30:13] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-09 08:30:13] [INFO ] Invariant cache hit.
[2023-03-09 08:30:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:30:29] [INFO ] Implicit Places using invariants and state equation in 15929 ms returned []
Implicit Place search using SMT with State Equation took 16913 ms to find 0 implicit places.
[2023-03-09 08:30:29] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 08:30:29] [INFO ] Invariant cache hit.
[2023-03-09 08:30:29] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17541 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281143 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281143 steps, saw 140622 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:30:33] [INFO ] Invariant cache hit.
[2023-03-09 08:30:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:30:33] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 53 ms returned sat
[2023-03-09 08:30:33] [INFO ] After 731ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:30:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:30:34] [INFO ] After 574ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:30:34] [INFO ] After 1467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:30:34] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 69 ms returned sat
[2023-03-09 08:30:35] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:30:36] [INFO ] After 977ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:30:36] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 1 ms to minimize.
[2023-03-09 08:30:37] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 1 ms to minimize.
[2023-03-09 08:30:37] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 1 ms to minimize.
[2023-03-09 08:30:37] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 1 ms to minimize.
[2023-03-09 08:30:38] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 1 ms to minimize.
[2023-03-09 08:30:38] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 0 ms to minimize.
[2023-03-09 08:30:38] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 0 ms to minimize.
[2023-03-09 08:30:38] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 1 ms to minimize.
[2023-03-09 08:30:39] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 1 ms to minimize.
[2023-03-09 08:30:39] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 1 ms to minimize.
[2023-03-09 08:30:39] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 0 ms to minimize.
[2023-03-09 08:30:40] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 0 ms to minimize.
[2023-03-09 08:30:40] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 1 ms to minimize.
[2023-03-09 08:30:40] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 1 ms to minimize.
[2023-03-09 08:30:40] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 1 ms to minimize.
[2023-03-09 08:30:41] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 1 ms to minimize.
[2023-03-09 08:30:41] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 1 ms to minimize.
[2023-03-09 08:30:41] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:30:42] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2023-03-09 08:30:42] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2023-03-09 08:30:43] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 1 ms to minimize.
[2023-03-09 08:30:43] [INFO ] Deduced a trap composed of 18 places in 310 ms of which 1 ms to minimize.
[2023-03-09 08:30:43] [INFO ] Deduced a trap composed of 18 places in 315 ms of which 1 ms to minimize.
[2023-03-09 08:30:44] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-09 08:30:44] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 1 ms to minimize.
[2023-03-09 08:30:44] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7720 ms
[2023-03-09 08:30:44] [INFO ] After 9132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 442 ms.
[2023-03-09 08:30:45] [INFO ] After 10503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1820 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 39 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1264 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 841 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 297624 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297624 steps, saw 148897 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2023-03-09 08:30:49] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 08:30:50] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:30:50] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:30:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:30:51] [INFO ] After 1380ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:30:52] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 0 ms to minimize.
[2023-03-09 08:30:52] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 1 ms to minimize.
[2023-03-09 08:30:52] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2023-03-09 08:30:53] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 1 ms to minimize.
[2023-03-09 08:30:53] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 1 ms to minimize.
[2023-03-09 08:30:53] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 1 ms to minimize.
[2023-03-09 08:30:54] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 1 ms to minimize.
[2023-03-09 08:30:54] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 1 ms to minimize.
[2023-03-09 08:30:54] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 1 ms to minimize.
[2023-03-09 08:30:55] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2023-03-09 08:30:55] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 2 ms to minimize.
[2023-03-09 08:30:55] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2023-03-09 08:30:56] [INFO ] Deduced a trap composed of 79 places in 319 ms of which 1 ms to minimize.
[2023-03-09 08:30:56] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 1 ms to minimize.
[2023-03-09 08:30:57] [INFO ] Deduced a trap composed of 20 places in 333 ms of which 1 ms to minimize.
[2023-03-09 08:30:57] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-09 08:30:57] [INFO ] Deduced a trap composed of 12 places in 334 ms of which 1 ms to minimize.
[2023-03-09 08:30:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5878 ms
[2023-03-09 08:30:58] [INFO ] After 7516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 989 ms.
[2023-03-09 08:30:59] [INFO ] After 9041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1371 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 17 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2023-03-09 08:31:00] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:31:01] [INFO ] Implicit Places using invariants in 934 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2023-03-09 08:31:01] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 08:31:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:31:32] [INFO ] Performed 363/480 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:31:42] [INFO ] Implicit Places using invariants and state equation in 41426 ms returned [418, 446, 478]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 42362 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 477/480 places, 458/458 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 477 transition count 458
Applied a total of 3 rules in 23 ms. Remains 477 /477 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 477 cols
[2023-03-09 08:31:42] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 08:31:43] [INFO ] Implicit Places using invariants in 703 ms returned []
// Phase 1: matrix 458 rows 477 cols
[2023-03-09 08:31:43] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:31:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:32:14] [INFO ] Performed 398/477 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 08:32:20] [INFO ] Implicit Places using invariants and state equation in 37041 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 37747 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 476/480 places, 458/458 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 458
Applied a total of 1 rules in 19 ms. Remains 476 /476 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 476 cols
[2023-03-09 08:32:20] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 08:32:21] [INFO ] Implicit Places using invariants in 703 ms returned []
// Phase 1: matrix 458 rows 476 cols
[2023-03-09 08:32:21] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-09 08:32:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:32:43] [INFO ] Implicit Places using invariants and state equation in 22470 ms returned [118, 255, 283, 288, 309, 337, 364, 370, 391, 393, 397, 422, 448, 452, 469]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 23177 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 461/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 461 transition count 451
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 454 transition count 451
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 454 transition count 451
Applied a total of 18 rules in 31 ms. Remains 454 /461 variables (removed 7) and now considering 451/458 (removed 7) transitions.
// Phase 1: matrix 451 rows 454 cols
[2023-03-09 08:32:43] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 08:32:44] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 451 rows 454 cols
[2023-03-09 08:32:44] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-09 08:32:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:33:01] [INFO ] Implicit Places using invariants and state equation in 17120 ms returned [67, 123, 150, 173, 199, 205, 212, 226, 231]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 17873 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 445/480 places, 451/458 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 445 transition count 447
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 441 transition count 447
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 441 transition count 447
Applied a total of 10 rules in 28 ms. Remains 441 /445 variables (removed 4) and now considering 447/451 (removed 4) transitions.
// Phase 1: matrix 447 rows 441 cols
[2023-03-09 08:33:01] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:33:02] [INFO ] Implicit Places using invariants in 640 ms returned []
// Phase 1: matrix 447 rows 441 cols
[2023-03-09 08:33:02] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 08:33:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:33:25] [INFO ] Implicit Places using invariants and state equation in 22885 ms returned []
Implicit Place search using SMT with State Equation took 23527 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 441/480 places, 447/458 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 144805 ms. Remains : 441/480 places, 447/458 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13932 reset in 251 ms.
Product exploration explored 100000 steps with 14002 reset in 280 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 21 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2023-03-09 08:33:26] [INFO ] Invariant cache hit.
[2023-03-09 08:33:26] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-09 08:33:26] [INFO ] Invariant cache hit.
[2023-03-09 08:33:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:33:39] [INFO ] Implicit Places using invariants and state equation in 12148 ms returned []
Implicit Place search using SMT with State Equation took 12958 ms to find 0 implicit places.
[2023-03-09 08:33:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 08:33:39] [INFO ] Invariant cache hit.
[2023-03-09 08:33:39] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13508 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 403553 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))&&(X(p1) U ((!p2&&X(p1))||X(G(p1))))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 74 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:33:40] [INFO ] Invariants computation overflowed in 212 ms
[2023-03-09 08:33:40] [INFO ] Implicit Places using invariants in 1044 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:33:41] [INFO ] Invariants computation overflowed in 153 ms
[2023-03-09 08:34:08] [INFO ] Implicit Places using invariants and state equation in 27611 ms returned []
Implicit Place search using SMT with State Equation took 28658 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:34:08] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-09 08:34:09] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29959 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s577 1) (GEQ s655 1)) (NOT (AND (GEQ s732 1) (GEQ s749 1)))), p0:(AND (GEQ s577 1) (GEQ s655 1)), p1:(LT s1030 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-06 finished in 30193 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&&(p1||F(p2))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1055 transition count 761
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 471 place count 821 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 473 place count 819 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 473 place count 819 transition count 719
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 553 place count 779 transition count 719
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 6 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 4 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 993 place count 559 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 558 transition count 535
Applied a total of 994 rules in 159 ms. Remains 558 /1057 variables (removed 499) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:34:10] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-09 08:34:10] [INFO ] Implicit Places using invariants in 715 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:34:10] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-09 08:34:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:34:23] [INFO ] Implicit Places using invariants and state equation in 12168 ms returned []
Implicit Place search using SMT with State Equation took 12886 ms to find 0 implicit places.
[2023-03-09 08:34:23] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:34:23] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 08:34:23] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13444 ms. Remains : 558/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s159 1) (LT s166 1)), p1:(GEQ s137 1), p2:(LT s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13931 reset in 280 ms.
Product exploration explored 100000 steps with 13965 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 797 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:34:25] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-09 08:34:26] [INFO ] After 1480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:34:28] [INFO ] After 1525ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 08:34:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:34:28] [INFO ] After 368ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 08:34:28] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 1 ms to minimize.
[2023-03-09 08:34:29] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 1 ms to minimize.
[2023-03-09 08:34:29] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 1 ms to minimize.
[2023-03-09 08:34:30] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 1 ms to minimize.
[2023-03-09 08:34:30] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 1 ms to minimize.
[2023-03-09 08:34:30] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 1 ms to minimize.
[2023-03-09 08:34:31] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 1 ms to minimize.
[2023-03-09 08:34:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2772 ms
[2023-03-09 08:34:31] [INFO ] After 3284ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 574 ms.
[2023-03-09 08:34:32] [INFO ] After 5555ms 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 9 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 52 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1248 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 863 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 312593 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312593 steps, saw 156385 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:34:35] [INFO ] Computed 99 place invariants in 63 ms
[2023-03-09 08:34:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:34:35] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 72 ms returned sat
[2023-03-09 08:34:35] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:34:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:34:36] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 113 ms returned sat
[2023-03-09 08:34:36] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:34:36] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:34:37] [INFO ] After 585ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:34:37] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 1 ms to minimize.
[2023-03-09 08:34:38] [INFO ] Deduced a trap composed of 22 places in 476 ms of which 1 ms to minimize.
[2023-03-09 08:34:38] [INFO ] Deduced a trap composed of 19 places in 442 ms of which 1 ms to minimize.
[2023-03-09 08:34:39] [INFO ] Deduced a trap composed of 19 places in 497 ms of which 1 ms to minimize.
[2023-03-09 08:34:39] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 1 ms to minimize.
[2023-03-09 08:34:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2597 ms
[2023-03-09 08:34:39] [INFO ] After 3263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-09 08:34:40] [INFO ] After 4179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 21 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 21 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-09 08:34:40] [INFO ] Invariant cache hit.
[2023-03-09 08:34:43] [INFO ] Implicit Places using invariants in 3180 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3183 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 27 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:34:43] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 08:34:43] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:34:43] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:34:44] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:34:54] [INFO ] Implicit Places using invariants and state equation in 10594 ms returned []
Implicit Place search using SMT with State Equation took 11126 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14357 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 332516 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332516 steps, saw 166288 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:34:57] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 08:34:58] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:34:59] [INFO ] After 875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:34:59] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:35:00] [INFO ] After 992ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:35:00] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:35:01] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 1 ms to minimize.
[2023-03-09 08:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 765 ms
[2023-03-09 08:35:01] [INFO ] After 1807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 901 ms.
[2023-03-09 08:35:02] [INFO ] After 3706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:35:02] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 08:35:02] [INFO ] Implicit Places using invariants in 651 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:35:02] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 08:35:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:35:23] [INFO ] Implicit Places using invariants and state equation in 20788 ms returned []
Implicit Place search using SMT with State Equation took 21457 ms to find 0 implicit places.
[2023-03-09 08:35:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:35:23] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 08:35:24] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21833 ms. Remains : 418/418 places, 434/434 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 418 transition count 397
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 381 transition count 397
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 362 transition count 378
Iterating global reduction 0 with 19 rules applied. Total rules applied 112 place count 362 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 58 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2023-03-09 08:35:24] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 08:35:25] [INFO ] After 871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:35:25] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:35:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:35:25] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:35:25] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2023-03-09 08:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-09 08:35:25] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-09 08:35:26] [INFO ] After 1090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 454 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 558 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 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 23 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:35:26] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-09 08:35:27] [INFO ] Implicit Places using invariants in 731 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:35:27] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 08:35:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:35:57] [INFO ] Performed 225/558 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:36:28] [INFO ] Performed 476/558 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-09 08:36:39] [INFO ] Implicit Places using invariants and state equation in 71831 ms returned []
Implicit Place search using SMT with State Equation took 72565 ms to find 0 implicit places.
[2023-03-09 08:36:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:36:39] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 08:36:40] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73327 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 797 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 535 rows 558 cols
[2023-03-09 08:36:40] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-09 08:36:42] [INFO ] After 1383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:36:43] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:36:43] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:36:44] [INFO ] After 1259ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:36:44] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 0 ms to minimize.
[2023-03-09 08:36:45] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 1 ms to minimize.
[2023-03-09 08:36:45] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 2 ms to minimize.
[2023-03-09 08:36:45] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:36:46] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 1 ms to minimize.
[2023-03-09 08:36:46] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 1 ms to minimize.
[2023-03-09 08:36:47] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 1 ms to minimize.
[2023-03-09 08:36:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2508 ms
[2023-03-09 08:36:47] [INFO ] After 3819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-09 08:36:47] [INFO ] After 5128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 84 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1300 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 309775 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 309775 steps, saw 154980 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:36:50] [INFO ] Invariant cache hit.
[2023-03-09 08:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:36:50] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 67 ms returned sat
[2023-03-09 08:36:50] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:36:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:36:51] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 67 ms returned sat
[2023-03-09 08:36:51] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:36:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:36:53] [INFO ] After 1357ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:36:53] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 0 ms to minimize.
[2023-03-09 08:36:53] [INFO ] Deduced a trap composed of 22 places in 397 ms of which 1 ms to minimize.
[2023-03-09 08:36:54] [INFO ] Deduced a trap composed of 19 places in 464 ms of which 1 ms to minimize.
[2023-03-09 08:36:54] [INFO ] Deduced a trap composed of 19 places in 469 ms of which 1 ms to minimize.
[2023-03-09 08:36:55] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 1 ms to minimize.
[2023-03-09 08:36:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2350 ms
[2023-03-09 08:36:55] [INFO ] After 3790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-09 08:36:55] [INFO ] After 4649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 23 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-09 08:36:55] [INFO ] Invariant cache hit.
[2023-03-09 08:36:58] [INFO ] Implicit Places using invariants in 3044 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3046 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 25 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:36:58] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:36:59] [INFO ] Implicit Places using invariants in 637 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:36:59] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 08:36:59] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:37:15] [INFO ] Implicit Places using invariants and state equation in 15862 ms returned []
Implicit Place search using SMT with State Equation took 16501 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19593 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1418 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 922 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322509 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322509 steps, saw 161285 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:37:18] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 08:37:18] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:37:20] [INFO ] After 925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:37:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:37:20] [INFO ] After 842ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:37:21] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2023-03-09 08:37:21] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 1 ms to minimize.
[2023-03-09 08:37:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 746 ms
[2023-03-09 08:37:21] [INFO ] After 1639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 982 ms.
[2023-03-09 08:37:22] [INFO ] After 3663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 15 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 15 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:37:22] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:37:23] [INFO ] Implicit Places using invariants in 819 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:37:23] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 08:37:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:37:37] [INFO ] Implicit Places using invariants and state equation in 13594 ms returned []
Implicit Place search using SMT with State Equation took 14415 ms to find 0 implicit places.
[2023-03-09 08:37:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:37:37] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 08:37:37] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14782 ms. Remains : 418/418 places, 434/434 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 418 transition count 397
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 381 transition count 397
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 362 transition count 378
Iterating global reduction 0 with 19 rules applied. Total rules applied 112 place count 362 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 41 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2023-03-09 08:37:37] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:37:38] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:37:39] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:37:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:37:39] [INFO ] After 203ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:37:39] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-09 08:37:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-09 08:37:39] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-09 08:37:40] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 382 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13935 reset in 251 ms.
Product exploration explored 100000 steps with 13957 reset in 270 ms.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 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 558 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Applied a total of 2 rules in 32 ms. Remains 557 /558 variables (removed 1) and now considering 534/535 (removed 1) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 08:37:41] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 08:37:41] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 08:37:41] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:37:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:37:54] [INFO ] Implicit Places using invariants and state equation in 12914 ms returned []
Implicit Place search using SMT with State Equation took 13448 ms to find 0 implicit places.
[2023-03-09 08:37:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 08:37:54] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:37:55] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/558 places, 534/535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13879 ms. Remains : 557/558 places, 534/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 225247 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(!(((F(p0) U p1)||!p0) U X(p2))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 47 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:37:55] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-09 08:37:56] [INFO ] Implicit Places using invariants in 918 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:37:56] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-09 08:37:57] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:37:57] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-09 08:37:58] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3315 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 346 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s231 1) (GEQ s244 1)), p1:(GEQ s867 1), p2:(GEQ s668 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33208 reset in 966 ms.
Product exploration explored 100000 steps with 33271 reset in 850 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (NOT p0) p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 2478 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 510 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 82409 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82409 steps, saw 41211 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:38:07] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-09 08:38:13] [INFO ] After 4767ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2023-03-09 08:38:15] [INFO ] Deduced a trap composed of 67 places in 658 ms of which 2 ms to minimize.
[2023-03-09 08:38:16] [INFO ] Deduced a trap composed of 149 places in 433 ms of which 1 ms to minimize.
[2023-03-09 08:38:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1344 ms
[2023-03-09 08:38:17] [INFO ] Deduced a trap composed of 161 places in 402 ms of which 1 ms to minimize.
[2023-03-09 08:38:17] [INFO ] Deduced a trap composed of 186 places in 347 ms of which 1 ms to minimize.
[2023-03-09 08:38:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1045 ms
[2023-03-09 08:38:18] [INFO ] After 9408ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-09 08:38:18] [INFO ] After 10206ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-09 08:38:37] [INFO ] After 18515ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-09 08:38:39] [INFO ] Deduced a trap composed of 163 places in 318 ms of which 0 ms to minimize.
[2023-03-09 08:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 548 ms
[2023-03-09 08:38:40] [INFO ] Deduced a trap composed of 199 places in 373 ms of which 1 ms to minimize.
[2023-03-09 08:38:41] [INFO ] Deduced a trap composed of 205 places in 357 ms of which 1 ms to minimize.
[2023-03-09 08:38:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1053 ms
[2023-03-09 08:38:43] [INFO ] After 23821ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 08:38:43] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :12
Fused 19 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 10274 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 114 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 478/1057 places, 455/997 transitions.
Incomplete random walk after 10000 steps, including 1309 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 229361 steps, run timeout after 6001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 229361 steps, saw 114742 distinct states, run finished after 6001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:39:02] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:39:03] [INFO ] After 1103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 08:39:06] [INFO ] After 2667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-09 08:39:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:39:10] [INFO ] After 3456ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-09 08:39:10] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2023-03-09 08:39:10] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 0 ms to minimize.
[2023-03-09 08:39:11] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2023-03-09 08:39:11] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2023-03-09 08:39:11] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2023-03-09 08:39:11] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 1 ms to minimize.
[2023-03-09 08:39:11] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 1 ms to minimize.
[2023-03-09 08:39:12] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2023-03-09 08:39:12] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 1 ms to minimize.
[2023-03-09 08:39:12] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2023-03-09 08:39:12] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 1 ms to minimize.
[2023-03-09 08:39:13] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 1 ms to minimize.
[2023-03-09 08:39:13] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 1 ms to minimize.
[2023-03-09 08:39:14] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 0 ms to minimize.
[2023-03-09 08:39:15] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 1 ms to minimize.
[2023-03-09 08:39:15] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 1 ms to minimize.
[2023-03-09 08:39:15] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2023-03-09 08:39:16] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 1 ms to minimize.
[2023-03-09 08:39:16] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 0 ms to minimize.
[2023-03-09 08:39:17] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2023-03-09 08:39:17] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 0 ms to minimize.
[2023-03-09 08:39:18] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 1 ms to minimize.
[2023-03-09 08:39:18] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 0 ms to minimize.
[2023-03-09 08:39:18] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2023-03-09 08:39:18] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 1 ms to minimize.
[2023-03-09 08:39:19] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 0 ms to minimize.
[2023-03-09 08:39:19] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2023-03-09 08:39:19] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 0 ms to minimize.
[2023-03-09 08:39:19] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9186 ms
[2023-03-09 08:39:23] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2023-03-09 08:39:24] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 1 ms to minimize.
[2023-03-09 08:39:24] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 1 ms to minimize.
[2023-03-09 08:39:24] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2023-03-09 08:39:25] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 1 ms to minimize.
[2023-03-09 08:39:25] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 1 ms to minimize.
[2023-03-09 08:39:25] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 1 ms to minimize.
[2023-03-09 08:39:26] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2023-03-09 08:39:26] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 3 ms to minimize.
[2023-03-09 08:39:26] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 1 ms to minimize.
[2023-03-09 08:39:27] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 1 ms to minimize.
[2023-03-09 08:39:27] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 0 ms to minimize.
[2023-03-09 08:39:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3915 ms
[2023-03-09 08:39:28] [INFO ] After 21898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 08:39:28] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 18000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 14 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:39:46] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 08:39:47] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:39:47] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 08:39:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:40:18] [INFO ] Performed 392/478 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:40:24] [INFO ] Implicit Places using invariants and state equation in 36770 ms returned []
Implicit Place search using SMT with State Equation took 37562 ms to find 0 implicit places.
[2023-03-09 08:40:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:40:24] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 08:40:24] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37964 ms. Remains : 478/478 places, 455/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (NOT p0) p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 3178 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 484 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 77 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:40:28] [INFO ] Invariants computation overflowed in 230 ms
[2023-03-09 08:40:29] [INFO ] Implicit Places using invariants in 1123 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:40:30] [INFO ] Invariants computation overflowed in 212 ms
[2023-03-09 08:40:31] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:40:31] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-09 08:40:32] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3363 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p2)), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) p2))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 2530 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND p2 (NOT p0) p1), false, false, (AND p2 p0 (NOT p1)), (AND p2 p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 180205 steps, run timeout after 6001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 180205 steps, saw 90124 distinct states, run finished after 6001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:40:43] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-09 08:40:45] [INFO ] After 1680ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-09 08:40:46] [INFO ] Deduced a trap composed of 39 places in 718 ms of which 2 ms to minimize.
[2023-03-09 08:40:47] [INFO ] Deduced a trap composed of 149 places in 867 ms of which 2 ms to minimize.
[2023-03-09 08:40:48] [INFO ] Deduced a trap composed of 45 places in 860 ms of which 2 ms to minimize.
[2023-03-09 08:40:49] [INFO ] Deduced a trap composed of 18 places in 866 ms of which 2 ms to minimize.
[2023-03-09 08:40:50] [INFO ] Deduced a trap composed of 151 places in 523 ms of which 1 ms to minimize.
[2023-03-09 08:40:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4476 ms
[2023-03-09 08:40:50] [INFO ] After 6222ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 08:40:50] [INFO ] After 6609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 08:40:56] [INFO ] After 5850ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-09 08:40:57] [INFO ] Deduced a trap composed of 25 places in 670 ms of which 2 ms to minimize.
[2023-03-09 08:40:58] [INFO ] Deduced a trap composed of 18 places in 743 ms of which 1 ms to minimize.
[2023-03-09 08:40:59] [INFO ] Deduced a trap composed of 16 places in 710 ms of which 1 ms to minimize.
[2023-03-09 08:40:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2446 ms
[2023-03-09 08:41:00] [INFO ] Deduced a trap composed of 125 places in 586 ms of which 1 ms to minimize.
[2023-03-09 08:41:01] [INFO ] Deduced a trap composed of 163 places in 581 ms of which 1 ms to minimize.
[2023-03-09 08:41:01] [INFO ] Deduced a trap composed of 139 places in 580 ms of which 2 ms to minimize.
[2023-03-09 08:41:02] [INFO ] Deduced a trap composed of 149 places in 495 ms of which 1 ms to minimize.
[2023-03-09 08:41:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2713 ms
[2023-03-09 08:41:09] [INFO ] After 18587ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 5676 ms.
[2023-03-09 08:41:15] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4143 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 111 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 478/1057 places, 455/997 transitions.
Incomplete random walk after 10000 steps, including 1304 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 139150 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139150 steps, saw 69605 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:41:24] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:41:24] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 08:41:26] [INFO ] After 1434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 08:41:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:41:29] [INFO ] After 3546ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 08:41:30] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 2 ms to minimize.
[2023-03-09 08:41:30] [INFO ] Deduced a trap composed of 78 places in 273 ms of which 1 ms to minimize.
[2023-03-09 08:41:31] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2023-03-09 08:41:31] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 1 ms to minimize.
[2023-03-09 08:41:32] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 1 ms to minimize.
[2023-03-09 08:41:32] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 3 ms to minimize.
[2023-03-09 08:41:32] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 2 ms to minimize.
[2023-03-09 08:41:33] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 2 ms to minimize.
[2023-03-09 08:41:33] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 0 ms to minimize.
[2023-03-09 08:41:33] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 1 ms to minimize.
[2023-03-09 08:41:34] [INFO ] Deduced a trap composed of 25 places in 327 ms of which 0 ms to minimize.
[2023-03-09 08:41:34] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 1 ms to minimize.
[2023-03-09 08:41:34] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 1 ms to minimize.
[2023-03-09 08:41:35] [INFO ] Deduced a trap composed of 45 places in 338 ms of which 1 ms to minimize.
[2023-03-09 08:41:35] [INFO ] Deduced a trap composed of 22 places in 349 ms of which 1 ms to minimize.
[2023-03-09 08:41:36] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2023-03-09 08:41:36] [INFO ] Deduced a trap composed of 20 places in 383 ms of which 1 ms to minimize.
[2023-03-09 08:41:37] [INFO ] Deduced a trap composed of 19 places in 443 ms of which 1 ms to minimize.
[2023-03-09 08:41:37] [INFO ] Deduced a trap composed of 17 places in 437 ms of which 1 ms to minimize.
[2023-03-09 08:41:38] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 1 ms to minimize.
[2023-03-09 08:41:38] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7880 ms
[2023-03-09 08:41:40] [INFO ] After 14254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1484 ms.
[2023-03-09 08:41:41] [INFO ] After 17419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10001 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:41:51] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:41:52] [INFO ] Implicit Places using invariants in 994 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 08:41:52] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-09 08:41:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:42:23] [INFO ] Performed 423/478 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 08:42:24] [INFO ] Implicit Places using invariants and state equation in 31911 ms returned [73, 444, 449, 470, 476]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 32908 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 473 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 453
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 471 transition count 453
Applied a total of 5 rules in 54 ms. Remains 471 /473 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 471 cols
[2023-03-09 08:42:24] [INFO ] Computed 94 place invariants in 99 ms
[2023-03-09 08:42:27] [INFO ] Implicit Places using invariants in 2184 ms returned [42, 48, 68, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 309, 314, 335, 340, 361, 367, 388, 391, 395, 415, 421, 449]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 2188 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 440/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 440 transition count 437
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 424 transition count 437
Applied a total of 32 rules in 27 ms. Remains 424 /440 variables (removed 16) and now considering 437/453 (removed 16) transitions.
// Phase 1: matrix 437 rows 424 cols
[2023-03-09 08:42:27] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 08:42:27] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2023-03-09 08:42:27] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:42:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:42:52] [INFO ] Implicit Places using invariants and state equation in 25143 ms returned []
Implicit Place search using SMT with State Equation took 25741 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60932 ms. Remains : 424/478 places, 437/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p2)), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) p2))), (X (X (OR (NOT p0) (NOT p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 3031 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 455 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 454 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 449 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33183 reset in 1084 ms.
Product exploration explored 100000 steps with 33248 reset in 830 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 73 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:42:59] [INFO ] Invariants computation overflowed in 235 ms
[2023-03-09 08:43:00] [INFO ] Implicit Places using invariants in 1137 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:43:00] [INFO ] Invariants computation overflowed in 232 ms
[2023-03-09 08:43:24] [INFO ] Implicit Places using invariants and state equation in 24040 ms returned []
Implicit Place search using SMT with State Equation took 25178 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:43:24] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-09 08:43:26] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26654 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 330986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 241 rules applied. Total rules applied 480 place count 817 transition count 754
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 14 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 6 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 999 place count 556 transition count 534
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1001 place count 556 transition count 534
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1002 place count 555 transition count 533
Iterating global reduction 3 with 1 rules applied. Total rules applied 1003 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1004 place count 554 transition count 532
Applied a total of 1004 rules in 181 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-09 08:43:26] [INFO ] Computed 99 place invariants in 92 ms
[2023-03-09 08:43:27] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-09 08:43:27] [INFO ] Invariant cache hit.
[2023-03-09 08:43:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:43:58] [INFO ] Performed 215/554 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:44:01] [INFO ] Implicit Places using invariants and state equation in 34555 ms returned []
Implicit Place search using SMT with State Equation took 35507 ms to find 0 implicit places.
[2023-03-09 08:44:01] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 08:44:01] [INFO ] Invariant cache hit.
[2023-03-09 08:44:02] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36362 ms. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s265 1) (LT s310 1)), p0:(OR (LT s10 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13918 reset in 133 ms.
Product exploration explored 100000 steps with 13820 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 554 vertex of which 553 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), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1393 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 199154 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199154 steps, saw 99614 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:44:06] [INFO ] Invariant cache hit.
[2023-03-09 08:44:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:06] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 65 ms returned sat
[2023-03-09 08:44:08] [INFO ] After 1515ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 08:44:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:08] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 62 ms returned sat
[2023-03-09 08:44:10] [INFO ] After 2594ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 08:44:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:44:15] [INFO ] After 4572ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 08:44:15] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-09 08:44:16] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2023-03-09 08:44:16] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 1 ms to minimize.
[2023-03-09 08:44:17] [INFO ] Deduced a trap composed of 16 places in 349 ms of which 1 ms to minimize.
[2023-03-09 08:44:17] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 1 ms to minimize.
[2023-03-09 08:44:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2504 ms
[2023-03-09 08:44:18] [INFO ] After 7186ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 599 ms.
[2023-03-09 08:44:18] [INFO ] After 10548ms 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 2000 ms.
Support contains 4 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1663 edges and 554 vertex of which 553 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 234 place count 476 transition count 454
Applied a total of 234 rules in 66 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 328246 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328246 steps, saw 164213 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:44:23] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:44:24] [INFO ] After 837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:44:25] [INFO ] After 813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:44:25] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:44:29] [INFO ] After 4108ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:44:30] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 4 ms to minimize.
[2023-03-09 08:44:30] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:44:31] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
[2023-03-09 08:44:31] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2023-03-09 08:44:31] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:44:31] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 1 ms to minimize.
[2023-03-09 08:44:32] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 1 ms to minimize.
[2023-03-09 08:44:32] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 0 ms to minimize.
[2023-03-09 08:44:32] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 1 ms to minimize.
[2023-03-09 08:44:32] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 0 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 0 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 0 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 0 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 0 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2023-03-09 08:44:33] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 0 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 0 ms to minimize.
[2023-03-09 08:44:34] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2023-03-09 08:44:35] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4865 ms
[2023-03-09 08:44:35] [INFO ] After 9430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-09 08:44:35] [INFO ] After 10547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:44:37] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 08:44:38] [INFO ] Implicit Places using invariants in 1126 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:44:38] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-09 08:44:38] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:45:06] [INFO ] Implicit Places using invariants and state equation in 28482 ms returned [388, 390, 414, 420, 442, 447, 451, 468, 474]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 29611 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 467 transition count 450
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 463 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 463 transition count 450
Applied a total of 9 rules in 34 ms. Remains 463 /467 variables (removed 4) and now considering 450/454 (removed 4) transitions.
// Phase 1: matrix 450 rows 463 cols
[2023-03-09 08:45:06] [INFO ] Computed 90 place invariants in 53 ms
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants in 2161 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 232, 255, 261, 284, 289, 309, 314, 335, 340, 361, 367, 392]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 2162 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 435/476 places, 450/454 transitions.
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 435 transition count 436
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 421 transition count 436
Applied a total of 29 rules in 28 ms. Remains 421 /435 variables (removed 14) and now considering 436/450 (removed 14) transitions.
// Phase 1: matrix 436 rows 421 cols
[2023-03-09 08:45:09] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants in 630 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-09 08:45:09] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-09 08:45:10] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:45:37] [INFO ] Implicit Places using invariants and state equation in 27367 ms returned []
Implicit Place search using SMT with State Equation took 27999 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 421/476 places, 436/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 59847 ms. Remains : 421/476 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1442 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 915 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334251 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334251 steps, saw 167154 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 436 rows 421 cols
[2023-03-09 08:45:40] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 08:45:41] [INFO ] After 858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:45:41] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:45:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:45:44] [INFO ] After 3031ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:45:45] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2023-03-09 08:45:45] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2023-03-09 08:45:45] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2023-03-09 08:45:45] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-09 08:45:45] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2023-03-09 08:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 881 ms
[2023-03-09 08:45:45] [INFO ] After 4052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-09 08:45:46] [INFO ] After 5259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2023-03-09 08:45:48] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:45:49] [INFO ] Implicit Places using invariants in 761 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-09 08:45:49] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 08:45:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:46:07] [INFO ] Implicit Places using invariants and state equation in 18319 ms returned []
Implicit Place search using SMT with State Equation took 19082 ms to find 0 implicit places.
[2023-03-09 08:46:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-09 08:46:07] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:46:07] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19478 ms. Remains : 421/421 places, 436/436 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-09 finished in 161794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G(p1)))))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 45 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:46:08] [INFO ] Invariants computation overflowed in 235 ms
[2023-03-09 08:46:09] [INFO ] Implicit Places using invariants in 1004 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:46:09] [INFO ] Invariants computation overflowed in 144 ms
[2023-03-09 08:46:32] [INFO ] Implicit Places using invariants and state equation in 23928 ms returned []
Implicit Place search using SMT with State Equation took 24933 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:46:33] [INFO ] Invariants computation overflowed in 150 ms
[2023-03-09 08:46:34] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26236 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s579 1), p0:(AND (GEQ s17 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 26428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 48 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:46:34] [INFO ] Invariants computation overflowed in 224 ms
[2023-03-09 08:46:35] [INFO ] Implicit Places using invariants in 1043 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:46:35] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-09 08:47:03] [INFO ] Implicit Places using invariants and state equation in 28227 ms returned []
Implicit Place search using SMT with State Equation took 29272 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:47:03] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-09 08:47:04] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30427 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s481 1) (GEQ s548 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 30585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 76 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:47:05] [INFO ] Invariants computation overflowed in 235 ms
[2023-03-09 08:47:06] [INFO ] Implicit Places using invariants in 1093 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:47:06] [INFO ] Invariants computation overflowed in 139 ms
[2023-03-09 08:47:34] [INFO ] Implicit Places using invariants and state equation in 28405 ms returned []
Implicit Place search using SMT with State Equation took 29500 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:47:34] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-09 08:47:35] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30803 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s657 1) (LT s664 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 940 ms.
Product exploration explored 100000 steps with 20000 reset in 558 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 340 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 186323 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186323 steps, saw 93176 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:47:41] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-09 08:47:43] [INFO ] After 2085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:47:44] [INFO ] After 1648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:45] [INFO ] Deduced a trap composed of 113 places in 353 ms of which 0 ms to minimize.
[2023-03-09 08:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2023-03-09 08:47:45] [INFO ] After 2293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-09 08:47:45] [INFO ] After 2573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1431 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 480 place count 816 transition count 714
Deduced a syphon composed of 42 places in 9 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1239 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 476 transition count 454
Applied a total of 1240 rules in 118 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 339692 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339692 steps, saw 169934 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:47:50] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 08:47:51] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:47:51] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:47:52] [INFO ] After 1073ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:52] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 0 ms to minimize.
[2023-03-09 08:47:52] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 0 ms to minimize.
[2023-03-09 08:47:53] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2023-03-09 08:47:53] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 0 ms to minimize.
[2023-03-09 08:47:53] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2023-03-09 08:47:53] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 1 ms to minimize.
[2023-03-09 08:47:54] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 1 ms to minimize.
[2023-03-09 08:47:54] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2023-03-09 08:47:54] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 1 ms to minimize.
[2023-03-09 08:47:55] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 1 ms to minimize.
[2023-03-09 08:47:55] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2023-03-09 08:47:55] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 1 ms to minimize.
[2023-03-09 08:47:56] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 1 ms to minimize.
[2023-03-09 08:47:56] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 0 ms to minimize.
[2023-03-09 08:47:57] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 1 ms to minimize.
[2023-03-09 08:47:57] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:47:57] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4831 ms
[2023-03-09 08:47:57] [INFO ] After 5957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-09 08:47:57] [INFO ] After 6566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1085 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 14 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:47:58] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 08:47:59] [INFO ] Implicit Places using invariants in 969 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:47:59] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 08:48:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:48:23] [INFO ] Implicit Places using invariants and state equation in 23873 ms returned [253, 282, 287, 308, 314, 335, 340, 388, 390, 394, 414, 442, 447, 451, 468, 474]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 24843 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 460/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 460 transition count 447
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 453 transition count 447
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 453 transition count 447
Applied a total of 16 rules in 34 ms. Remains 453 /460 variables (removed 7) and now considering 447/454 (removed 7) transitions.
// Phase 1: matrix 447 rows 453 cols
[2023-03-09 08:48:23] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:48:24] [INFO ] Implicit Places using invariants in 883 ms returned []
// Phase 1: matrix 447 rows 453 cols
[2023-03-09 08:48:24] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-09 08:48:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:48:55] [INFO ] Performed 377/453 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:49:01] [INFO ] Implicit Places using invariants and state equation in 37230 ms returned [405]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 38115 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 452/476 places, 447/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 446
Applied a total of 2 rules in 24 ms. Remains 451 /452 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 451 cols
[2023-03-09 08:49:01] [INFO ] Computed 82 place invariants in 60 ms
[2023-03-09 08:49:03] [INFO ] Implicit Places using invariants in 2234 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 258, 351, 357]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 2235 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 430/476 places, 446/454 transitions.
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 430 transition count 435
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 22 place count 419 transition count 435
Applied a total of 22 rules in 26 ms. Remains 419 /430 variables (removed 11) and now considering 435/446 (removed 11) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:49:04] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:49:04] [INFO ] Implicit Places using invariants in 692 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:49:04] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 08:49:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:49:34] [INFO ] Implicit Places using invariants and state equation in 29991 ms returned []
Implicit Place search using SMT with State Equation took 30685 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 95976 ms. Remains : 419/476 places, 435/454 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 76 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:49:35] [INFO ] Invariants computation overflowed in 236 ms
[2023-03-09 08:49:36] [INFO ] Implicit Places using invariants in 1109 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:49:36] [INFO ] Invariants computation overflowed in 175 ms
[2023-03-09 08:50:00] [INFO ] Implicit Places using invariants and state equation in 23756 ms returned []
Implicit Place search using SMT with State Equation took 24867 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:50:00] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-09 08:50:01] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26128 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 178974 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178974 steps, saw 89505 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:50:05] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-09 08:50:07] [INFO ] After 2033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:50:08] [INFO ] After 1713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:50:09] [INFO ] Deduced a trap composed of 113 places in 369 ms of which 1 ms to minimize.
[2023-03-09 08:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2023-03-09 08:50:09] [INFO ] After 2297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-09 08:50:09] [INFO ] After 2576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1430 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 480 place count 816 transition count 714
Deduced a syphon composed of 42 places in 9 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 4 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1239 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 476 transition count 454
Applied a total of 1240 rules in 110 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1310 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322054 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322054 steps, saw 161113 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:50:14] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 08:50:14] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:50:15] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:50:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:50:16] [INFO ] After 955ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:50:16] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 0 ms to minimize.
[2023-03-09 08:50:16] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 1 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 1 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-09 08:50:18] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 0 ms to minimize.
[2023-03-09 08:50:18] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2023-03-09 08:50:18] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 0 ms to minimize.
[2023-03-09 08:50:19] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 1 ms to minimize.
[2023-03-09 08:50:19] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2023-03-09 08:50:19] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 1 ms to minimize.
[2023-03-09 08:50:20] [INFO ] Deduced a trap composed of 18 places in 313 ms of which 1 ms to minimize.
[2023-03-09 08:50:20] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 1 ms to minimize.
[2023-03-09 08:50:20] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 1 ms to minimize.
[2023-03-09 08:50:21] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 1 ms to minimize.
[2023-03-09 08:50:21] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 1 ms to minimize.
[2023-03-09 08:50:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5129 ms
[2023-03-09 08:50:21] [INFO ] After 6133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-09 08:50:21] [INFO ] After 7008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 972 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:50:22] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 08:50:23] [INFO ] Implicit Places using invariants in 947 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 08:50:23] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:50:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:50:46] [INFO ] Implicit Places using invariants and state equation in 23092 ms returned [119, 146, 151, 172, 314, 335, 340, 367, 388, 390, 414, 420, 442, 447, 468, 474]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 24041 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 460/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 460 transition count 450
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 456 transition count 450
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 456 transition count 450
Applied a total of 16 rules in 33 ms. Remains 456 /460 variables (removed 4) and now considering 450/454 (removed 4) transitions.
// Phase 1: matrix 450 rows 456 cols
[2023-03-09 08:50:47] [INFO ] Computed 83 place invariants in 68 ms
[2023-03-09 08:50:49] [INFO ] Implicit Places using invariants in 3052 ms returned [42, 48, 68, 73, 94, 99, 124, 149, 173, 194, 200, 207, 221, 226, 249, 255, 278, 283, 304, 353, 383, 434]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 3053 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/476 places, 450/454 transitions.
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 434 transition count 435
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 30 place count 419 transition count 435
Applied a total of 30 rules in 31 ms. Remains 419 /434 variables (removed 15) and now considering 435/450 (removed 15) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:50:50] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 08:50:50] [INFO ] Implicit Places using invariants in 808 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:50:50] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 08:50:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:51:10] [INFO ] Implicit Places using invariants and state equation in 20044 ms returned []
Implicit Place search using SMT with State Equation took 20854 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 48024 ms. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 878 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355211 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355211 steps, saw 177643 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:51:13] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 08:51:14] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:51:15] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:51:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:51:15] [INFO ] After 879ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:51:16] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2023-03-09 08:51:16] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-09 08:51:16] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2023-03-09 08:51:17] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 0 ms to minimize.
[2023-03-09 08:51:17] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 1 ms to minimize.
[2023-03-09 08:51:17] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 1 ms to minimize.
[2023-03-09 08:51:17] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 1 ms to minimize.
[2023-03-09 08:51:18] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2023-03-09 08:51:18] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 1 ms to minimize.
[2023-03-09 08:51:18] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 1 ms to minimize.
[2023-03-09 08:51:19] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2023-03-09 08:51:19] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2023-03-09 08:51:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4486 ms
[2023-03-09 08:51:20] [INFO ] After 5423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:51:20] [INFO ] After 6069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 278 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:51:20] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 08:51:21] [INFO ] Implicit Places using invariants in 658 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:51:21] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:51:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:51:51] [INFO ] Performed 397/419 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:51:53] [INFO ] Implicit Places using invariants and state equation in 31796 ms returned []
Implicit Place search using SMT with State Equation took 32457 ms to find 0 implicit places.
[2023-03-09 08:51:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:51:53] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 08:51:53] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32880 ms. Remains : 419/419 places, 435/435 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 705 ms.
Product exploration explored 100000 steps with 20000 reset in 625 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1056 transition count 996
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 237 place count 1056 transition count 1035
Deduced a syphon composed of 279 places in 19 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 280 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 284 place count 1052 transition count 1031
Deduced a syphon composed of 275 places in 19 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 288 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 457 places in 13 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 470 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 471 place count 1051 transition count 1070
Deduced a syphon composed of 456 places in 12 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 472 place count 1051 transition count 1070
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -250
Deduced a syphon composed of 496 places in 12 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 512 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 553 place count 1010 transition count 1238
Deduced a syphon composed of 455 places in 16 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 594 place count 1010 transition count 1238
Deduced a syphon composed of 455 places in 9 ms
Applied a total of 594 rules in 437 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2023-03-09 08:51:56] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2023-03-09 08:51:56] [INFO ] Invariants computation overflowed in 219 ms
[2023-03-09 08:51:58] [INFO ] Dead Transitions using invariants and state equation in 1422 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 1010/1057 places, 1238/997 transitions.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 51 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:51:58] [INFO ] Invariants computation overflowed in 156 ms
[2023-03-09 08:51:58] [INFO ] Implicit Places using invariants in 851 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:51:59] [INFO ] Invariants computation overflowed in 217 ms
[2023-03-09 08:52:00] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:52:00] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-09 08:52:00] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2909 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 296064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 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 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 929 place count 591 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1005 place count 553 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1006 place count 552 transition count 530
Applied a total of 1006 rules in 92 ms. Remains 552 /1057 variables (removed 505) and now considering 530/997 (removed 467) transitions.
// Phase 1: matrix 530 rows 552 cols
[2023-03-09 08:52:01] [INFO ] Computed 99 place invariants in 61 ms
[2023-03-09 08:52:01] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-09 08:52:01] [INFO ] Invariant cache hit.
[2023-03-09 08:52:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:52:32] [INFO ] Performed 319/552 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:52:58] [INFO ] Implicit Places using invariants and state equation in 56264 ms returned []
Implicit Place search using SMT with State Equation took 56962 ms to find 0 implicit places.
[2023-03-09 08:52:58] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 08:52:58] [INFO ] Invariant cache hit.
[2023-03-09 08:52:58] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 552/1057 places, 530/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57503 ms. Remains : 552/1057 places, 530/997 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 57581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 753
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 485 place count 813 transition count 713
Deduced a syphon composed of 40 places in 15 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 565 place count 773 transition count 713
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 6 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 929 place count 591 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1005 place count 553 transition count 531
Applied a total of 1005 rules in 126 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:52:58] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 08:52:59] [INFO ] Implicit Places using invariants in 774 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:52:59] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:52:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 08:53:30] [INFO ] Performed 314/553 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:53:56] [INFO ] Implicit Places using invariants and state equation in 56525 ms returned []
Implicit Place search using SMT with State Equation took 57300 ms to find 0 implicit places.
[2023-03-09 08:53:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:53:56] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 08:53:56] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57792 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 965 ms.
Product exploration explored 100000 steps with 50000 reset in 593 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 1749 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/553 stabilizing places and 2/531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-14 finished in 59484 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 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 45 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:53:58] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-09 08:53:58] [INFO ] Implicit Places using invariants in 786 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:53:59] [INFO ] Invariants computation overflowed in 138 ms
[2023-03-09 08:54:21] [INFO ] Implicit Places using invariants and state equation in 22957 ms returned []
Implicit Place search using SMT with State Equation took 23744 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:54:22] [INFO ] Invariants computation overflowed in 207 ms
[2023-03-09 08:54:23] [INFO ] Dead Transitions using invariants and state equation in 1543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25333 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-15 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:(GEQ s445 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-15 finished in 25453 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 U p1))))'
Found a Lengthening insensitive property : DoubleExponent-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 997 place count 557 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 556 transition count 533
Applied a total of 998 rules in 97 ms. Remains 556 /1057 variables (removed 501) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-09 08:54:23] [INFO ] Computed 99 place invariants in 61 ms
[2023-03-09 08:54:24] [INFO ] Implicit Places using invariants in 872 ms returned []
[2023-03-09 08:54:24] [INFO ] Invariant cache hit.
[2023-03-09 08:54:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:54:50] [INFO ] Implicit Places using invariants and state equation in 25802 ms returned []
Implicit Place search using SMT with State Equation took 26676 ms to find 0 implicit places.
[2023-03-09 08:54:50] [INFO ] Invariant cache hit.
[2023-03-09 08:54:51] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 556/1057 places, 533/997 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 27198 ms. Remains : 556/1057 places, 533/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s482 1) (LT s308 1)), p0:(GEQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13774 reset in 186 ms.
Product exploration explored 100000 steps with 13872 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 194778 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194778 steps, saw 97421 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:54:55] [INFO ] Invariant cache hit.
[2023-03-09 08:54:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:54:55] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 59 ms returned sat
[2023-03-09 08:54:56] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 08:54:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:54:56] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 58 ms returned sat
[2023-03-09 08:54:57] [INFO ] After 950ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 08:54:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:54:57] [INFO ] After 674ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-09 08:54:58] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2023-03-09 08:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-09 08:54:58] [INFO ] After 1075ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-09 08:54:58] [INFO ] After 2286ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 909 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 555 transition count 453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 476 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 238 place count 476 transition count 453
Applied a total of 238 rules in 45 ms. Remains 476 /556 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 476/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 230434 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230434 steps, saw 115276 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 08:55:02] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 08:55:03] [INFO ] After 969ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 08:55:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:55:04] [INFO ] After 677ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:55:04] [INFO ] After 1752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:55:05] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:55:06] [INFO ] After 648ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:55:06] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-09 08:55:06] [INFO ] After 1882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 743 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 08:55:07] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 08:55:08] [INFO ] Implicit Places using invariants in 995 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 08:55:08] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 08:55:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:55:36] [INFO ] Implicit Places using invariants and state equation in 28566 ms returned [389, 414, 420, 442, 447, 468, 474]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 29563 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 469/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 469 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 467 transition count 451
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 467 transition count 451
Applied a total of 6 rules in 36 ms. Remains 467 /469 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 467 cols
[2023-03-09 08:55:36] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 08:55:37] [INFO ] Implicit Places using invariants in 1006 ms returned []
// Phase 1: matrix 451 rows 467 cols
[2023-03-09 08:55:37] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-09 08:55:38] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:56:04] [INFO ] Implicit Places using invariants and state equation in 26755 ms returned [151, 172, 313, 334, 339, 366, 387, 392]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 27763 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 459/476 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 459 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 457 transition count 449
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 457 transition count 449
Applied a total of 8 rules in 35 ms. Remains 457 /459 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 457 cols
[2023-03-09 08:56:04] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:56:05] [INFO ] Implicit Places using invariants in 737 ms returned []
// Phase 1: matrix 449 rows 457 cols
[2023-03-09 08:56:05] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 08:56:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:56:35] [INFO ] Performed 179/457 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 08:56:53] [INFO ] Implicit Places using invariants and state equation in 47974 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 48714 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 456/476 places, 449/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 449
Applied a total of 1 rules in 21 ms. Remains 456 /456 variables (removed 0) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 456 cols
[2023-03-09 08:56:53] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 08:56:54] [INFO ] Implicit Places using invariants in 954 ms returned []
// Phase 1: matrix 449 rows 456 cols
[2023-03-09 08:56:54] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 08:56:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:57:16] [INFO ] Implicit Places using invariants and state equation in 22109 ms returned [124, 145, 150, 174, 195, 201, 222, 228, 257, 280, 285, 305, 434]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 23065 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 443/476 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 443 transition count 442
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 436 transition count 442
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 436 transition count 442
Applied a total of 16 rules in 31 ms. Remains 436 /443 variables (removed 7) and now considering 442/449 (removed 7) transitions.
// Phase 1: matrix 442 rows 436 cols
[2023-03-09 08:57:16] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 08:57:17] [INFO ] Implicit Places using invariants in 814 ms returned []
// Phase 1: matrix 442 rows 436 cols
[2023-03-09 08:57:17] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 08:57:17] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:57:26] [INFO ] Implicit Places using invariants and state equation in 9735 ms returned []
Implicit Place search using SMT with State Equation took 10551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 436/476 places, 442/453 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 139792 ms. Remains : 436/476 places, 442/453 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 556 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 14 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
[2023-03-09 08:57:27] [INFO ] Invariant cache hit.
[2023-03-09 08:57:28] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-09 08:57:28] [INFO ] Invariant cache hit.
[2023-03-09 08:57:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:57:49] [INFO ] Implicit Places using invariants and state equation in 21349 ms returned []
Implicit Place search using SMT with State Equation took 22235 ms to find 0 implicit places.
[2023-03-09 08:57:49] [INFO ] Invariant cache hit.
[2023-03-09 08:57:50] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22938 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1374 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 273654 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273654 steps, saw 136877 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:57:53] [INFO ] Invariant cache hit.
[2023-03-09 08:57:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:57:53] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 59 ms returned sat
[2023-03-09 08:57:54] [INFO ] After 917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:57:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:57:54] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 93 ms returned sat
[2023-03-09 08:57:56] [INFO ] After 1050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:57:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:57:56] [INFO ] After 306ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:57:56] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:57:56] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 182 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 91 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 475/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1309 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 328056 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328056 steps, saw 164127 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:57:59] [INFO ] Computed 99 place invariants in 43 ms
[2023-03-09 08:57:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:57:59] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 48 ms returned sat
[2023-03-09 08:58:00] [INFO ] After 415ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:58:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:58:01] [INFO ] After 684ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:01] [INFO ] After 1244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:58:01] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 59 ms returned sat
[2023-03-09 08:58:01] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:02] [INFO ] After 547ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:02] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 08:58:02] [INFO ] After 1438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 151 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-09 08:58:02] [INFO ] Invariant cache hit.
[2023-03-09 08:58:05] [INFO ] Implicit Places using invariants in 2535 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 2536 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 32 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:58:05] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 08:58:05] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:58:05] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 08:58:06] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:58:33] [INFO ] Implicit Places using invariants and state equation in 28110 ms returned []
Implicit Place search using SMT with State Equation took 28632 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31221 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342444 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342444 steps, saw 171257 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:58:36] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:58:37] [INFO ] After 498ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:58:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:58:37] [INFO ] After 364ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:37] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:38] [INFO ] After 724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:39] [INFO ] After 1034ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:39] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-09 08:58:39] [INFO ] After 1939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:58:39] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:58:40] [INFO ] Implicit Places using invariants in 635 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:58:40] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 08:58:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 08:59:08] [INFO ] Implicit Places using invariants and state equation in 27430 ms returned []
Implicit Place search using SMT with State Equation took 28066 ms to find 0 implicit places.
[2023-03-09 08:59:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 08:59:08] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 08:59:08] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28405 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 33 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-09 08:59:08] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 08:59:09] [INFO ] After 801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:59:09] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:59:09] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:59:10] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 0 ms to minimize.
[2023-03-09 08:59:10] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 1 ms to minimize.
[2023-03-09 08:59:10] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-09 08:59:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2023-03-09 08:59:10] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-09 08:59:10] [INFO ] After 1377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13817 reset in 243 ms.
Product exploration explored 100000 steps with 13888 reset in 268 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 533
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 556 transition count 537
Deduced a syphon composed of 3 places in 4 ms
Applied a total of 3 rules in 43 ms. Remains 556 /556 variables (removed 0) and now considering 537/533 (removed -4) transitions.
[2023-03-09 08:59:11] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 537 rows 556 cols
[2023-03-09 08:59:12] [INFO ] Computed 99 place invariants in 104 ms
[2023-03-09 08:59:12] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/556 places, 537/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 959 ms. Remains : 556/556 places, 537/533 transitions.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 14 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-09 08:59:13] [INFO ] Computed 99 place invariants in 102 ms
[2023-03-09 08:59:13] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-09 08:59:13] [INFO ] Invariant cache hit.
[2023-03-09 08:59:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:59:32] [INFO ] Implicit Places using invariants and state equation in 18202 ms returned []
Implicit Place search using SMT with State Equation took 19106 ms to find 0 implicit places.
[2023-03-09 08:59:32] [INFO ] Invariant cache hit.
[2023-03-09 08:59:32] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19602 ms. Remains : 556/556 places, 533/533 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 308964 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)))'
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&&(p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((F(p0) U p1)||!p0) U X(p2))))'
Found a Shortening insensitive property : DoubleExponent-PT-020-LTLFireability-08
Stuttering acceptance computed with spot in 510 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 479 place count 816 transition count 717
Deduced a syphon composed of 39 places in 15 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 6 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 921 place count 595 transition count 535
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 995 place count 558 transition count 535
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 996 place count 558 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 997 place count 557 transition count 534
Applied a total of 997 rules in 173 ms. Remains 557 /1057 variables (removed 500) and now considering 534/997 (removed 463) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 08:59:33] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 08:59:34] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 08:59:34] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:59:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:59:54] [INFO ] Implicit Places using invariants and state equation in 20422 ms returned []
Implicit Place search using SMT with State Equation took 21156 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 08:59:54] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:59:55] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 557/1057 places, 534/997 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 21693 ms. Remains : 557/1057 places, 534/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s116 1) (GEQ s123 1)), p1:(GEQ s453 1), p2:(GEQ s352 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34182 reset in 758 ms.
Product exploration explored 100000 steps with 34027 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (NOT p0) p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 2331 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 104430 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104430 steps, saw 52222 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:00:03] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 09:00:04] [INFO ] After 1078ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2023-03-09 09:00:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 09:00:06] [INFO ] After 1276ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :2 sat :3 real:14
[2023-03-09 09:00:06] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 1 ms to minimize.
[2023-03-09 09:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-09 09:00:07] [INFO ] After 2109ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-09 09:00:07] [INFO ] After 3695ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-09 09:00:11] [INFO ] After 3777ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-09 09:00:20] [INFO ] After 8738ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :6 sat :13
[2023-03-09 09:00:20] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 1 ms to minimize.
[2023-03-09 09:00:21] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 1 ms to minimize.
[2023-03-09 09:00:21] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 0 ms to minimize.
[2023-03-09 09:00:21] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 1 ms to minimize.
[2023-03-09 09:00:21] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 1 ms to minimize.
[2023-03-09 09:00:22] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 1 ms to minimize.
[2023-03-09 09:00:22] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 1 ms to minimize.
[2023-03-09 09:00:22] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 2 ms to minimize.
[2023-03-09 09:00:23] [INFO ] Deduced a trap composed of 57 places in 199 ms of which 0 ms to minimize.
[2023-03-09 09:00:23] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 0 ms to minimize.
[2023-03-09 09:00:24] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 0 ms to minimize.
[2023-03-09 09:00:24] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2023-03-09 09:00:25] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2023-03-09 09:00:25] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 0 ms to minimize.
[2023-03-09 09:00:26] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 1 ms to minimize.
[2023-03-09 09:00:26] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 1 ms to minimize.
[2023-03-09 09:00:26] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 1 ms to minimize.
[2023-03-09 09:00:27] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 0 ms to minimize.
[2023-03-09 09:00:28] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2023-03-09 09:00:28] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 1 ms to minimize.
[2023-03-09 09:00:28] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 0 ms to minimize.
[2023-03-09 09:00:29] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:00:29] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 1 ms to minimize.
[2023-03-09 09:00:29] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 1 ms to minimize.
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 1 ms to minimize.
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 1 ms to minimize.
[2023-03-09 09:00:30] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 1 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 1 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 18 places in 330 ms of which 1 ms to minimize.
[2023-03-09 09:00:31] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 1 ms to minimize.
[2023-03-09 09:00:32] [INFO ] Trap strengthening (SAT) tested/added 30/30 trap constraints in 11494 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 09:00:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 09:00:32] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:17
Fused 19 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 20075 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 38 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1319 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 803 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 225828 steps, run timeout after 6001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 225828 steps, saw 112983 distinct states, run finished after 6001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 09:01:01] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 09:01:02] [INFO ] After 945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 09:01:04] [INFO ] After 1673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-09 09:01:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:01:07] [INFO ] After 3109ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-09 09:01:07] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2023-03-09 09:01:07] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 0 ms to minimize.
[2023-03-09 09:01:08] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 0 ms to minimize.
[2023-03-09 09:01:08] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2023-03-09 09:01:08] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2023-03-09 09:01:08] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2023-03-09 09:01:09] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 1 ms to minimize.
[2023-03-09 09:01:09] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 0 ms to minimize.
[2023-03-09 09:01:09] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 1 ms to minimize.
[2023-03-09 09:01:10] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 1 ms to minimize.
[2023-03-09 09:01:10] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 1 ms to minimize.
[2023-03-09 09:01:10] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 0 ms to minimize.
[2023-03-09 09:01:11] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 1 ms to minimize.
[2023-03-09 09:01:11] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 1 ms to minimize.
[2023-03-09 09:01:12] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 1 ms to minimize.
[2023-03-09 09:01:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4635 ms
[2023-03-09 09:01:17] [INFO ] After 12919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 3722 ms.
[2023-03-09 09:01:20] [INFO ] After 18614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 09:01:34] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 09:01:35] [INFO ] Implicit Places using invariants in 734 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 09:01:35] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-09 09:01:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:02:05] [INFO ] Performed 402/478 implicitness test of which 6 returned IMPLICIT in 30 seconds.
[2023-03-09 09:02:06] [INFO ] Implicit Places using invariants and state equation in 31229 ms returned [48, 73, 362, 368, 389, 392, 416, 422, 444, 449, 453, 470, 476]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 31965 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 465 transition count 450
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 460 transition count 450
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 460 transition count 450
Applied a total of 13 rules in 31 ms. Remains 460 /465 variables (removed 5) and now considering 450/455 (removed 5) transitions.
// Phase 1: matrix 450 rows 460 cols
[2023-03-09 09:02:06] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 09:02:07] [INFO ] Implicit Places using invariants in 644 ms returned []
// Phase 1: matrix 450 rows 460 cols
[2023-03-09 09:02:07] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 09:02:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:02:32] [INFO ] Implicit Places using invariants and state equation in 25521 ms returned [287, 339, 389]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 26168 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 457/478 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 456 transition count 449
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 456 transition count 449
Applied a total of 4 rules in 30 ms. Remains 456 /457 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 456 cols
[2023-03-09 09:02:33] [INFO ] Computed 83 place invariants in 58 ms
[2023-03-09 09:02:34] [INFO ] Implicit Places using invariants in 1588 ms returned [42, 67, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 231, 254, 260, 282, 307, 312, 333]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1590 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 436/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 436 transition count 437
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 424 transition count 437
Applied a total of 24 rules in 29 ms. Remains 424 /436 variables (removed 12) and now considering 437/449 (removed 12) transitions.
// Phase 1: matrix 437 rows 424 cols
[2023-03-09 09:02:34] [INFO ] Computed 63 place invariants in 117 ms
[2023-03-09 09:02:35] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-09 09:02:35] [INFO ] Invariant cache hit.
[2023-03-09 09:02:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:02:44] [INFO ] Implicit Places using invariants and state equation in 8859 ms returned []
Implicit Place search using SMT with State Equation took 9843 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 69669 ms. Remains : 424/478 places, 437/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (NOT p0) p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND p2 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 3112 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 410 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 14 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:02:48] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 09:02:49] [INFO ] Implicit Places using invariants in 822 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:02:49] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 09:02:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 09:03:06] [INFO ] Implicit Places using invariants and state equation in 17234 ms returned []
Implicit Place search using SMT with State Equation took 18058 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:03:06] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 09:03:06] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18438 ms. Remains : 557/557 places, 534/534 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p2)), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) p2))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 2796 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND p2 (NOT p0) p1), false, false, (AND p2 p0 (NOT p1)), (AND p2 p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 1367 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 787 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 133110 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133110 steps, saw 66574 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:03:14] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 09:03:15] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-09 09:03:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 09:03:16] [INFO ] After 434ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 09:03:16] [INFO ] After 1055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 09:03:19] [INFO ] After 2642ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-09 09:03:27] [INFO ] After 8328ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-09 09:03:27] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 1 ms to minimize.
[2023-03-09 09:03:28] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 0 ms to minimize.
[2023-03-09 09:03:28] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 1 ms to minimize.
[2023-03-09 09:03:28] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 1 ms to minimize.
[2023-03-09 09:03:28] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 0 ms to minimize.
[2023-03-09 09:03:29] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 1 ms to minimize.
[2023-03-09 09:03:29] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 0 ms to minimize.
[2023-03-09 09:03:29] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 1 ms to minimize.
[2023-03-09 09:03:29] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 2 ms to minimize.
[2023-03-09 09:03:30] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 0 ms to minimize.
[2023-03-09 09:03:30] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 1 ms to minimize.
[2023-03-09 09:03:30] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 1 ms to minimize.
[2023-03-09 09:03:30] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 1 ms to minimize.
[2023-03-09 09:03:31] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 1 ms to minimize.
[2023-03-09 09:03:31] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 1 ms to minimize.
[2023-03-09 09:03:31] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 1 ms to minimize.
[2023-03-09 09:03:32] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 1 ms to minimize.
[2023-03-09 09:03:32] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 1 ms to minimize.
[2023-03-09 09:03:32] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-09 09:03:32] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 1 ms to minimize.
[2023-03-09 09:03:33] [INFO ] Deduced a trap composed of 97 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:03:33] [INFO ] Deduced a trap composed of 116 places in 269 ms of which 1 ms to minimize.
[2023-03-09 09:03:33] [INFO ] Deduced a trap composed of 103 places in 271 ms of which 0 ms to minimize.
[2023-03-09 09:03:34] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 0 ms to minimize.
[2023-03-09 09:03:34] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 0 ms to minimize.
[2023-03-09 09:03:34] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2023-03-09 09:03:35] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 0 ms to minimize.
[2023-03-09 09:03:35] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 1 ms to minimize.
[2023-03-09 09:03:36] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 1 ms to minimize.
[2023-03-09 09:03:36] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 1 ms to minimize.
[2023-03-09 09:03:36] [INFO ] Deduced a trap composed of 97 places in 289 ms of which 1 ms to minimize.
[2023-03-09 09:03:37] [INFO ] Deduced a trap composed of 101 places in 281 ms of which 1 ms to minimize.
[2023-03-09 09:03:37] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:03:37] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 0 ms to minimize.
[2023-03-09 09:03:38] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 1 ms to minimize.
[2023-03-09 09:03:38] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 0 ms to minimize.
[2023-03-09 09:03:38] [INFO ] Deduced a trap composed of 14 places in 325 ms of which 1 ms to minimize.
[2023-03-09 09:03:39] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:03:39] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 11770 ms
[2023-03-09 09:03:41] [INFO ] After 21953ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 09:03:41] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14000 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 40 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 134272 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134272 steps, saw 67158 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 09:03:59] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 09:03:59] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 09:04:01] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 09:04:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:04:07] [INFO ] After 5843ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 09:04:07] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 1 ms to minimize.
[2023-03-09 09:04:08] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-09 09:04:08] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 1 ms to minimize.
[2023-03-09 09:04:08] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 0 ms to minimize.
[2023-03-09 09:04:08] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2023-03-09 09:04:09] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2023-03-09 09:04:09] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 0 ms to minimize.
[2023-03-09 09:04:09] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2023-03-09 09:04:09] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2023-03-09 09:04:09] [INFO ] Deduced a trap composed of 85 places in 279 ms of which 1 ms to minimize.
[2023-03-09 09:04:10] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 0 ms to minimize.
[2023-03-09 09:04:10] [INFO ] Deduced a trap composed of 48 places in 286 ms of which 1 ms to minimize.
[2023-03-09 09:04:11] [INFO ] Deduced a trap composed of 9 places in 364 ms of which 1 ms to minimize.
[2023-03-09 09:04:11] [INFO ] Deduced a trap composed of 27 places in 421 ms of which 1 ms to minimize.
[2023-03-09 09:04:12] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 1 ms to minimize.
[2023-03-09 09:04:12] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 1 ms to minimize.
[2023-03-09 09:04:13] [INFO ] Deduced a trap composed of 18 places in 417 ms of which 1 ms to minimize.
[2023-03-09 09:04:13] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 0 ms to minimize.
[2023-03-09 09:04:13] [INFO ] Deduced a trap composed of 14 places in 393 ms of which 1 ms to minimize.
[2023-03-09 09:04:14] [INFO ] Deduced a trap composed of 82 places in 332 ms of which 0 ms to minimize.
[2023-03-09 09:04:15] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 1 ms to minimize.
[2023-03-09 09:04:15] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7800 ms
[2023-03-09 09:04:15] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 1 ms to minimize.
[2023-03-09 09:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2023-03-09 09:04:17] [INFO ] After 16117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1064 ms.
[2023-03-09 09:04:18] [INFO ] After 18715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 09:04:26] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 09:04:27] [INFO ] Implicit Places using invariants in 788 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-09 09:04:27] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 09:04:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:04:52] [INFO ] Implicit Places using invariants and state equation in 24548 ms returned [154, 284, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 470, 476]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 25338 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 463 transition count 449
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 457 transition count 449
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 457 transition count 449
Applied a total of 15 rules in 30 ms. Remains 457 /463 variables (removed 6) and now considering 449/455 (removed 6) transitions.
// Phase 1: matrix 449 rows 457 cols
[2023-03-09 09:04:52] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 09:04:52] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 449 rows 457 cols
[2023-03-09 09:04:52] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 09:04:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:05:18] [INFO ] Implicit Places using invariants and state equation in 25854 ms returned [42, 68, 287, 308, 313]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 26487 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 452/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 452 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 450 transition count 447
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 450 transition count 447
Applied a total of 6 rules in 33 ms. Remains 450 /452 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 450 cols
[2023-03-09 09:05:18] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:05:19] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 447 rows 450 cols
[2023-03-09 09:05:19] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:05:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:05:49] [INFO ] Performed 435/450 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 09:05:50] [INFO ] Implicit Places using invariants and state equation in 31183 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31752 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 449/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 446
Applied a total of 2 rules in 21 ms. Remains 448 /449 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-09 09:05:50] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 09:05:50] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-09 09:05:50] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 09:05:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:06:08] [INFO ] Implicit Places using invariants and state equation in 17534 ms returned [196, 223, 228, 251]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 18027 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 444/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 445
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 443 transition count 445
Applied a total of 4 rules in 30 ms. Remains 443 /444 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 443 cols
[2023-03-09 09:06:08] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 09:06:09] [INFO ] Implicit Places using invariants in 850 ms returned []
// Phase 1: matrix 445 rows 443 cols
[2023-03-09 09:06:09] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-09 09:06:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 09:06:38] [INFO ] Implicit Places using invariants and state equation in 29290 ms returned []
Implicit Place search using SMT with State Equation took 30142 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 443/478 places, 445/455 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 131871 ms. Remains : 443/478 places, 445/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p2)), (X (OR (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) p2))), (X (X (OR (NOT p0) (NOT p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 2834 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 460 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 446 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 455 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 34083 reset in 746 ms.
Product exploration explored 100000 steps with 34127 reset in 479 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 8 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:06:44] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 09:06:44] [INFO ] Implicit Places using invariants in 613 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:06:44] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 09:06:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 09:07:11] [INFO ] Implicit Places using invariants and state equation in 26804 ms returned []
Implicit Place search using SMT with State Equation took 27418 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-09 09:07:11] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-09 09:07:12] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28187 ms. Remains : 557/557 places, 534/534 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 459549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : DoubleExponent-PT-020-LTLFireability-12
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 479 place count 816 transition count 715
Deduced a syphon composed of 41 places in 15 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 6 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 147 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-09 09:07:13] [INFO ] Computed 99 place invariants in 91 ms
[2023-03-09 09:07:13] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-09 09:07:13] [INFO ] Invariant cache hit.
[2023-03-09 09:07:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 09:07:44] [INFO ] Performed 291/554 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:08:15] [INFO ] Performed 517/554 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2023-03-09 09:08:20] [INFO ] Implicit Places using invariants and state equation in 66874 ms returned []
Implicit Place search using SMT with State Equation took 67867 ms to find 0 implicit places.
[2023-03-09 09:08:20] [INFO ] Invariant cache hit.
[2023-03-09 09:08:21] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 68694 ms. Remains : 554/1057 places, 532/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s344 1) (LT s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 315 ms.
Product exploration explored 100000 steps with 20000 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1368 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 816 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 287539 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287539 steps, saw 143819 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:08:25] [INFO ] Invariant cache hit.
[2023-03-09 09:08:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 09:08:25] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 60 ms returned sat
[2023-03-09 09:08:26] [INFO ] After 744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:08:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 09:08:26] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 90 ms returned sat
[2023-03-09 09:08:27] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:08:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 09:08:27] [INFO ] After 801ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:08:28] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 1 ms to minimize.
[2023-03-09 09:08:28] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 1 ms to minimize.
[2023-03-09 09:08:28] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 1 ms to minimize.
[2023-03-09 09:08:28] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 1 ms to minimize.
[2023-03-09 09:08:29] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2023-03-09 09:08:29] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 1 ms to minimize.
[2023-03-09 09:08:29] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 0 ms to minimize.
[2023-03-09 09:08:30] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2023-03-09 09:08:30] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2023-03-09 09:08:30] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 1 ms to minimize.
[2023-03-09 09:08:31] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 0 ms to minimize.
[2023-03-09 09:08:31] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 1 ms to minimize.
[2023-03-09 09:08:31] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2023-03-09 09:08:32] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2023-03-09 09:08:32] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 1 ms to minimize.
[2023-03-09 09:08:32] [INFO ] Deduced a trap composed of 55 places in 303 ms of which 1 ms to minimize.
[2023-03-09 09:08:33] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 1 ms to minimize.
[2023-03-09 09:08:33] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 1 ms to minimize.
[2023-03-09 09:08:33] [INFO ] Deduced a trap composed of 18 places in 340 ms of which 2 ms to minimize.
[2023-03-09 09:08:34] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:08:34] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 1 ms to minimize.
[2023-03-09 09:08:35] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-09 09:08:35] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7261 ms
[2023-03-09 09:08:35] [INFO ] After 8117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-09 09:08:35] [INFO ] After 9219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 764 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1662 edges and 554 vertex of which 553 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 476 transition count 454
Applied a total of 236 rules in 42 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1304 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 833 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 340114 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340114 steps, saw 170150 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 09:08:39] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 09:08:40] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:08:40] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:08:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:08:41] [INFO ] After 939ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:08:41] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2023-03-09 09:08:41] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2023-03-09 09:08:42] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 1 ms to minimize.
[2023-03-09 09:08:42] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 1 ms to minimize.
[2023-03-09 09:08:42] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 1 ms to minimize.
[2023-03-09 09:08:43] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 1 ms to minimize.
[2023-03-09 09:08:43] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 0 ms to minimize.
[2023-03-09 09:08:43] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 1 ms to minimize.
[2023-03-09 09:08:43] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 0 ms to minimize.
[2023-03-09 09:08:44] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 1 ms to minimize.
[2023-03-09 09:08:44] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2023-03-09 09:08:45] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2023-03-09 09:08:45] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 3 ms to minimize.
[2023-03-09 09:08:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3927 ms
[2023-03-09 09:08:45] [INFO ] After 4927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-09 09:08:45] [INFO ] After 5667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1236 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 16 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 09:08:46] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 09:08:47] [INFO ] Implicit Places using invariants in 978 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 09:08:48] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-09 09:08:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:09:18] [INFO ] Performed 422/476 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:09:22] [INFO ] Implicit Places using invariants and state equation in 34762 ms returned [447]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 35743 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 475/476 places, 454/454 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 454
Applied a total of 1 rules in 23 ms. Remains 475 /475 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 475 cols
[2023-03-09 09:09:22] [INFO ] Computed 98 place invariants in 56 ms
[2023-03-09 09:09:25] [INFO ] Implicit Places using invariants in 2681 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 308, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 450, 467, 473]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 2683 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 438/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 438 transition count 435
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 419 transition count 435
Applied a total of 38 rules in 25 ms. Remains 419 /438 variables (removed 19) and now considering 435/454 (removed 19) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 09:09:25] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 09:09:26] [INFO ] Implicit Places using invariants in 628 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 09:09:26] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 09:09:26] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:09:41] [INFO ] Implicit Places using invariants and state equation in 15921 ms returned []
Implicit Place search using SMT with State Equation took 16551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55039 ms. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1450 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 897 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 349279 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349279 steps, saw 174675 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 09:09:45] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:09:45] [INFO ] After 708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:09:46] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:09:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:09:47] [INFO ] After 986ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:09:47] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2023-03-09 09:09:47] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2023-03-09 09:09:48] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 1 ms to minimize.
[2023-03-09 09:09:48] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 1 ms to minimize.
[2023-03-09 09:09:48] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2023-03-09 09:09:49] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
[2023-03-09 09:09:49] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2023-03-09 09:09:49] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 1 ms to minimize.
[2023-03-09 09:09:49] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 1 ms to minimize.
[2023-03-09 09:09:50] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 1 ms to minimize.
[2023-03-09 09:09:50] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 1 ms to minimize.
[2023-03-09 09:09:51] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 1 ms to minimize.
[2023-03-09 09:09:51] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 1 ms to minimize.
[2023-03-09 09:09:52] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-09 09:09:52] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2023-03-09 09:09:52] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 0 ms to minimize.
[2023-03-09 09:09:52] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2023-03-09 09:09:52] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5137 ms
[2023-03-09 09:09:52] [INFO ] After 6189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-09 09:09:53] [INFO ] After 7466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 971 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 09:09:54] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:09:54] [INFO ] Implicit Places using invariants in 645 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 09:09:54] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 09:09:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:10:23] [INFO ] Implicit Places using invariants and state equation in 28263 ms returned []
Implicit Place search using SMT with State Equation took 28910 ms to find 0 implicit places.
[2023-03-09 09:10:23] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-09 09:10:23] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:10:23] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29272 ms. Remains : 419/419 places, 435/435 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 14 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-09 09:10:24] [INFO ] Computed 99 place invariants in 94 ms
[2023-03-09 09:10:25] [INFO ] Implicit Places using invariants in 985 ms returned []
[2023-03-09 09:10:25] [INFO ] Invariant cache hit.
[2023-03-09 09:10:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 09:10:55] [INFO ] Performed 330/554 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:11:22] [INFO ] Implicit Places using invariants and state equation in 57384 ms returned []
Implicit Place search using SMT with State Equation took 58371 ms to find 0 implicit places.
[2023-03-09 09:11:22] [INFO ] Invariant cache hit.
[2023-03-09 09:11:23] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58970 ms. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265877 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265877 steps, saw 132976 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:11:26] [INFO ] Invariant cache hit.
[2023-03-09 09:11:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 09:11:26] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 61 ms returned sat
[2023-03-09 09:11:27] [INFO ] After 852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:11:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 09:11:27] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 89 ms returned sat
[2023-03-09 09:11:28] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:11:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 09:11:29] [INFO ] After 814ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:11:29] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2023-03-09 09:11:29] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 1 ms to minimize.
[2023-03-09 09:11:29] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 1 ms to minimize.
[2023-03-09 09:11:30] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 1 ms to minimize.
[2023-03-09 09:11:30] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 1 ms to minimize.
[2023-03-09 09:11:30] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 1 ms to minimize.
[2023-03-09 09:11:31] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 1 ms to minimize.
[2023-03-09 09:11:31] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 1 ms to minimize.
[2023-03-09 09:11:31] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 1 ms to minimize.
[2023-03-09 09:11:32] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 1 ms to minimize.
[2023-03-09 09:11:32] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 1 ms to minimize.
[2023-03-09 09:11:32] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2023-03-09 09:11:33] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 1 ms to minimize.
[2023-03-09 09:11:33] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 1 ms to minimize.
[2023-03-09 09:11:33] [INFO ] Deduced a trap composed of 51 places in 308 ms of which 1 ms to minimize.
[2023-03-09 09:11:34] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 1 ms to minimize.
[2023-03-09 09:11:34] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2023-03-09 09:11:34] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 1 ms to minimize.
[2023-03-09 09:11:35] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 1 ms to minimize.
[2023-03-09 09:11:35] [INFO ] Deduced a trap composed of 14 places in 344 ms of which 1 ms to minimize.
[2023-03-09 09:11:36] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 1 ms to minimize.
[2023-03-09 09:11:36] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 1 ms to minimize.
[2023-03-09 09:11:36] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7353 ms
[2023-03-09 09:11:36] [INFO ] After 8222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-09 09:11:36] [INFO ] After 9367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 814 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1662 edges and 554 vertex of which 553 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.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 476 transition count 454
Applied a total of 236 rules in 42 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1276 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 817 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 338120 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338120 steps, saw 169154 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 09:11:40] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 09:11:41] [INFO ] After 742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:11:42] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:11:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:11:43] [INFO ] After 1004ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:11:43] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2023-03-09 09:11:43] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-09 09:11:44] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 1 ms to minimize.
[2023-03-09 09:11:44] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2023-03-09 09:11:44] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 1 ms to minimize.
[2023-03-09 09:11:44] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 1 ms to minimize.
[2023-03-09 09:11:45] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2023-03-09 09:11:45] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 1 ms to minimize.
[2023-03-09 09:11:45] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 1 ms to minimize.
[2023-03-09 09:11:46] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 0 ms to minimize.
[2023-03-09 09:11:46] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2023-03-09 09:11:47] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 1 ms to minimize.
[2023-03-09 09:11:47] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 1 ms to minimize.
[2023-03-09 09:11:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4132 ms
[2023-03-09 09:11:47] [INFO ] After 5196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-09 09:11:47] [INFO ] After 6235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1057 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 09:11:48] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 09:11:49] [INFO ] Implicit Places using invariants in 911 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-09 09:11:49] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 09:11:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:12:11] [INFO ] Implicit Places using invariants and state equation in 21757 ms returned [42, 68, 99, 125, 146, 151, 172, 177, 198, 204, 225, 230, 282, 308, 314, 335, 340, 361, 367, 388, 390, 414, 442, 447, 451, 468, 474]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 22670 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 449/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 449 transition count 445
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 445
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 27 place count 440 transition count 445
Applied a total of 27 rules in 51 ms. Remains 440 /449 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 440 cols
[2023-03-09 09:12:11] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-09 09:12:12] [INFO ] Implicit Places using invariants in 972 ms returned []
// Phase 1: matrix 445 rows 440 cols
[2023-03-09 09:12:12] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 09:12:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:12:33] [INFO ] Implicit Places using invariants and state equation in 21377 ms returned [199, 244, 367, 392]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 22351 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 436/476 places, 445/454 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 442
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 433 transition count 442
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 433 transition count 442
Applied a total of 7 rules in 30 ms. Remains 433 /436 variables (removed 3) and now considering 442/445 (removed 3) transitions.
// Phase 1: matrix 442 rows 433 cols
[2023-03-09 09:12:33] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 09:12:34] [INFO ] Implicit Places using invariants in 897 ms returned []
// Phase 1: matrix 442 rows 433 cols
[2023-03-09 09:12:34] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 09:12:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:12:43] [INFO ] Implicit Places using invariants and state equation in 8843 ms returned []
Implicit Place search using SMT with State Equation took 9742 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/476 places, 442/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 54856 ms. Remains : 433/476 places, 442/454 transitions.
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347758 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 347758 steps, saw 173911 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 433 cols
[2023-03-09 09:12:46] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 09:12:47] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:12:48] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:12:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:12:49] [INFO ] After 1142ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:12:49] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2023-03-09 09:12:49] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 0 ms to minimize.
[2023-03-09 09:12:49] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 1 ms to minimize.
[2023-03-09 09:12:50] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 0 ms to minimize.
[2023-03-09 09:12:50] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 1 ms to minimize.
[2023-03-09 09:12:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1598 ms
[2023-03-09 09:12:50] [INFO ] After 2780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-09 09:12:51] [INFO ] After 3660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 472 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 442/442 transitions.
Applied a total of 0 rules in 17 ms. Remains 433 /433 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 433/433 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 442/442 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 433 cols
[2023-03-09 09:12:51] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-09 09:12:52] [INFO ] Implicit Places using invariants in 917 ms returned []
// Phase 1: matrix 442 rows 433 cols
[2023-03-09 09:12:52] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 09:12:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-09 09:12:59] [INFO ] Implicit Places using invariants and state equation in 7375 ms returned []
Implicit Place search using SMT with State Equation took 8294 ms to find 0 implicit places.
[2023-03-09 09:12:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 442 rows 433 cols
[2023-03-09 09:12:59] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 09:13:00] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8930 ms. Remains : 433/433 places, 442/442 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 433 transition count 405
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 396 transition count 405
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 86 place count 384 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 98 place count 384 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 383 transition count 392
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 383 transition count 390
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 104 place count 381 transition count 390
Applied a total of 104 rules in 39 ms. Remains 381 /433 variables (removed 52) and now considering 390/442 (removed 52) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 390 rows 381 cols
[2023-03-09 09:13:00] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 09:13:01] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:13:01] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:13:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:13:01] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:13:02] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 1 ms to minimize.
[2023-03-09 09:13:02] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2023-03-09 09:13:02] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 1 ms to minimize.
[2023-03-09 09:13:02] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2023-03-09 09:13:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 967 ms
[2023-03-09 09:13:02] [INFO ] After 1036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-09 09:13:02] [INFO ] After 1847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 541 ms.
Product exploration explored 100000 steps with 20000 reset in 389 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 21 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-09 09:13:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 09:13:05] [INFO ] Invariant cache hit.
[2023-03-09 09:13:05] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 851 ms. Remains : 554/554 places, 532/532 transitions.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 14 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-09 09:13:05] [INFO ] Invariant cache hit.
[2023-03-09 09:13:06] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-09 09:13:06] [INFO ] Invariant cache hit.
[2023-03-09 09:13:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 09:13:37] [INFO ] Performed 187/554 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:14:07] [INFO ] Performed 500/554 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-09 09:14:17] [INFO ] Implicit Places using invariants and state equation in 70811 ms returned []
Implicit Place search using SMT with State Equation took 71676 ms to find 0 implicit places.
[2023-03-09 09:14:17] [INFO ] Invariant cache hit.
[2023-03-09 09:14:18] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72215 ms. Remains : 554/554 places, 532/532 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 425705 ms.
[2023-03-09 09:14:18] [INFO ] Flatten gal took : 91 ms
[2023-03-09 09:14:18] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 09:14:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1057 places, 997 transitions and 2802 arcs took 13 ms.
Total runtime 3315383 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-020
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability
FORMULA DoubleExponent-PT-020-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678353355264
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-020-LTLFireability-07
lola: time limit : 719 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/719 7/32 DoubleExponent-PT-020-LTLFireability-07 507258 m, 101451 m/sec, 594551 t fired, .
Time elapsed: 6 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/719 14/32 DoubleExponent-PT-020-LTLFireability-07 1035219 m, 105592 m/sec, 1213369 t fired, .
Time elapsed: 11 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/719 21/32 DoubleExponent-PT-020-LTLFireability-07 1577611 m, 108478 m/sec, 1849112 t fired, .
Time elapsed: 16 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/719 27/32 DoubleExponent-PT-020-LTLFireability-07 2071891 m, 98856 m/sec, 2428653 t fired, .
Time elapsed: 21 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for DoubleExponent-PT-020-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 DoubleExponent-PT-020-LTLFireability-12
lola: time limit : 893 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for DoubleExponent-PT-020-LTLFireability-12
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DoubleExponent-PT-020-LTLFireability-08
lola: time limit : 1191 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1191 7/32 DoubleExponent-PT-020-LTLFireability-08 541412 m, 108282 m/sec, 598915 t fired, .
Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1191 14/32 DoubleExponent-PT-020-LTLFireability-08 1116759 m, 115069 m/sec, 1235441 t fired, .
Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1191 20/32 DoubleExponent-PT-020-LTLFireability-08 1658801 m, 108408 m/sec, 1835081 t fired, .
Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1191 27/32 DoubleExponent-PT-020-LTLFireability-08 2228667 m, 113973 m/sec, 2465509 t fired, .
Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for DoubleExponent-PT-020-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 DoubleExponent-PT-020-LTLFireability-00
lola: time limit : 1774 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1774 10/32 DoubleExponent-PT-020-LTLFireability-00 559557 m, 111911 m/sec, 619017 t fired, .
Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1774 20/32 DoubleExponent-PT-020-LTLFireability-00 1147321 m, 117552 m/sec, 1269225 t fired, .
Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1774 30/32 DoubleExponent-PT-020-LTLFireability-00 1699665 m, 110468 m/sec, 1880308 t fired, .
Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for DoubleExponent-PT-020-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-020-LTLFireability-04
lola: time limit : 3529 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3529 7/32 DoubleExponent-PT-020-LTLFireability-04 522379 m, 104475 m/sec, 616398 t fired, .
Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3529 14/32 DoubleExponent-PT-020-LTLFireability-04 1075008 m, 110525 m/sec, 1268561 t fired, .
Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3529 22/32 DoubleExponent-PT-020-LTLFireability-04 1640379 m, 113074 m/sec, 1935592 t fired, .
Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3529 28/32 DoubleExponent-PT-020-LTLFireability-04 2176908 m, 107305 m/sec, 2568759 t fired, .
Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for DoubleExponent-PT-020-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-020-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLFireability-00: LTL unknown AGGR
DoubleExponent-PT-020-LTLFireability-04: LTL unknown AGGR
DoubleExponent-PT-020-LTLFireability-07: LTL unknown AGGR
DoubleExponent-PT-020-LTLFireability-08: LTL unknown AGGR
DoubleExponent-PT-020-LTLFireability-12: LTL true LTL model checker
Time elapsed: 96 secs. Pages in use: 32
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DoubleExponent-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414500484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;