About the Execution of LoLa+red for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2242.020 | 2516585.00 | 2616476.00 | 8370.10 | ?F?FTTTFTTT?TFFT | 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-167819414500491.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-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414500491
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 6.8K Feb 26 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:31 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 1.8M 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-100-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678359335528
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 10:55:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 10:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 10:55:38] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2023-03-09 10:55:38] [INFO ] Transformed 5304 places.
[2023-03-09 10:55:38] [INFO ] Transformed 4998 transitions.
[2023-03-09 10:55:38] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DoubleExponent-PT-100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1459 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 10:55:42] [INFO ] Invariants computation overflowed in 277 ms
[2023-03-09 10:55:43] [INFO ] Implicit Places using invariants in 1432 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 10:55:43] [INFO ] Invariants computation overflowed in 144 ms
[2023-03-09 10:55:45] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 10:55:45] [INFO ] Invariants computation overflowed in 164 ms
[2023-03-09 10:55:45] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5379 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 43 out of 5300 places after structural reductions.
[2023-03-09 10:55:47] [INFO ] Flatten gal took : 495 ms
[2023-03-09 10:55:47] [INFO ] Flatten gal took : 277 ms
[2023-03-09 10:55:48] [INFO ] Input system was already deterministic with 4998 transitions.
Support contains 41 out of 5300 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 328 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 38592 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{6=1}
Probabilistic random walk after 38592 steps, saw 19303 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :1
Running SMT prover for 27 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 10:55:54] [INFO ] Invariants computation overflowed in 125 ms
[2023-03-09 10:55:58] [INFO ] After 4049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-09 10:56:23] [INFO ] After 19694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-09 10:56:23] [INFO ] After 19707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 10:56:23] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1158 transitions
Trivial Post-agglo rules discarded 1158 transitions
Performed 1158 trivial Post agglomeration. Transition count delta: 1158
Iterating post reduction 0 with 1161 rules applied. Total rules applied 1162 place count 5297 transition count 3838
Reduce places removed 1158 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1177 rules applied. Total rules applied 2339 place count 4139 transition count 3819
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2358 place count 4120 transition count 3819
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 2358 place count 4120 transition count 3615
Deduced a syphon composed of 204 places in 242 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 2766 place count 3916 transition count 3615
Performed 879 Post agglomeration using F-continuation condition.Transition count delta: 879
Deduced a syphon composed of 879 places in 171 ms
Reduce places removed 879 places and 0 transitions.
Iterating global reduction 3 with 1758 rules applied. Total rules applied 4524 place count 3037 transition count 2736
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 94 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4726 place count 2936 transition count 2736
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 76 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 4912 place count 2843 transition count 2736
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4914 place count 2843 transition count 2734
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4916 place count 2841 transition count 2734
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 4 with 397 rules applied. Total rules applied 5313 place count 2841 transition count 2337
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 4 with 397 rules applied. Total rules applied 5710 place count 2444 transition count 2337
Partial Free-agglomeration rule applied 401 times.
Drop transitions removed 401 transitions
Iterating global reduction 5 with 401 rules applied. Total rules applied 6111 place count 2444 transition count 2337
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6112 place count 2443 transition count 2336
Applied a total of 6112 rules in 3271 ms. Remains 2443 /5300 variables (removed 2857) and now considering 2336/4998 (removed 2662) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3273 ms. Remains : 2443/5300 places, 2336/4998 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 59628 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59628 steps, saw 29852 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 2336 rows 2443 cols
[2023-03-09 10:56:31] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 10:56:32] [INFO ] After 1742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-09 10:56:57] [INFO ] After 22647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 10:56:57] [INFO ] State equation strengthened by 381 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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 10:56:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 10:56:57] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 2336/2336 transitions.
Applied a total of 0 rules in 183 ms. Remains 2443 /2443 variables (removed 0) and now considering 2336/2336 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 2443/2443 places, 2336/2336 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 2336/2336 transitions.
Applied a total of 0 rules in 182 ms. Remains 2443 /2443 variables (removed 0) and now considering 2336/2336 (removed 0) transitions.
// Phase 1: matrix 2336 rows 2443 cols
[2023-03-09 10:56:58] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-09 10:57:03] [INFO ] Implicit Places using invariants in 5022 ms returned []
// Phase 1: matrix 2336 rows 2443 cols
[2023-03-09 10:57:03] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 10:57:09] [INFO ] Implicit Places using invariants and state equation in 6002 ms returned []
Implicit Place search using SMT with State Equation took 11027 ms to find 0 implicit places.
[2023-03-09 10:57:09] [INFO ] Redundant transitions in 227 ms returned []
// Phase 1: matrix 2336 rows 2443 cols
[2023-03-09 10:57:09] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 10:57:11] [INFO ] Dead Transitions using invariants and state equation in 2112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13556 ms. Remains : 2443/2443 places, 2336/2336 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2443 transition count 2335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2442 transition count 2335
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 194 Pre rules applied. Total rules applied 2 place count 2442 transition count 2141
Deduced a syphon composed of 194 places in 60 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 390 place count 2248 transition count 2141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 2248 transition count 2139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 394 place count 2246 transition count 2139
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 395 place count 2246 transition count 2138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 396 place count 2245 transition count 2138
Applied a total of 396 rules in 673 ms. Remains 2245 /2443 variables (removed 198) and now considering 2138/2336 (removed 198) transitions.
Running SMT prover for 27 properties.
// Phase 1: matrix 2138 rows 2245 cols
[2023-03-09 10:57:12] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-09 10:57:14] [INFO ] After 1513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-09 10:59:24] [INFO ] After 128712ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :13
[2023-03-09 10:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 11:00:50] [INFO ] After 85702ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :8 sat :10
[2023-03-09 11:00:53] [INFO ] Deduced a trap composed of 5 places in 2403 ms of which 3 ms to minimize.
[2023-03-09 11:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2623 ms
[2023-03-09 11:00:57] [INFO ] Deduced a trap composed of 10 places in 2775 ms of which 3 ms to minimize.
[2023-03-09 11:00:59] [INFO ] Deduced a trap composed of 13 places in 2711 ms of which 2 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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 11:00:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:00:59] [INFO ] After 225847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA DoubleExponent-PT-100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.41 ms
FORMULA DoubleExponent-PT-100-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-14 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(F((p0&&F(G(p1))))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1067 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:01:01] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:01:02] [INFO ] Implicit Places using invariants in 791 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:01:02] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:01:03] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:01:03] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-09 11:01:04] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4135 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 3 s3841) (GT s824 s2912)), p1:(GT 1 s1310)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3325 reset in 467 ms.
Product exploration explored 100000 steps with 3349 reset in 364 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 339 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 301 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 51008 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 51008 steps, saw 25513 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:01:10] [INFO ] Invariants computation overflowed in 128 ms
[2023-03-09 11:01:35] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1202 place count 5297 transition count 3798
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2401 place count 4099 transition count 3797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 247 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 100 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 89 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 69 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 399 times.
Iterating global reduction 3 with 399 rules applied. Total rules applied 5407 place count 2795 transition count 2293
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 3 with 399 rules applied. Total rules applied 5806 place count 2396 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6206 place count 2396 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6207 place count 2395 transition count 2292
Applied a total of 6207 rules in 2818 ms. Remains 2395 /5300 variables (removed 2905) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2823 ms. Remains : 2395/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100960 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100960 steps, saw 50529 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2395 cols
[2023-03-09 11:01:41] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:02:06] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2292/2292 transitions.
Applied a total of 0 rules in 289 ms. Remains 2395 /2395 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 2395/2395 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2292/2292 transitions.
Applied a total of 0 rules in 293 ms. Remains 2395 /2395 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2395 cols
[2023-03-09 11:02:07] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-09 11:02:35] [INFO ] Implicit Places using invariants in 28813 ms returned []
// Phase 1: matrix 2292 rows 2395 cols
[2023-03-09 11:02:35] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:03:04] [INFO ] Implicit Places using invariants and state equation in 28696 ms returned []
Implicit Place search using SMT with State Equation took 57515 ms to find 0 implicit places.
[2023-03-09 11:03:04] [INFO ] Redundant transitions in 226 ms returned []
// Phase 1: matrix 2292 rows 2395 cols
[2023-03-09 11:03:04] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 11:03:08] [INFO ] Dead Transitions using invariants and state equation in 3226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61271 ms. Remains : 2395/2395 places, 2292/2292 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 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 p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 1 out of 5300 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 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2391 place count 4105 transition count 3800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3599
Deduced a syphon composed of 201 places in 237 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 99 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 73 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 70 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 4992 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2804 transition count 2700
Applied a total of 4993 rules in 2172 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:03:10] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 11:03:13] [INFO ] Implicit Places using invariants in 3224 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:03:13] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 11:03:17] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned []
Implicit Place search using SMT with State Equation took 7299 ms to find 0 implicit places.
[2023-03-09 11:03:18] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:03:18] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 11:03:20] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11894 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 35 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1362 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78139 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78139 steps, saw 39078 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:03:23] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 11:03:48] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 68 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 67 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 1152 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1152 ms. Remains : 2398/2804 places, 2294/2700 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95788 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95788 steps, saw 47956 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:03:53] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 11:04:15] [INFO ] After 22560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 287 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 285 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:04:16] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 11:04:44] [INFO ] Implicit Places using invariants in 27770 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:04:44] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 11:05:12] [INFO ] Implicit Places using invariants and state equation in 28504 ms returned []
Implicit Place search using SMT with State Equation took 56277 ms to find 0 implicit places.
[2023-03-09 11:05:12] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:05:12] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:05:15] [INFO ] Dead Transitions using invariants and state equation in 2791 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59482 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13874 reset in 260 ms.
Product exploration explored 100000 steps with 13951 reset in 255 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2804 transition count 2696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2800 transition count 2696
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2799 transition count 2695
Applied a total of 10 rules in 402 ms. Remains 2799 /2804 variables (removed 5) and now considering 2695/2700 (removed 5) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:05:17] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 11:05:20] [INFO ] Implicit Places using invariants in 3677 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:05:20] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-09 11:05:24] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned []
Implicit Place search using SMT with State Equation took 7337 ms to find 0 implicit places.
[2023-03-09 11:05:24] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:05:24] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 11:05:26] [INFO ] Dead Transitions using invariants and state equation in 2568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2804 places, 2695/2700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10401 ms. Remains : 2799/2804 places, 2695/2700 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-00 finished in 267633 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) U X(G(p1))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1079 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:05:28] [INFO ] Invariants computation overflowed in 126 ms
[2023-03-09 11:05:29] [INFO ] Implicit Places using invariants in 783 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:05:29] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-09 11:05:31] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:05:31] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-09 11:05:31] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4262 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s4847 s2802), p0:(AND (GT 1 s579) (LEQ s4847 s2802))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33221 reset in 2672 ms.
Product exploration explored 100000 steps with 33296 reset in 2627 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 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 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 39426 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{1=1}
Probabilistic random walk after 39426 steps, saw 19723 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:05:43] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-09 11:05:44] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 11:05:49] [INFO ] After 4369ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 11:05:50] [INFO ] After 5271ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9290 ms.
[2023-03-09 11:05:59] [INFO ] After 15441ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1280 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1202 place count 5297 transition count 3798
Reduce places removed 1198 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2402 place count 4099 transition count 3796
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 243 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 96 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4614 place count 2992 transition count 2691
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 84 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4816 place count 2891 transition count 2691
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 79 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 5008 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 3 with 398 rules applied. Total rules applied 5406 place count 2795 transition count 2293
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 3 with 398 rules applied. Total rules applied 5804 place count 2397 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6204 place count 2397 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6205 place count 2396 transition count 2292
Applied a total of 6205 rules in 2563 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2563 ms. Remains : 2396/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1290 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 855 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95950 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95950 steps, saw 48035 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:06:06] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:06:06] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:06:18] [INFO ] After 11311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 290 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 296 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:06:18] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:06:46] [INFO ] Implicit Places using invariants in 28132 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:06:46] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 11:07:15] [INFO ] Implicit Places using invariants and state equation in 28711 ms returned []
Implicit Place search using SMT with State Equation took 56844 ms to find 0 implicit places.
[2023-03-09 11:07:15] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:07:15] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:07:19] [INFO ] Dead Transitions using invariants and state equation in 3314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60584 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 198 Pre rules applied. Total rules applied 0 place count 2396 transition count 2094
Deduced a syphon composed of 198 places in 117 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2198 transition count 2094
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 397 place count 2198 transition count 2093
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 398 place count 2197 transition count 2093
Applied a total of 398 rules in 717 ms. Remains 2197 /2396 variables (removed 199) and now considering 2093/2292 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2093 rows 2197 cols
[2023-03-09 11:07:19] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 11:07:20] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:07:22] [INFO ] After 1810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:07:31] [INFO ] After 10994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-09 11:07:31] [INFO ] After 11371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 2 out of 5300 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 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2393 place count 4104 transition count 3799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 234 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 94 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 82 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 74 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2695
Applied a total of 4997 rules in 1798 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:07:34] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-09 11:07:37] [INFO ] Implicit Places using invariants in 3282 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:07:37] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 11:07:41] [INFO ] Implicit Places using invariants and state equation in 4281 ms returned []
Implicit Place search using SMT with State Equation took 7568 ms to find 0 implicit places.
[2023-03-09 11:07:41] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:07:41] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-09 11:07:44] [INFO ] Dead Transitions using invariants and state equation in 3054 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12523 ms. Remains : 2800/5300 places, 2695/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 39 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 797 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78537 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78537 steps, saw 39278 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:07:48] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 11:07:48] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:08:00] [INFO ] After 11434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 2797 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 2797 transition count 2691
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2399 transition count 2294
Applied a total of 1200 rules in 941 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1285 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 879 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98772 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98772 steps, saw 49443 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:08:04] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 11:08:04] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:08:22] [INFO ] After 17700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 292 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 328 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:08:23] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 11:08:53] [INFO ] Performed 2183/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:08:58] [INFO ] Implicit Places using invariants in 34969 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:08:58] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:08:59] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 36033 ms to find 0 implicit places.
[2023-03-09 11:08:59] [INFO ] Redundant transitions in 192 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:08:59] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-09 11:09:02] [INFO ] Dead Transitions using invariants and state equation in 3098 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39661 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 199 places in 170 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2200 transition count 2095
Applied a total of 398 rules in 683 ms. Remains 2200 /2399 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2200 cols
[2023-03-09 11:09:03] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 11:09:03] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:09:53] [INFO ] After 50099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13837 reset in 439 ms.
Product exploration explored 100000 steps with 13784 reset in 350 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2695/2695 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 2800 transition count 2694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2799 transition count 2694
Applied a total of 2 rules in 207 ms. Remains 2799 /2800 variables (removed 1) and now considering 2694/2695 (removed 1) transitions.
// Phase 1: matrix 2694 rows 2799 cols
[2023-03-09 11:09:55] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 11:09:58] [INFO ] Implicit Places using invariants in 3234 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2023-03-09 11:09:58] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 11:10:02] [INFO ] Implicit Places using invariants and state equation in 4206 ms returned []
Implicit Place search using SMT with State Equation took 7442 ms to find 0 implicit places.
[2023-03-09 11:10:02] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2023-03-09 11:10:02] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 11:10:06] [INFO ] Dead Transitions using invariants and state equation in 3383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2800 places, 2694/2695 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11123 ms. Remains : 2799/2800 places, 2694/2695 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-02 finished in 278839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G((F(p1) U X(p2)))))))))'
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1250 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:07] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-09 11:10:08] [INFO ] Implicit Places using invariants in 1018 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:09] [INFO ] Invariants computation overflowed in 174 ms
[2023-03-09 11:10:10] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:10] [INFO ] Invariants computation overflowed in 183 ms
[2023-03-09 11:10:11] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5211 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(LEQ s392 s2074), p1:(LEQ s4257 s4737), p2:(LEQ s2737 s495)], nbAcceptance=1, 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 25000 reset in 2049 ms.
Product exploration explored 100000 steps with 25000 reset in 1752 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 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 p0 p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 323 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 37979 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37979 steps, saw 18994 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:10:22] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-09 11:10:24] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:10:49] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1199 place count 5297 transition count 3801
Reduce places removed 1195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2395 place count 4102 transition count 3800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2396 place count 4101 transition count 3800
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3598
Deduced a syphon composed of 202 places in 232 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 94 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 4598 place count 3000 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 82 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4800 place count 2899 transition count 2699
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 68 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4994 place count 2802 transition count 2699
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 3 with 397 rules applied. Total rules applied 5391 place count 2802 transition count 2302
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 3 with 397 rules applied. Total rules applied 5788 place count 2405 transition count 2302
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 401 times.
Drop transitions removed 401 transitions
Iterating global reduction 4 with 401 rules applied. Total rules applied 6189 place count 2405 transition count 2302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6190 place count 2404 transition count 2301
Applied a total of 6190 rules in 2546 ms. Remains 2404 /5300 variables (removed 2896) and now considering 2301/4998 (removed 2697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2546 ms. Remains : 2404/5300 places, 2301/4998 transitions.
Incomplete random walk after 10000 steps, including 1318 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 69222 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69222 steps, saw 34646 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:10:55] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:10:56] [INFO ] After 824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:11:21] [INFO ] After 23913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 11:11:21] [INFO ] State equation strengthened by 393 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 11:11:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:11:21] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 281 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 273 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:11:22] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:11:52] [INFO ] Performed 1900/2404 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:11:58] [INFO ] Implicit Places using invariants in 36463 ms returned []
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:11:58] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 11:12:29] [INFO ] Performed 1714/2404 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:12:39] [INFO ] Implicit Places using invariants and state equation in 40758 ms returned []
Implicit Place search using SMT with State Equation took 77229 ms to find 0 implicit places.
[2023-03-09 11:12:39] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:12:39] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-09 11:12:43] [INFO ] Dead Transitions using invariants and state equation in 3692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81405 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 536 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1314 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:12:46] [INFO ] Invariants computation overflowed in 136 ms
[2023-03-09 11:12:46] [INFO ] Implicit Places using invariants in 1011 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:12:47] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-09 11:12:48] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:12:48] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-09 11:12:49] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4834 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 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 p0 p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 302 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 37894 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37894 steps, saw 18953 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:12:55] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-09 11:12:57] [INFO ] After 1351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:13:22] [INFO ] After 23180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 11:13:22] [INFO ] After 23187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 11:13:22] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1199 place count 5297 transition count 3801
Reduce places removed 1195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2395 place count 4102 transition count 3800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2396 place count 4101 transition count 3800
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3598
Deduced a syphon composed of 202 places in 248 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 2800 place count 3899 transition count 3598
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 109 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 4598 place count 3000 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 79 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4800 place count 2899 transition count 2699
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 79 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4994 place count 2802 transition count 2699
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 3 with 397 rules applied. Total rules applied 5391 place count 2802 transition count 2302
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 3 with 397 rules applied. Total rules applied 5788 place count 2405 transition count 2302
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 401 times.
Drop transitions removed 401 transitions
Iterating global reduction 4 with 401 rules applied. Total rules applied 6189 place count 2405 transition count 2302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6190 place count 2404 transition count 2301
Applied a total of 6190 rules in 2661 ms. Remains 2404 /5300 variables (removed 2896) and now considering 2301/4998 (removed 2697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2661 ms. Remains : 2404/5300 places, 2301/4998 transitions.
Incomplete random walk after 10000 steps, including 1317 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 60820 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60820 steps, saw 30439 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:13:28] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:13:29] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:13:54] [INFO ] After 24102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 11:13:54] [INFO ] State equation strengthened by 393 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 11:13:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:13:54] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 289 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 2301/2301 transitions.
Applied a total of 0 rules in 473 ms. Remains 2404 /2404 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:13:55] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:14:25] [INFO ] Performed 1802/2404 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:14:34] [INFO ] Implicit Places using invariants in 39123 ms returned []
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:14:34] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-09 11:15:05] [INFO ] Performed 1628/2404 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:15:15] [INFO ] Implicit Places using invariants and state equation in 40872 ms returned []
Implicit Place search using SMT with State Equation took 79998 ms to find 0 implicit places.
[2023-03-09 11:15:15] [INFO ] Redundant transitions in 148 ms returned []
// Phase 1: matrix 2301 rows 2404 cols
[2023-03-09 11:15:15] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 11:15:18] [INFO ] Dead Transitions using invariants and state equation in 3455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84086 ms. Remains : 2404/2404 places, 2301/2301 transitions.
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 460 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 2303 ms.
Product exploration explored 100000 steps with 25000 reset in 1852 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1195 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5300 transition count 4998
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 1195 place count 5300 transition count 5198
Deduced a syphon composed of 1397 places in 471 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 1397 place count 5300 transition count 5198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1398 place count 5299 transition count 5197
Deduced a syphon composed of 1396 places in 275 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 1399 place count 5299 transition count 5197
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: -201
Deduced a syphon composed of 2293 places in 203 ms
Iterating global reduction 1 with 897 rules applied. Total rules applied 2296 place count 5299 transition count 5398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2297 place count 5298 transition count 5396
Deduced a syphon composed of 2292 places in 174 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2298 place count 5298 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -657
Deduced a syphon composed of 2393 places in 269 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2399 place count 5298 transition count 6053
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2500 place count 5197 transition count 5851
Deduced a syphon composed of 2292 places in 266 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2601 place count 5197 transition count 5851
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -624
Deduced a syphon composed of 2390 places in 276 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2699 place count 5197 transition count 6475
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 2797 place count 5099 transition count 6279
Deduced a syphon composed of 2292 places in 277 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2895 place count 5099 transition count 6279
Deduced a syphon composed of 2292 places in 160 ms
Applied a total of 2895 rules in 8366 ms. Remains 5099 /5300 variables (removed 201) and now considering 6279/4998 (removed -1281) transitions.
[2023-03-09 11:15:33] [INFO ] Redundant transitions in 450 ms returned []
// Phase 1: matrix 6279 rows 5099 cols
[2023-03-09 11:15:34] [INFO ] Invariants computation overflowed in 190 ms
[2023-03-09 11:15:34] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5099/5300 places, 6279/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9783 ms. Remains : 5099/5300 places, 6279/4998 transitions.
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1309 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:36] [INFO ] Invariants computation overflowed in 194 ms
[2023-03-09 11:15:37] [INFO ] Implicit Places using invariants in 1036 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:37] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:15:38] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:38] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-09 11:15:39] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4783 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-04 finished in 335131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1&&X((!p0 U (p2||G(!p0)))))))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1327 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:43] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-09 11:15:44] [INFO ] Implicit Places using invariants in 976 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:44] [INFO ] Invariants computation overflowed in 164 ms
[2023-03-09 11:15:45] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:45] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-09 11:15:46] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4887 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s4672 s293), p1:(GT s3243 s4432), p2:(AND (GT s4672 s293) (GT 3 s1771))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3463 ms.
Product exploration explored 100000 steps with 50000 reset in 3469 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (OR (AND p0 (NOT p2)) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLCardinality-06 finished in 12857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p0)))))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1264 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:55] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-09 11:15:56] [INFO ] Implicit Places using invariants in 857 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:56] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-09 11:15:58] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:15:58] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-09 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4298 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LEQ 1 s2877)], 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, null][false, 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-100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-07 finished in 5175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1592 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:01] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-09 11:16:02] [INFO ] Implicit Places using invariants in 944 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:02] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-09 11:16:03] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:04] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-09 11:16:09] [INFO ] Dead Transitions using invariants and state equation in 5497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9642 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1600 s2589)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3860 ms.
Product exploration explored 100000 steps with 50000 reset in 3308 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLCardinality-08 finished in 17536 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 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1461 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:18] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:16:19] [INFO ] Implicit Places using invariants in 973 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:19] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:16:21] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:21] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-09 11:16:22] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4988 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s3627 s1817)], 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]]
Product exploration explored 100000 steps with 3317 reset in 300 ms.
Product exploration explored 100000 steps with 3313 reset in 427 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 276 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 46541 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46541 steps, saw 23275 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:16:28] [INFO ] Invariants computation overflowed in 122 ms
[2023-03-09 11:16:29] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:16:54] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2403 place count 4098 transition count 3796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 359 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 92 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 80 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 75 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 5006 place count 2796 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5007 place count 2796 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5008 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 4 with 398 rules applied. Total rules applied 5406 place count 2795 transition count 2293
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 4 with 398 rules applied. Total rules applied 5804 place count 2397 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 5 with 399 rules applied. Total rules applied 6203 place count 2397 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6204 place count 2396 transition count 2292
Applied a total of 6204 rules in 3325 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3326 ms. Remains : 2396/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1271 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 860 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95701 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95701 steps, saw 47911 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:17:01] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:17:01] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:17:26] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 316 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 312 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:17:27] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:17:57] [INFO ] Performed 2019/2396 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:18:03] [INFO ] Implicit Places using invariants in 35900 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:18:03] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 11:18:33] [INFO ] Performed 2371/2396 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:18:34] [INFO ] Implicit Places using invariants and state equation in 31074 ms returned []
Implicit Place search using SMT with State Equation took 66979 ms to find 0 implicit places.
[2023-03-09 11:18:34] [INFO ] Redundant transitions in 117 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:18:34] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 11:18:36] [INFO ] Dead Transitions using invariants and state equation in 2592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70009 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1273 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:18:38] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-09 11:18:39] [INFO ] Implicit Places using invariants in 784 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:18:39] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-09 11:18:40] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:18:41] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-09 11:18:41] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4315 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 46606 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46606 steps, saw 23307 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:18:46] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-09 11:18:47] [INFO ] After 988ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:19:12] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2403 place count 4098 transition count 3796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 259 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 99 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 82 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 76 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 5006 place count 2796 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5007 place count 2796 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5008 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 4 with 398 rules applied. Total rules applied 5406 place count 2795 transition count 2293
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 4 with 398 rules applied. Total rules applied 5804 place count 2397 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 5 with 399 rules applied. Total rules applied 6203 place count 2397 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6204 place count 2396 transition count 2292
Applied a total of 6204 rules in 3319 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3319 ms. Remains : 2396/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94029 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94029 steps, saw 47074 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:19:19] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:19:19] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:19:44] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 312 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 395 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:19:45] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 11:20:16] [INFO ] Performed 2209/2396 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:20:19] [INFO ] Implicit Places using invariants in 34069 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:20:19] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-09 11:20:20] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 35152 ms to find 0 implicit places.
[2023-03-09 11:20:20] [INFO ] Redundant transitions in 121 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2023-03-09 11:20:20] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 11:20:24] [INFO ] Dead Transitions using invariants and state equation in 3506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39185 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3304 reset in 389 ms.
Product exploration explored 100000 steps with 3335 reset in 421 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1198 place count 5300 transition count 5198
Deduced a syphon composed of 1399 places in 423 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1399 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1401 place count 5298 transition count 5196
Deduced a syphon composed of 1397 places in 271 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1403 place count 5298 transition count 5196
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: -199
Deduced a syphon composed of 2298 places in 218 ms
Iterating global reduction 1 with 901 rules applied. Total rules applied 2304 place count 5298 transition count 5395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5394
Deduced a syphon composed of 2297 places in 171 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5394
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2398 places in 185 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6058
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5856
Deduced a syphon composed of 2297 places in 164 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5856
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -624
Deduced a syphon composed of 2395 places in 174 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2707 place count 5196 transition count 6480
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 2805 place count 5098 transition count 6284
Deduced a syphon composed of 2297 places in 168 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2903 place count 5098 transition count 6284
Deduced a syphon composed of 2297 places in 157 ms
Applied a total of 2903 rules in 7243 ms. Remains 5098 /5300 variables (removed 202) and now considering 6284/4998 (removed -1286) transitions.
[2023-03-09 11:20:33] [INFO ] Redundant transitions in 450 ms returned []
// Phase 1: matrix 6284 rows 5098 cols
[2023-03-09 11:20:34] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-09 11:20:34] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5098/5300 places, 6284/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8513 ms. Remains : 5098/5300 places, 6284/4998 transitions.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1276 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:36] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-09 11:20:36] [INFO ] Implicit Places using invariants in 804 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:36] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-09 11:20:38] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:38] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-09 11:20:39] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4364 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-11 finished in 263434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(X(p1)))) U G(!p0)))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1264 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:42] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-09 11:20:42] [INFO ] Implicit Places using invariants in 785 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:42] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-09 11:20:44] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-09 11:20:44] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-09 11:20:50] [INFO ] Dead Transitions using invariants and state equation in 6246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9743 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 252 ms :[p0, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s1097 s263), p1:(AND (LEQ s1097 s263) (LEQ 1 s1678))], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-13 finished in 10502 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&&F(G(p1))))))'
Found a Shortening insensitive property : DoubleExponent-PT-100-LTLCardinality-00
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2391 place count 4105 transition count 3800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3599
Deduced a syphon composed of 201 places in 376 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 93 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 82 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 67 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 4992 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2804 transition count 2700
Applied a total of 4993 rules in 2594 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:20:54] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:20:57] [INFO ] Implicit Places using invariants in 3705 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:20:57] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 11:21:02] [INFO ] Implicit Places using invariants and state equation in 4366 ms returned []
Implicit Place search using SMT with State Equation took 8085 ms to find 0 implicit places.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:21:02] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-09 11:21:05] [INFO ] Dead Transitions using invariants and state equation in 3426 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14108 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 3 s2033) (GT s439 s1542)), p1:(GT 1 s696)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13916 reset in 381 ms.
Product exploration explored 100000 steps with 13814 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76956 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76956 steps, saw 38491 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:21:10] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-09 11:21:35] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 64 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 102 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 1454 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1455 ms. Remains : 2398/2804 places, 2294/2700 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99296 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99296 steps, saw 49711 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:21:39] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 11:22:01] [INFO ] After 22171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 346 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 429 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:22:02] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 11:22:33] [INFO ] Performed 1685/2398 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:22:42] [INFO ] Implicit Places using invariants in 39463 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:22:42] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:22:43] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 40553 ms to find 0 implicit places.
[2023-03-09 11:22:43] [INFO ] Redundant transitions in 180 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:22:43] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 11:22:46] [INFO ] Dead Transitions using invariants and state equation in 3489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44662 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 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 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 1 out of 2804 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 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 306 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:22:47] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-09 11:22:50] [INFO ] Implicit Places using invariants in 3162 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:22:50] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:22:54] [INFO ] Implicit Places using invariants and state equation in 4096 ms returned []
Implicit Place search using SMT with State Equation took 7264 ms to find 0 implicit places.
[2023-03-09 11:22:55] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:22:55] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:22:58] [INFO ] Dead Transitions using invariants and state equation in 3257 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10928 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 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 32 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1382 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 808 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 69784 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69784 steps, saw 34899 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-09 11:23:01] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:23:26] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 1257 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1257 ms. Remains : 2398/2804 places, 2294/2700 transitions.
Incomplete random walk after 10000 steps, including 1280 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99504 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99504 steps, saw 49823 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:23:31] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 11:23:53] [INFO ] After 22250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 384 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 406 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:23:54] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 11:24:24] [INFO ] Performed 1709/2398 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:24:33] [INFO ] Implicit Places using invariants in 39274 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:24:33] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-09 11:25:04] [INFO ] Performed 1601/2398 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:25:14] [INFO ] Implicit Places using invariants and state equation in 40757 ms returned []
Implicit Place search using SMT with State Equation took 80034 ms to find 0 implicit places.
[2023-03-09 11:25:14] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2023-03-09 11:25:14] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:25:18] [INFO ] Dead Transitions using invariants and state equation in 3677 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84325 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 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 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13821 reset in 347 ms.
Product exploration explored 100000 steps with 13839 reset in 364 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2804 transition count 2696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2800 transition count 2696
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 105 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2799 transition count 2695
Applied a total of 10 rules in 762 ms. Remains 2799 /2804 variables (removed 5) and now considering 2695/2700 (removed 5) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:25:20] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 11:25:23] [INFO ] Implicit Places using invariants in 3275 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:25:23] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-09 11:25:24] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 4292 ms to find 0 implicit places.
[2023-03-09 11:25:24] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-09 11:25:24] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 11:25:28] [INFO ] Dead Transitions using invariants and state equation in 3552 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2804 places, 2695/2700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8704 ms. Remains : 2799/2804 places, 2695/2700 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-00 finished in 277394 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) U X(G(p1))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLCardinality-02
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2393 place count 4104 transition count 3799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 378 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 91 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 84 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 66 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2695
Applied a total of 4997 rules in 2410 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:25:31] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 11:25:34] [INFO ] Implicit Places using invariants in 3525 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:25:34] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 11:25:35] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 4533 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:25:35] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:25:39] [INFO ] Dead Transitions using invariants and state equation in 3446 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10391 ms. Remains : 2800/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s2566 s1478), p0:(AND (GT 1 s307) (LEQ s2566 s1478))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33924 reset in 1513 ms.
Product exploration explored 100000 steps with 34222 reset in 1302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 1381 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 795 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 61204 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{1=1}
Probabilistic random walk after 61204 steps, saw 30610 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:25:46] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 11:25:46] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 11:25:58] [INFO ] After 11787ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 2797 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 2797 transition count 2691
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2399 transition count 2294
Applied a total of 1200 rules in 1013 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1013 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98019 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98019 steps, saw 49068 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:26:02] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 11:26:03] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:26:21] [INFO ] After 18505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 311 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 355 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:26:22] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 11:26:52] [INFO ] Performed 1628/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:27:03] [INFO ] Implicit Places using invariants in 41211 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:27:03] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:27:04] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 42255 ms to find 0 implicit places.
[2023-03-09 11:27:04] [INFO ] Redundant transitions in 169 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:27:04] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 11:27:08] [INFO ] Dead Transitions using invariants and state equation in 3397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46185 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 199 places in 196 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2200 transition count 2095
Applied a total of 398 rules in 757 ms. Remains 2200 /2399 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2200 cols
[2023-03-09 11:27:09] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 11:27:09] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:28:00] [INFO ] After 51074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Support contains 2 out of 2800 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 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 389 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:28:01] [INFO ] Invariants computation overflowed in 87 ms
[2023-03-09 11:28:05] [INFO ] Implicit Places using invariants in 3704 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:28:05] [INFO ] Invariants computation overflowed in 87 ms
[2023-03-09 11:28:09] [INFO ] Implicit Places using invariants and state equation in 4398 ms returned []
Implicit Place search using SMT with State Equation took 8104 ms to find 0 implicit places.
[2023-03-09 11:28:09] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:28:10] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:28:12] [INFO ] Dead Transitions using invariants and state equation in 2929 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11514 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 33 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1358 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79164 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79164 steps, saw 39593 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:28:16] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 11:28:16] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:28:28] [INFO ] After 11467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 2797 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 2797 transition count 2691
Deduced a syphon composed of 1 places in 60 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2399 transition count 2294
Applied a total of 1200 rules in 1200 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1201 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100943 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100943 steps, saw 50539 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:28:32] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 11:28:33] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:28:50] [INFO ] After 17151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 297 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 405 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:28:50] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:29:21] [INFO ] Performed 2058/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:29:27] [INFO ] Implicit Places using invariants in 36386 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:29:27] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:29:58] [INFO ] Performed 1746/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:30:06] [INFO ] Implicit Places using invariants and state equation in 39727 ms returned []
Implicit Place search using SMT with State Equation took 76115 ms to find 0 implicit places.
[2023-03-09 11:30:07] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:30:07] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 11:30:10] [INFO ] Dead Transitions using invariants and state equation in 3387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80096 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13920 reset in 345 ms.
Product exploration explored 100000 steps with 13956 reset in 307 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2695/2695 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 2800 transition count 2694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2799 transition count 2694
Applied a total of 2 rules in 263 ms. Remains 2799 /2800 variables (removed 1) and now considering 2694/2695 (removed 1) transitions.
// Phase 1: matrix 2694 rows 2799 cols
[2023-03-09 11:30:12] [INFO ] Invariants computation overflowed in 84 ms
[2023-03-09 11:30:14] [INFO ] Implicit Places using invariants in 2689 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2023-03-09 11:30:14] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 11:30:15] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
[2023-03-09 11:30:15] [INFO ] Redundant transitions in 108 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2023-03-09 11:30:15] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-09 11:30:18] [INFO ] Dead Transitions using invariants and state equation in 3173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2800 places, 2694/2695 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7077 ms. Remains : 2799/2800 places, 2694/2695 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-02 finished in 290548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G((F(p1) U X(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' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLCardinality-11
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2397 place count 4101 transition count 3798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 237 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 93 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 81 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 76 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4998 place count 2800 transition count 2695
Applied a total of 4998 rules in 2367 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:30:21] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 11:30:25] [INFO ] Implicit Places using invariants in 3464 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:30:25] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 11:30:29] [INFO ] Implicit Places using invariants and state equation in 4217 ms returned []
Implicit Place search using SMT with State Equation took 7683 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:30:29] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:30:32] [INFO ] Dead Transitions using invariants and state equation in 3213 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13264 ms. Remains : 2800/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s1915 s958)], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13866 reset in 230 ms.
Product exploration explored 100000 steps with 13939 reset in 334 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75159 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75159 steps, saw 37585 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:30:37] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:30:37] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:31:02] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8477 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2692
Deduced a syphon composed of 1 places in 69 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 2797 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 1199 place count 2399 transition count 2294
Applied a total of 1199 rules in 1444 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1446 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86149 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86149 steps, saw 43084 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:31:07] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 11:31:07] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:31:32] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 462 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 318 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:31:33] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:32:03] [INFO ] Performed 1629/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:32:13] [INFO ] Implicit Places using invariants in 40502 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:32:13] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 11:32:44] [INFO ] Performed 1666/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:32:54] [INFO ] Implicit Places using invariants and state equation in 40165 ms returned []
Implicit Place search using SMT with State Equation took 80669 ms to find 0 implicit places.
[2023-03-09 11:32:54] [INFO ] Redundant transitions in 160 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:32:54] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 11:32:57] [INFO ] Dead Transitions using invariants and state equation in 3568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84726 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 280 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:32:58] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:33:02] [INFO ] Implicit Places using invariants in 3409 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:33:02] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-09 11:33:06] [INFO ] Implicit Places using invariants and state equation in 4728 ms returned []
Implicit Place search using SMT with State Equation took 8143 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:33:06] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:33:09] [INFO ] Dead Transitions using invariants and state equation in 2897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11322 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1377 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 790 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80796 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80796 steps, saw 40403 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:33:13] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:33:13] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:33:38] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8477 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2692
Deduced a syphon composed of 1 places in 60 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 2797 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 1199 place count 2399 transition count 2294
Applied a total of 1199 rules in 1448 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76741 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76741 steps, saw 38384 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:33:43] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:33:43] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:34:08] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 299 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 306 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:34:09] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:34:39] [INFO ] Performed 1629/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:34:49] [INFO ] Implicit Places using invariants in 40540 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:34:50] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 11:35:20] [INFO ] Performed 1925/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 11:35:26] [INFO ] Implicit Places using invariants and state equation in 36830 ms returned []
Implicit Place search using SMT with State Equation took 77375 ms to find 0 implicit places.
[2023-03-09 11:35:27] [INFO ] Redundant transitions in 194 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2023-03-09 11:35:27] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-09 11:35:31] [INFO ] Dead Transitions using invariants and state equation in 4076 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81969 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13828 reset in 344 ms.
Product exploration explored 100000 steps with 13832 reset in 368 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 391 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2023-03-09 11:35:33] [INFO ] Redundant transitions in 139 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:35:33] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 3494 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4034 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 214 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:35:37] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 11:35:39] [INFO ] Implicit Places using invariants in 2549 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:35:39] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:35:43] [INFO ] Implicit Places using invariants and state equation in 3665 ms returned []
Implicit Place search using SMT with State Equation took 6216 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2023-03-09 11:35:43] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 11:35:45] [INFO ] Dead Transitions using invariants and state equation in 2729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9161 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Treatment of property DoubleExponent-PT-100-LTLCardinality-11 finished in 326998 ms.
[2023-03-09 11:35:46] [INFO ] Flatten gal took : 248 ms
[2023-03-09 11:35:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-09 11:35:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5300 places, 4998 transitions and 14090 arcs took 42 ms.
Total runtime 2408193 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
FORMULA DoubleExponent-PT-100-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678361852113
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-04: LTL 0 0 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 10 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-100-LTLCardinality-04
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DoubleExponent-PT-100-LTLCardinality-04
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DoubleExponent-PT-100-LTLCardinality-11
lola: time limit : 1196 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 4/1196 6/32 DoubleExponent-PT-100-LTLCardinality-11 84917 m, 16983 m/sec, 93900 t fired, .
Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 9/1196 14/32 DoubleExponent-PT-100-LTLCardinality-11 217682 m, 26553 m/sec, 240771 t fired, .
Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 14/1196 22/32 DoubleExponent-PT-100-LTLCardinality-11 358491 m, 28161 m/sec, 396542 t fired, .
Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 19/1196 31/32 DoubleExponent-PT-100-LTLCardinality-11 498549 m, 28011 m/sec, 551491 t fired, .
Time elapsed: 30 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for DoubleExponent-PT-100-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-100-LTLCardinality-02
lola: time limit : 1782 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1782 4/32 DoubleExponent-PT-100-LTLCardinality-02 94274 m, 18854 m/sec, 155370 t fired, .
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1782 7/32 DoubleExponent-PT-100-LTLCardinality-02 191626 m, 19470 m/sec, 316813 t fired, .
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1782 10/32 DoubleExponent-PT-100-LTLCardinality-02 285661 m, 18807 m/sec, 472426 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1782 14/32 DoubleExponent-PT-100-LTLCardinality-02 385176 m, 19903 m/sec, 636904 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1782 17/32 DoubleExponent-PT-100-LTLCardinality-02 484316 m, 19828 m/sec, 801234 t fired, .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1782 20/32 DoubleExponent-PT-100-LTLCardinality-02 583302 m, 19797 m/sec, 964528 t fired, .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1782 23/32 DoubleExponent-PT-100-LTLCardinality-02 677372 m, 18814 m/sec, 1120320 t fired, .
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1782 27/32 DoubleExponent-PT-100-LTLCardinality-02 775699 m, 19665 m/sec, 1283356 t fired, .
Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1782 30/32 DoubleExponent-PT-100-LTLCardinality-02 874946 m, 19849 m/sec, 1447171 t fired, .
Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for DoubleExponent-PT-100-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 DoubleExponent-PT-100-LTLCardinality-00
lola: time limit : 3515 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3515 9/32 DoubleExponent-PT-100-LTLCardinality-00 136820 m, 27364 m/sec, 151338 t fired, .
Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3515 17/32 DoubleExponent-PT-100-LTLCardinality-00 275932 m, 27822 m/sec, 305243 t fired, .
Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3515 26/32 DoubleExponent-PT-100-LTLCardinality-00 417017 m, 28217 m/sec, 461318 t fired, .
Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for DoubleExponent-PT-100-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-100-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
DoubleExponent-PT-100-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-100-LTLCardinality-00: LTL unknown AGGR
DoubleExponent-PT-100-LTLCardinality-02: LTL unknown AGGR
DoubleExponent-PT-100-LTLCardinality-04: LTL true LTL model checker
DoubleExponent-PT-100-LTLCardinality-11: LTL unknown AGGR
Time elapsed: 105 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-100"
export BK_EXAMINATION="LTLCardinality"
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-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414500491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;