About the Execution of ITS-Tools for ShieldPPPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3405.676 | 656248.00 | 973077.00 | 7488.20 | FTFFFFTTTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025600667.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600667
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 762K May 10 09:34 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 ShieldPPPt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653028937710
Running Version 202205111006
[2022-05-20 06:42:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 06:42:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 06:42:19] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-05-20 06:42:19] [INFO ] Transformed 3123 places.
[2022-05-20 06:42:19] [INFO ] Transformed 2843 transitions.
[2022-05-20 06:42:19] [INFO ] Found NUPN structural information;
[2022-05-20 06:42:19] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 430 places :
Symmetric choice reduction at 0 with 430 rule applications. Total rules 430 place count 2693 transition count 2413
Iterating global reduction 0 with 430 rules applied. Total rules applied 860 place count 2693 transition count 2413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 861 place count 2692 transition count 2412
Iterating global reduction 0 with 1 rules applied. Total rules applied 862 place count 2692 transition count 2412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 863 place count 2691 transition count 2411
Iterating global reduction 0 with 1 rules applied. Total rules applied 864 place count 2691 transition count 2411
Applied a total of 864 rules in 1480 ms. Remains 2691 /3123 variables (removed 432) and now considering 2411/2843 (removed 432) transitions.
// Phase 1: matrix 2411 rows 2691 cols
[2022-05-20 06:42:21] [INFO ] Computed 441 place invariants in 41 ms
[2022-05-20 06:42:22] [INFO ] Implicit Places using invariants in 1048 ms returned []
// Phase 1: matrix 2411 rows 2691 cols
[2022-05-20 06:42:22] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-20 06:42:24] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 3454 ms to find 0 implicit places.
// Phase 1: matrix 2411 rows 2691 cols
[2022-05-20 06:42:24] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2691/3123 places, 2411/2843 transitions.
Finished structural reductions, in 1 iterations. Remains : 2691/3123 places, 2411/2843 transitions.
Support contains 34 out of 2691 places after structural reductions.
[2022-05-20 06:42:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 06:42:26] [INFO ] Flatten gal took : 184 ms
[2022-05-20 06:42:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 06:42:26] [INFO ] Flatten gal took : 105 ms
[2022-05-20 06:42:26] [INFO ] Input system was already deterministic with 2411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2411 rows 2691 cols
[2022-05-20 06:42:27] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:42:28] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 06:42:28] [INFO ] [Nat]Absence check using 441 positive place invariants in 156 ms returned sat
[2022-05-20 06:42:30] [INFO ] After 1772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 06:42:31] [INFO ] Deduced a trap composed of 19 places in 604 ms of which 7 ms to minimize.
[2022-05-20 06:42:32] [INFO ] Deduced a trap composed of 21 places in 586 ms of which 3 ms to minimize.
[2022-05-20 06:42:32] [INFO ] Deduced a trap composed of 21 places in 545 ms of which 1 ms to minimize.
[2022-05-20 06:42:33] [INFO ] Deduced a trap composed of 17 places in 527 ms of which 4 ms to minimize.
[2022-05-20 06:42:34] [INFO ] Deduced a trap composed of 19 places in 517 ms of which 1 ms to minimize.
[2022-05-20 06:42:34] [INFO ] Deduced a trap composed of 19 places in 532 ms of which 2 ms to minimize.
[2022-05-20 06:42:35] [INFO ] Deduced a trap composed of 27 places in 519 ms of which 2 ms to minimize.
[2022-05-20 06:42:36] [INFO ] Deduced a trap composed of 22 places in 532 ms of which 1 ms to minimize.
[2022-05-20 06:42:36] [INFO ] Deduced a trap composed of 18 places in 512 ms of which 2 ms to minimize.
[2022-05-20 06:42:37] [INFO ] Deduced a trap composed of 30 places in 506 ms of which 1 ms to minimize.
[2022-05-20 06:42:37] [INFO ] Deduced a trap composed of 17 places in 478 ms of which 2 ms to minimize.
[2022-05-20 06:42:38] [INFO ] Deduced a trap composed of 20 places in 467 ms of which 1 ms to minimize.
[2022-05-20 06:42:38] [INFO ] Deduced a trap composed of 22 places in 451 ms of which 1 ms to minimize.
[2022-05-20 06:42:39] [INFO ] Deduced a trap composed of 31 places in 437 ms of which 1 ms to minimize.
[2022-05-20 06:42:39] [INFO ] Deduced a trap composed of 17 places in 419 ms of which 1 ms to minimize.
[2022-05-20 06:42:40] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 2 ms to minimize.
[2022-05-20 06:42:40] [INFO ] Deduced a trap composed of 30 places in 413 ms of which 1 ms to minimize.
[2022-05-20 06:42:41] [INFO ] Deduced a trap composed of 34 places in 412 ms of which 1 ms to minimize.
[2022-05-20 06:42:41] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 1 ms to minimize.
[2022-05-20 06:42:42] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 1 ms to minimize.
[2022-05-20 06:42:42] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 1 ms to minimize.
[2022-05-20 06:42:43] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 2 ms to minimize.
[2022-05-20 06:42:43] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 1 ms to minimize.
[2022-05-20 06:42:44] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 1 ms to minimize.
[2022-05-20 06:42:44] [INFO ] Deduced a trap composed of 26 places in 348 ms of which 0 ms to minimize.
[2022-05-20 06:42:45] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 1 ms to minimize.
[2022-05-20 06:42:45] [INFO ] Deduced a trap composed of 29 places in 327 ms of which 1 ms to minimize.
[2022-05-20 06:42:45] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 1 ms to minimize.
[2022-05-20 06:42:46] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 1 ms to minimize.
[2022-05-20 06:42:46] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2022-05-20 06:42:47] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 1 ms to minimize.
[2022-05-20 06:42:47] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 1 ms to minimize.
[2022-05-20 06:42:47] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 1 ms to minimize.
[2022-05-20 06:42:48] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2022-05-20 06:42:48] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 1 ms to minimize.
[2022-05-20 06:42:48] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 1 ms to minimize.
[2022-05-20 06:42:49] [INFO ] Deduced a trap composed of 58 places in 275 ms of which 1 ms to minimize.
[2022-05-20 06:42:49] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 1 ms to minimize.
[2022-05-20 06:42:50] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 0 ms to minimize.
[2022-05-20 06:42:50] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 1 ms to minimize.
[2022-05-20 06:42:50] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 2 ms to minimize.
[2022-05-20 06:42:51] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 1 ms to minimize.
[2022-05-20 06:42:51] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2022-05-20 06:42:51] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 0 ms to minimize.
[2022-05-20 06:42:52] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2022-05-20 06:42:52] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2022-05-20 06:42:52] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 1 ms to minimize.
[2022-05-20 06:42:52] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 1 ms to minimize.
[2022-05-20 06:42:53] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 1 ms to minimize.
[2022-05-20 06:42:54] [INFO ] Deduced a trap composed of 12 places in 1335 ms of which 5 ms to minimize.
[2022-05-20 06:42:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 06:42:54] [INFO ] After 26346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 759 ms.
Support contains 15 out of 2691 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 2691 transition count 1856
Reduce places removed 555 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 557 rules applied. Total rules applied 1112 place count 2136 transition count 1854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1114 place count 2134 transition count 1854
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 1114 place count 2134 transition count 1541
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1740 place count 1821 transition count 1541
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1742 place count 1819 transition count 1539
Iterating global reduction 3 with 2 rules applied. Total rules applied 1744 place count 1819 transition count 1539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1744 place count 1819 transition count 1537
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1748 place count 1817 transition count 1537
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 2 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 3 with 1356 rules applied. Total rules applied 3104 place count 1139 transition count 859
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3105 place count 1139 transition count 858
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3107 place count 1138 transition count 857
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3309 place count 1037 transition count 857
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3337 place count 1023 transition count 857
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3339 place count 1023 transition count 855
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3341 place count 1021 transition count 855
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 5 with 117 rules applied. Total rules applied 3458 place count 1021 transition count 855
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3459 place count 1020 transition count 854
Applied a total of 3459 rules in 675 ms. Remains 1020 /2691 variables (removed 1671) and now considering 854/2411 (removed 1557) transitions.
Finished structural reductions, in 1 iterations. Remains : 1020/2691 places, 854/2411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 854 rows 1020 cols
[2022-05-20 06:42:56] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-20 06:42:56] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 06:42:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 58 ms returned sat
[2022-05-20 06:42:57] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 06:42:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-20 06:42:57] [INFO ] After 187ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 06:42:58] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2022-05-20 06:42:58] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2022-05-20 06:42:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2022-05-20 06:42:58] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-05-20 06:42:58] [INFO ] After 1721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 10 out of 1020 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1020/1020 places, 854/854 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 1020 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1019 transition count 853
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1017 transition count 851
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1017 transition count 851
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 1014 transition count 848
Applied a total of 10 rules in 221 ms. Remains 1014 /1020 variables (removed 6) and now considering 848/854 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 1014/1020 places, 848/854 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 104010 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{4=1}
Probabilistic random walk after 104010 steps, saw 86643 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 848 rows 1014 cols
[2022-05-20 06:43:02] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:43:02] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:43:03] [INFO ] [Nat]Absence check using 441 positive place invariants in 64 ms returned sat
[2022-05-20 06:43:03] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 06:43:03] [INFO ] After 150ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:03] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 136 ms.
[2022-05-20 06:43:04] [INFO ] After 1210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1014/1014 places, 848/848 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 1014 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1013 transition count 847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1012 transition count 846
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1011 transition count 846
Applied a total of 6 rules in 73 ms. Remains 1011 /1014 variables (removed 3) and now considering 846/848 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1014 places, 846/848 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107004 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107004 steps, saw 88007 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 846 rows 1011 cols
[2022-05-20 06:43:07] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:43:07] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:43:08] [INFO ] [Nat]Absence check using 441 positive place invariants in 64 ms returned sat
[2022-05-20 06:43:08] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 06:43:08] [INFO ] After 144ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:08] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2022-05-20 06:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-20 06:43:09] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 147 ms.
[2022-05-20 06:43:09] [INFO ] After 1359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 846/846 transitions.
Applied a total of 0 rules in 22 ms. Remains 1011 /1011 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 846/846 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 846/846 transitions.
Applied a total of 0 rules in 30 ms. Remains 1011 /1011 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 1011 cols
[2022-05-20 06:43:09] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:43:09] [INFO ] Implicit Places using invariants in 481 ms returned [1004]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1010/1011 places, 846/846 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1010 transition count 844
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1008 transition count 844
Applied a total of 4 rules in 30 ms. Remains 1008 /1010 variables (removed 2) and now considering 844/846 (removed 2) transitions.
// Phase 1: matrix 844 rows 1008 cols
[2022-05-20 06:43:09] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:43:10] [INFO ] Implicit Places using invariants in 515 ms returned [991, 995]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 517 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1006/1011 places, 844/846 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 842
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 842
Applied a total of 4 rules in 36 ms. Remains 1004 /1006 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:10] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:43:10] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:10] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:43:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:43:11] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1004/1011 places, 842/846 transitions.
Finished structural reductions, in 3 iterations. Remains : 1004/1011 places, 842/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 109067 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109067 steps, saw 89917 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:15] [INFO ] Computed 438 place invariants in 6 ms
[2022-05-20 06:43:15] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:43:15] [INFO ] [Nat]Absence check using 438 positive place invariants in 62 ms returned sat
[2022-05-20 06:43:16] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:43:16] [INFO ] After 134ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:16] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-05-20 06:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-20 06:43:16] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-20 06:43:16] [INFO ] After 1306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 20 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 842/842 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1004/1004 places, 842/842 transitions.
Applied a total of 0 rules in 19 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:17] [INFO ] Computed 438 place invariants in 6 ms
[2022-05-20 06:43:17] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:17] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:43:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:43:18] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
[2022-05-20 06:43:18] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:18] [INFO ] Computed 438 place invariants in 5 ms
[2022-05-20 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 842/842 transitions.
Partial Free-agglomeration rule applied 233 times.
Drop transitions removed 233 transitions
Iterating global reduction 0 with 233 rules applied. Total rules applied 233 place count 1004 transition count 842
Applied a total of 233 rules in 43 ms. Remains 1004 /1004 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 842 rows 1004 cols
[2022-05-20 06:43:19] [INFO ] Computed 438 place invariants in 6 ms
[2022-05-20 06:43:19] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 06:43:19] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:43:20] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:20] [INFO ] State equation strengthened by 231 read => feed constraints.
[2022-05-20 06:43:20] [INFO ] After 316ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:20] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2022-05-20 06:43:20] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2022-05-20 06:43:21] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2022-05-20 06:43:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 702 ms
[2022-05-20 06:43:21] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2022-05-20 06:43:21] [INFO ] After 2220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-20 06:43:21] [INFO ] Flatten gal took : 44 ms
[2022-05-20 06:43:21] [INFO ] Flatten gal took : 41 ms
[2022-05-20 06:43:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15128796737765143987.gal : 24 ms
[2022-05-20 06:43:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6987593306588349014.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9218378181937535775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15128796737765143987.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6987593306588349014.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6987593306588349014.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 67
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :67 after 126
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :126 after 659
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :659 after 15073
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15073 after 925457
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :925457 after 7.93237e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :7.93237e+07 after 4.13656e+08
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.13656e+08 after 5.57482e+11
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5.57482e+11 after 8.67468e+14
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :8.67468e+14 after 2.74714e+18
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :2.74714e+18 after 6.76107e+22
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :6.76107e+22 after 1.94032e+26
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.94032e+26 after 2.84767e+32
Detected timeout of ITS tools.
[2022-05-20 06:43:36] [INFO ] Flatten gal took : 35 ms
[2022-05-20 06:43:36] [INFO ] Applying decomposition
[2022-05-20 06:43:36] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15712304490594828619.txt' '-o' '/tmp/graph15712304490594828619.bin' '-w' '/tmp/graph15712304490594828619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15712304490594828619.bin' '-l' '-1' '-v' '-w' '/tmp/graph15712304490594828619.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:43:36] [INFO ] Decomposing Gal with order
[2022-05-20 06:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:43:37] [INFO ] Removed a total of 215 redundant transitions.
[2022-05-20 06:43:37] [INFO ] Flatten gal took : 95 ms
[2022-05-20 06:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 22 ms.
[2022-05-20 06:43:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18333504756035937938.gal : 10 ms
[2022-05-20 06:43:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6668122780510972974.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9218378181937535775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18333504756035937938.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6668122780510972974.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality6668122780510972974.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8454004241269789975
[2022-05-20 06:43:52] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8454004241269789975
Running compilation step : cd /tmp/ltsmin8454004241269789975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2361 ms.
Running link step : cd /tmp/ltsmin8454004241269789975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8454004241269789975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 640 stabilizing places and 640 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!F((p0 U p1)) U X((G(p0) U p2))))))'
Support contains 5 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2685 transition count 2405
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2685 transition count 2405
Applied a total of 12 rules in 278 ms. Remains 2685 /2691 variables (removed 6) and now considering 2405/2411 (removed 6) transitions.
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:07] [INFO ] Computed 441 place invariants in 20 ms
[2022-05-20 06:44:08] [INFO ] Implicit Places using invariants in 815 ms returned []
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:08] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:44:11] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:11] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:44:12] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2685/2691 places, 2405/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2685/2691 places, 2405/2411 transitions.
Stuttering acceptance computed with spot in 471 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0), p1, (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s1333 0) (EQ s1134 1)), p2:(OR (EQ s2332 0) (EQ s547 1)), p0:(EQ s2373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1198 ms.
Product exploration explored 100000 steps with 25000 reset in 1175 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 321 ms. Reduced automaton from 9 states, 22 edges and 3 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:16] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:44:16] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:44:17] [INFO ] [Nat]Absence check using 441 positive place invariants in 149 ms returned sat
[2022-05-20 06:44:18] [INFO ] After 1236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:44:18] [INFO ] Deduced a trap composed of 17 places in 440 ms of which 1 ms to minimize.
[2022-05-20 06:44:19] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 1 ms to minimize.
[2022-05-20 06:44:19] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 1 ms to minimize.
[2022-05-20 06:44:20] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 1 ms to minimize.
[2022-05-20 06:44:20] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 1 ms to minimize.
[2022-05-20 06:44:21] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 1 ms to minimize.
[2022-05-20 06:44:21] [INFO ] Deduced a trap composed of 17 places in 390 ms of which 2 ms to minimize.
[2022-05-20 06:44:22] [INFO ] Deduced a trap composed of 20 places in 388 ms of which 1 ms to minimize.
[2022-05-20 06:44:22] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 1 ms to minimize.
[2022-05-20 06:44:23] [INFO ] Deduced a trap composed of 20 places in 365 ms of which 1 ms to minimize.
[2022-05-20 06:44:23] [INFO ] Deduced a trap composed of 21 places in 372 ms of which 1 ms to minimize.
[2022-05-20 06:44:24] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 1 ms to minimize.
[2022-05-20 06:44:24] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 1 ms to minimize.
[2022-05-20 06:44:24] [INFO ] Deduced a trap composed of 34 places in 346 ms of which 1 ms to minimize.
[2022-05-20 06:44:25] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 1 ms to minimize.
[2022-05-20 06:44:25] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 0 ms to minimize.
[2022-05-20 06:44:26] [INFO ] Deduced a trap composed of 27 places in 381 ms of which 1 ms to minimize.
[2022-05-20 06:44:26] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 1 ms to minimize.
[2022-05-20 06:44:27] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 1 ms to minimize.
[2022-05-20 06:44:27] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 1 ms to minimize.
[2022-05-20 06:44:28] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 1 ms to minimize.
[2022-05-20 06:44:28] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2022-05-20 06:44:28] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 1 ms to minimize.
[2022-05-20 06:44:29] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 2 ms to minimize.
[2022-05-20 06:44:29] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 1 ms to minimize.
[2022-05-20 06:44:29] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 1 ms to minimize.
[2022-05-20 06:44:30] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 1 ms to minimize.
[2022-05-20 06:44:30] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 1 ms to minimize.
[2022-05-20 06:44:31] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 1 ms to minimize.
[2022-05-20 06:44:31] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2022-05-20 06:44:31] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2022-05-20 06:44:32] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 0 ms to minimize.
[2022-05-20 06:44:32] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 1 ms to minimize.
[2022-05-20 06:44:32] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 1 ms to minimize.
[2022-05-20 06:44:33] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 1 ms to minimize.
[2022-05-20 06:44:33] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 0 ms to minimize.
[2022-05-20 06:44:33] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 1 ms to minimize.
[2022-05-20 06:44:34] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 1 ms to minimize.
[2022-05-20 06:44:34] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 1 ms to minimize.
[2022-05-20 06:44:34] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2022-05-20 06:44:35] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 0 ms to minimize.
[2022-05-20 06:44:35] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 0 ms to minimize.
[2022-05-20 06:44:35] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 0 ms to minimize.
[2022-05-20 06:44:36] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 1 ms to minimize.
[2022-05-20 06:44:36] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 1 ms to minimize.
[2022-05-20 06:44:36] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 1 ms to minimize.
[2022-05-20 06:44:36] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 1 ms to minimize.
[2022-05-20 06:44:37] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 1 ms to minimize.
[2022-05-20 06:44:37] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2022-05-20 06:44:37] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 1 ms to minimize.
[2022-05-20 06:44:37] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 0 ms to minimize.
[2022-05-20 06:44:38] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 0 ms to minimize.
[2022-05-20 06:44:38] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2022-05-20 06:44:38] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 0 ms to minimize.
[2022-05-20 06:44:38] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2022-05-20 06:44:39] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 0 ms to minimize.
[2022-05-20 06:44:39] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2022-05-20 06:44:39] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2022-05-20 06:44:39] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 0 ms to minimize.
[2022-05-20 06:44:40] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 0 ms to minimize.
[2022-05-20 06:44:40] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2022-05-20 06:44:40] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 0 ms to minimize.
[2022-05-20 06:44:40] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 1 ms to minimize.
[2022-05-20 06:44:40] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2022-05-20 06:44:41] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 0 ms to minimize.
[2022-05-20 06:44:41] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 22894 ms
[2022-05-20 06:44:41] [INFO ] After 24203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-20 06:44:41] [INFO ] After 24769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 2685 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2685 transition count 1843
Reduce places removed 562 places and 0 transitions.
Iterating post reduction 1 with 562 rules applied. Total rules applied 1124 place count 2123 transition count 1843
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1124 place count 2123 transition count 1527
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1756 place count 1807 transition count 1527
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 0 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 3118 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3359 place count 1006 transition count 844
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3361 place count 1006 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3363 place count 1004 transition count 842
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3482 place count 1004 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3483 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3484 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3484 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3488 place count 1000 transition count 839
Applied a total of 3488 rules in 410 ms. Remains 1000 /2685 variables (removed 1685) and now considering 839/2405 (removed 1566) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/2685 places, 839/2405 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Finished Best-First random walk after 1278 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=182 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Support contains 3 out of 2685 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Applied a total of 0 rules in 143 ms. Remains 2685 /2685 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:42] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:44:43] [INFO ] Implicit Places using invariants in 832 ms returned []
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:43] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:44:45] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 3262 ms to find 0 implicit places.
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:45] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-20 06:44:47] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2685/2685 places, 2405/2405 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2685 cols
[2022-05-20 06:44:47] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:44:48] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:44:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 149 ms returned sat
[2022-05-20 06:44:49] [INFO ] After 1263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:44:50] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 2 ms to minimize.
[2022-05-20 06:44:51] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 2 ms to minimize.
[2022-05-20 06:44:51] [INFO ] Deduced a trap composed of 27 places in 449 ms of which 2 ms to minimize.
[2022-05-20 06:44:52] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 1 ms to minimize.
[2022-05-20 06:44:52] [INFO ] Deduced a trap composed of 20 places in 399 ms of which 1 ms to minimize.
[2022-05-20 06:44:53] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2022-05-20 06:44:53] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2022-05-20 06:44:54] [INFO ] Deduced a trap composed of 20 places in 386 ms of which 1 ms to minimize.
[2022-05-20 06:44:54] [INFO ] Deduced a trap composed of 19 places in 383 ms of which 1 ms to minimize.
[2022-05-20 06:44:54] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
[2022-05-20 06:44:55] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 1 ms to minimize.
[2022-05-20 06:44:55] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 1 ms to minimize.
[2022-05-20 06:44:56] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2022-05-20 06:44:56] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 1 ms to minimize.
[2022-05-20 06:44:57] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 1 ms to minimize.
[2022-05-20 06:44:57] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2022-05-20 06:44:58] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2022-05-20 06:44:58] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 1 ms to minimize.
[2022-05-20 06:44:58] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2022-05-20 06:44:59] [INFO ] Deduced a trap composed of 18 places in 326 ms of which 1 ms to minimize.
[2022-05-20 06:44:59] [INFO ] Deduced a trap composed of 36 places in 324 ms of which 1 ms to minimize.
[2022-05-20 06:45:00] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2022-05-20 06:45:00] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 1 ms to minimize.
[2022-05-20 06:45:00] [INFO ] Deduced a trap composed of 29 places in 304 ms of which 1 ms to minimize.
[2022-05-20 06:45:01] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 1 ms to minimize.
[2022-05-20 06:45:01] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 1 ms to minimize.
[2022-05-20 06:45:02] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 1 ms to minimize.
[2022-05-20 06:45:02] [INFO ] Deduced a trap composed of 54 places in 290 ms of which 1 ms to minimize.
[2022-05-20 06:45:02] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 1 ms to minimize.
[2022-05-20 06:45:03] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 1 ms to minimize.
[2022-05-20 06:45:03] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 1 ms to minimize.
[2022-05-20 06:45:03] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2022-05-20 06:45:04] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 1 ms to minimize.
[2022-05-20 06:45:04] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 1 ms to minimize.
[2022-05-20 06:45:04] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 1 ms to minimize.
[2022-05-20 06:45:05] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 1 ms to minimize.
[2022-05-20 06:45:05] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 1 ms to minimize.
[2022-05-20 06:45:05] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 12 ms to minimize.
[2022-05-20 06:45:06] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 1 ms to minimize.
[2022-05-20 06:45:06] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2022-05-20 06:45:06] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 1 ms to minimize.
[2022-05-20 06:45:07] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 1 ms to minimize.
[2022-05-20 06:45:07] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 1 ms to minimize.
[2022-05-20 06:45:07] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 0 ms to minimize.
[2022-05-20 06:45:07] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 1 ms to minimize.
[2022-05-20 06:45:08] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 0 ms to minimize.
[2022-05-20 06:45:08] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 1 ms to minimize.
[2022-05-20 06:45:08] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 1 ms to minimize.
[2022-05-20 06:45:09] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 0 ms to minimize.
[2022-05-20 06:45:09] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 1 ms to minimize.
[2022-05-20 06:45:09] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 1 ms to minimize.
[2022-05-20 06:45:09] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2022-05-20 06:45:10] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 1 ms to minimize.
[2022-05-20 06:45:10] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 1 ms to minimize.
[2022-05-20 06:45:10] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2022-05-20 06:45:10] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 1 ms to minimize.
[2022-05-20 06:45:11] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 0 ms to minimize.
[2022-05-20 06:45:11] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 0 ms to minimize.
[2022-05-20 06:45:11] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 0 ms to minimize.
[2022-05-20 06:45:11] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2022-05-20 06:45:11] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 0 ms to minimize.
[2022-05-20 06:45:12] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 1 ms to minimize.
[2022-05-20 06:45:12] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 0 ms to minimize.
[2022-05-20 06:45:12] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2022-05-20 06:45:12] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 0 ms to minimize.
[2022-05-20 06:45:12] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 22839 ms
[2022-05-20 06:45:12] [INFO ] After 24196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-20 06:45:12] [INFO ] After 24740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 2685 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2685 transition count 1843
Reduce places removed 562 places and 0 transitions.
Iterating post reduction 1 with 562 rules applied. Total rules applied 1124 place count 2123 transition count 1843
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1124 place count 2123 transition count 1527
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1756 place count 1807 transition count 1527
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 3118 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3359 place count 1006 transition count 844
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3361 place count 1006 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3363 place count 1004 transition count 842
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3482 place count 1004 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3483 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3484 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3484 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3488 place count 1000 transition count 839
Applied a total of 3488 rules in 339 ms. Remains 1000 /2685 variables (removed 1685) and now considering 839/2405 (removed 1566) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/2685 places, 839/2405 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Finished Best-First random walk after 5222 steps, including 1 resets, run visited all 1 properties in 26 ms. (steps per millisecond=200 )
Knowledge obtained : [(AND (NOT p0) p2), true]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1084 ms.
Product exploration explored 100000 steps with 25000 reset in 1112 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Support contains 3 out of 2685 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Performed 562 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2685 transition count 2405
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 196 Pre rules applied. Total rules applied 562 place count 2685 transition count 2563
Deduced a syphon composed of 758 places in 3 ms
Iterating global reduction 1 with 196 rules applied. Total rules applied 758 place count 2685 transition count 2563
Performed 763 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1521 places in 4 ms
Iterating global reduction 1 with 763 rules applied. Total rules applied 1521 place count 2685 transition count 2563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1522 place count 2685 transition count 2562
Renaming transitions due to excessive name length > 1024 char.
Discarding 288 places :
Symmetric choice reduction at 2 with 288 rule applications. Total rules 1810 place count 2397 transition count 2274
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 288 rules applied. Total rules applied 2098 place count 2397 transition count 2274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2099 place count 2397 transition count 2274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2101 place count 2395 transition count 2272
Deduced a syphon composed of 1232 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2103 place count 2395 transition count 2272
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -426
Deduced a syphon composed of 1333 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2204 place count 2395 transition count 2698
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2305 place count 2294 transition count 2496
Deduced a syphon composed of 1232 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2406 place count 2294 transition count 2496
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 1288 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2462 place count 2294 transition count 2737
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2518 place count 2238 transition count 2625
Deduced a syphon composed of 1232 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2574 place count 2238 transition count 2625
Deduced a syphon composed of 1232 places in 2 ms
Applied a total of 2574 rules in 1708 ms. Remains 2238 /2685 variables (removed 447) and now considering 2625/2405 (removed -220) transitions.
[2022-05-20 06:45:18] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2625 rows 2238 cols
[2022-05-20 06:45:18] [INFO ] Computed 441 place invariants in 24 ms
[2022-05-20 06:45:19] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2238/2685 places, 2625/2405 transitions.
Finished structural reductions, in 1 iterations. Remains : 2238/2685 places, 2625/2405 transitions.
Product exploration explored 100000 steps with 25000 reset in 4783 ms.
Product exploration explored 100000 steps with 25000 reset in 4712 ms.
Built C files in :
/tmp/ltsmin17830664770323250773
[2022-05-20 06:45:29] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17830664770323250773
Running compilation step : cd /tmp/ltsmin17830664770323250773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17830664770323250773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17830664770323250773;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 2685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2685/2685 places, 2405/2405 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2683 transition count 2403
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2683 transition count 2403
Applied a total of 4 rules in 341 ms. Remains 2683 /2685 variables (removed 2) and now considering 2403/2405 (removed 2) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2022-05-20 06:45:32] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:45:33] [INFO ] Implicit Places using invariants in 862 ms returned []
// Phase 1: matrix 2403 rows 2683 cols
[2022-05-20 06:45:33] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:45:36] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 3254 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2683 cols
[2022-05-20 06:45:36] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:45:37] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2683/2685 places, 2403/2405 transitions.
Finished structural reductions, in 1 iterations. Remains : 2683/2685 places, 2403/2405 transitions.
Built C files in :
/tmp/ltsmin5367702316508090038
[2022-05-20 06:45:38] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5367702316508090038
Running compilation step : cd /tmp/ltsmin5367702316508090038;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5367702316508090038;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5367702316508090038;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 06:45:41] [INFO ] Flatten gal took : 68 ms
[2022-05-20 06:45:41] [INFO ] Flatten gal took : 64 ms
[2022-05-20 06:45:41] [INFO ] Time to serialize gal into /tmp/LTL14527671947284225151.gal : 9 ms
[2022-05-20 06:45:41] [INFO ] Time to serialize properties into /tmp/LTL8056866648667907883.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14527671947284225151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8056866648667907883.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1452767...267
Read 1 LTL properties
Checking formula 0 : !((X(X((!(F(("(p2754==1)")U("((p1540==0)||(p1309==1))"))))U(X((G("(p2754==1)"))U("((p2706==0)||(p627==1))")))))))
Formula 0 simplified : !XX(!F("(p2754==1)" U "((p1540==0)||(p1309==1))") U X(G"(p2754==1)" U "((p2706==0)||(p627==1))"))
Detected timeout of ITS tools.
[2022-05-20 06:45:56] [INFO ] Flatten gal took : 62 ms
[2022-05-20 06:45:56] [INFO ] Applying decomposition
[2022-05-20 06:45:56] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2539704161195877093.txt' '-o' '/tmp/graph2539704161195877093.bin' '-w' '/tmp/graph2539704161195877093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2539704161195877093.bin' '-l' '-1' '-v' '-w' '/tmp/graph2539704161195877093.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:45:56] [INFO ] Decomposing Gal with order
[2022-05-20 06:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:45:57] [INFO ] Removed a total of 399 redundant transitions.
[2022-05-20 06:45:57] [INFO ] Flatten gal took : 153 ms
[2022-05-20 06:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-20 06:45:57] [INFO ] Time to serialize gal into /tmp/LTL5876090385372646478.gal : 22 ms
[2022-05-20 06:45:57] [INFO ] Time to serialize properties into /tmp/LTL16717151610509173864.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5876090385372646478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16717151610509173864.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5876090...246
Read 1 LTL properties
Checking formula 0 : !((X(X((!(F(("(i35.u847.p2754==1)")U("((i20.i2.i1.u479.p1540==0)||(i17.u407.p1309==1))"))))U(X((G("(i35.u847.p2754==1)"))U("((i34.i1.i...199
Formula 0 simplified : !XX(!F("(i35.u847.p2754==1)" U "((i20.i2.i1.u479.p1540==0)||(i17.u407.p1309==1))") U X(G"(i35.u847.p2754==1)" U "((i34.i1.i4.u832.p2...185
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6409695895300318812
[2022-05-20 06:46:12] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6409695895300318812
Running compilation step : cd /tmp/ltsmin6409695895300318812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6409695895300318812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6409695895300318812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-01 finished in 127854 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(G(F(p0)))))'
Support contains 2 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2682 transition count 2402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2682 transition count 2402
Applied a total of 18 rules in 376 ms. Remains 2682 /2691 variables (removed 9) and now considering 2402/2411 (removed 9) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:46:15] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:46:16] [INFO ] Implicit Places using invariants in 859 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:46:16] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-20 06:46:19] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:46:19] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:46:20] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2691 places, 2402/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2691 places, 2402/2411 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s408 0) (EQ s1417 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 738 ms.
Product exploration explored 100000 steps with 0 reset in 1079 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 146424 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146424 steps, saw 102775 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:46:26] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:46:26] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:46:26] [INFO ] [Nat]Absence check using 441 positive place invariants in 149 ms returned sat
[2022-05-20 06:46:28] [INFO ] After 1238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:46:28] [INFO ] Deduced a trap composed of 22 places in 450 ms of which 2 ms to minimize.
[2022-05-20 06:46:29] [INFO ] Deduced a trap composed of 31 places in 455 ms of which 2 ms to minimize.
[2022-05-20 06:46:29] [INFO ] Deduced a trap composed of 20 places in 436 ms of which 1 ms to minimize.
[2022-05-20 06:46:30] [INFO ] Deduced a trap composed of 20 places in 480 ms of which 2 ms to minimize.
[2022-05-20 06:46:30] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 1 ms to minimize.
[2022-05-20 06:46:31] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 1 ms to minimize.
[2022-05-20 06:46:31] [INFO ] Deduced a trap composed of 24 places in 413 ms of which 1 ms to minimize.
[2022-05-20 06:46:32] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2022-05-20 06:46:32] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 1 ms to minimize.
[2022-05-20 06:46:33] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 1 ms to minimize.
[2022-05-20 06:46:33] [INFO ] Deduced a trap composed of 36 places in 388 ms of which 1 ms to minimize.
[2022-05-20 06:46:34] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 2 ms to minimize.
[2022-05-20 06:46:34] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 1 ms to minimize.
[2022-05-20 06:46:35] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 1 ms to minimize.
[2022-05-20 06:46:35] [INFO ] Deduced a trap composed of 30 places in 339 ms of which 2 ms to minimize.
[2022-05-20 06:46:35] [INFO ] Deduced a trap composed of 29 places in 338 ms of which 1 ms to minimize.
[2022-05-20 06:46:36] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 2 ms to minimize.
[2022-05-20 06:46:36] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 1 ms to minimize.
[2022-05-20 06:46:37] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 2 ms to minimize.
[2022-05-20 06:46:37] [INFO ] Deduced a trap composed of 30 places in 303 ms of which 1 ms to minimize.
[2022-05-20 06:46:37] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2022-05-20 06:46:38] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 1 ms to minimize.
[2022-05-20 06:46:38] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 1 ms to minimize.
[2022-05-20 06:46:39] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 1 ms to minimize.
[2022-05-20 06:46:39] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 0 ms to minimize.
[2022-05-20 06:46:39] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 1 ms to minimize.
[2022-05-20 06:46:40] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 1 ms to minimize.
[2022-05-20 06:46:40] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 1 ms to minimize.
[2022-05-20 06:46:40] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 1 ms to minimize.
[2022-05-20 06:46:41] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 1 ms to minimize.
[2022-05-20 06:46:41] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 1 ms to minimize.
[2022-05-20 06:46:41] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 0 ms to minimize.
[2022-05-20 06:46:42] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 0 ms to minimize.
[2022-05-20 06:46:42] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 1 ms to minimize.
[2022-05-20 06:46:42] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 1 ms to minimize.
[2022-05-20 06:46:43] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 1 ms to minimize.
[2022-05-20 06:46:43] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 0 ms to minimize.
[2022-05-20 06:46:43] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 1 ms to minimize.
[2022-05-20 06:46:44] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 1 ms to minimize.
[2022-05-20 06:46:44] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 0 ms to minimize.
[2022-05-20 06:46:44] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 1 ms to minimize.
[2022-05-20 06:46:44] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2022-05-20 06:46:45] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 0 ms to minimize.
[2022-05-20 06:46:45] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 1 ms to minimize.
[2022-05-20 06:46:45] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 0 ms to minimize.
[2022-05-20 06:46:46] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2022-05-20 06:46:46] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 0 ms to minimize.
[2022-05-20 06:46:46] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 1 ms to minimize.
[2022-05-20 06:46:46] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 0 ms to minimize.
[2022-05-20 06:46:46] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 1 ms to minimize.
[2022-05-20 06:46:47] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2022-05-20 06:46:47] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 1 ms to minimize.
[2022-05-20 06:46:47] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 0 ms to minimize.
[2022-05-20 06:46:47] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2022-05-20 06:46:48] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2022-05-20 06:46:48] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 1 ms to minimize.
[2022-05-20 06:46:48] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 20359 ms
[2022-05-20 06:46:48] [INFO ] After 21668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-20 06:46:48] [INFO ] After 22252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2682 transition count 1843
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2123 transition count 1843
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1118 place count 2123 transition count 1524
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1756 place count 1804 transition count 1524
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 3118 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3119 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3121 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3323 place count 1021 transition count 841
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3357 place count 1004 transition count 841
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 3 with 119 rules applied. Total rules applied 3476 place count 1004 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3477 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3478 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3478 place count 1002 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3482 place count 1000 transition count 838
Applied a total of 3482 rules in 427 ms. Remains 1000 /2682 variables (removed 1682) and now considering 838/2402 (removed 1564) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/2682 places, 838/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 220760 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220760 steps, saw 183029 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 1000 cols
[2022-05-20 06:46:52] [INFO ] Computed 440 place invariants in 1 ms
[2022-05-20 06:46:52] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:46:52] [INFO ] [Nat]Absence check using 440 positive place invariants in 62 ms returned sat
[2022-05-20 06:46:52] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:46:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 06:46:52] [INFO ] After 35ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:46:53] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2022-05-20 06:46:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-20 06:46:53] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-20 06:46:53] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 838/838 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 838/838 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 838/838 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2022-05-20 06:46:53] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:46:53] [INFO ] Implicit Places using invariants in 528 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 529 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 998/1000 places, 838/838 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 996 transition count 836
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 996 transition count 836
Applied a total of 4 rules in 37 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:46:53] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:46:54] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:46:54] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:46:55] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 996/1000 places, 836/838 transitions.
Finished structural reductions, in 2 iterations. Remains : 996/1000 places, 836/838 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222864 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222864 steps, saw 185107 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:46:58] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:46:58] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:46:58] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-05-20 06:46:58] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:46:59] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 06:46:59] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 836/836 transitions.
Applied a total of 0 rules in 20 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 836/836 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 836/836 transitions.
Applied a total of 0 rules in 26 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:46:59] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:46:59] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:46:59] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:00] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2022-05-20 06:47:00] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:00] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:01] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 836/836 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 996 transition count 836
Applied a total of 234 rules in 51 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:01] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:01] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:47:01] [INFO ] [Nat]Absence check using 438 positive place invariants in 62 ms returned sat
[2022-05-20 06:47:01] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:01] [INFO ] State equation strengthened by 232 read => feed constraints.
[2022-05-20 06:47:01] [INFO ] After 157ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:02] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2022-05-20 06:47:02] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2022-05-20 06:47:02] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2022-05-20 06:47:02] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2022-05-20 06:47:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1024 ms
[2022-05-20 06:47:03] [INFO ] After 1241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-20 06:47:03] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:03] [INFO ] Flatten gal took : 29 ms
[2022-05-20 06:47:03] [INFO ] Flatten gal took : 28 ms
[2022-05-20 06:47:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9185597311897780245.gal : 4 ms
[2022-05-20 06:47:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14809499903149790050.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11098372098170925023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9185597311897780245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14809499903149790050.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14809499903149790050.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 70
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :70 after 126
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :126 after 1290
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1290 after 15065
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15065 after 925455
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :925455 after 7.93233e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.93233e+07 after 4.13653e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.13653e+08 after 5.57482e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.57482e+11 after 8.65776e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.65776e+14 after 2.74714e+18
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.76107e+22,6.46469,154100,2,27045,20,430567,6,0,4706,1.16846e+06,0
Total reachable state count : 67610684399950526529536
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,2.73693e+20,6.47256,154100,2,4431,20,430567,7,0,4712,1.16846e+06,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2681 transition count 1842
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2122 transition count 1842
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1118 place count 2122 transition count 1523
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1756 place count 1803 transition count 1523
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3114 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3115 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3117 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3319 place count 1022 transition count 842
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3353 place count 1005 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3355 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3356 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3356 place count 1002 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3360 place count 1000 transition count 838
Applied a total of 3360 rules in 388 ms. Remains 1000 /2682 variables (removed 1682) and now considering 838/2402 (removed 1564) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2022-05-20 06:47:10] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:47:10] [INFO ] Implicit Places using invariants in 494 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 496 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2682 places, 838/2402 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 836
Applied a total of 4 rules in 46 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:10] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:47:11] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:11] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:12] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2682 places, 836/2402 transitions.
Finished structural reductions, in 2 iterations. Remains : 996/2682 places, 836/2402 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 202200 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202200 steps, saw 147890 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:15] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:15] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:47:16] [INFO ] [Nat]Absence check using 438 positive place invariants in 65 ms returned sat
[2022-05-20 06:47:16] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:16] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 06:47:16] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 836/836 transitions.
Applied a total of 0 rules in 19 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 836/836 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204906 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204906 steps, saw 149738 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:19] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:19] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:47:19] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:47:20] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:20] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-20 06:47:20] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 836/836 transitions.
Applied a total of 0 rules in 25 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 836/836 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 836/836 transitions.
Applied a total of 0 rules in 25 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:20] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:20] [INFO ] Implicit Places using invariants in 523 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:20] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:21] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2022-05-20 06:47:21] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:21] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:22] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 836/836 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 996 transition count 836
Applied a total of 234 rules in 59 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:22] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:22] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:47:22] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:47:23] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:23] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-20 06:47:23] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:47:23] [INFO ] Flatten gal took : 24 ms
[2022-05-20 06:47:23] [INFO ] Flatten gal took : 23 ms
[2022-05-20 06:47:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1125289288564312690.gal : 3 ms
[2022-05-20 06:47:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11448997207118259315.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16966272741957329673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1125289288564312690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11448997207118259315.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11448997207118259315.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 1893
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1893 after 33801
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :33801 after 5.76009e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.76009e+06 after 1.25262e+14
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.00289e+28,0.522666,14988,2,2748,16,38652,6,0,4823,38155,0
Total reachable state count : 50028871680000000000000000000
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4.096e+21,0.525975,15252,2,1183,16,38652,7,0,4829,38155,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 704 ms.
Product exploration explored 100000 steps with 0 reset in 910 ms.
Built C files in :
/tmp/ltsmin13887787548332832582
[2022-05-20 06:47:25] [INFO ] Computing symmetric may disable matrix : 836 transitions.
[2022-05-20 06:47:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:47:25] [INFO ] Computing symmetric may enable matrix : 836 transitions.
[2022-05-20 06:47:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:47:25] [INFO ] Computing Do-Not-Accords matrix : 836 transitions.
[2022-05-20 06:47:25] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:47:25] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13887787548332832582
Running compilation step : cd /tmp/ltsmin13887787548332832582;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2336 ms.
Running link step : cd /tmp/ltsmin13887787548332832582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13887787548332832582;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9204467282899600866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 836/836 transitions.
Applied a total of 0 rules in 25 ms. Remains 996 /996 variables (removed 0) and now considering 836/836 (removed 0) transitions.
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:40] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:47:41] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:41] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:47:42] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
[2022-05-20 06:47:42] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 836 rows 996 cols
[2022-05-20 06:47:42] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:47:42] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 836/836 transitions.
Built C files in :
/tmp/ltsmin1978472621565743280
[2022-05-20 06:47:42] [INFO ] Computing symmetric may disable matrix : 836 transitions.
[2022-05-20 06:47:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:47:42] [INFO ] Computing symmetric may enable matrix : 836 transitions.
[2022-05-20 06:47:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:47:42] [INFO ] Computing Do-Not-Accords matrix : 836 transitions.
[2022-05-20 06:47:42] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:47:42] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1978472621565743280
Running compilation step : cd /tmp/ltsmin1978472621565743280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2266 ms.
Running link step : cd /tmp/ltsmin1978472621565743280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1978472621565743280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16999938338157511993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 06:47:57] [INFO ] Flatten gal took : 22 ms
[2022-05-20 06:47:57] [INFO ] Flatten gal took : 22 ms
[2022-05-20 06:47:57] [INFO ] Time to serialize gal into /tmp/LTL3330962452897381748.gal : 3 ms
[2022-05-20 06:47:57] [INFO ] Time to serialize properties into /tmp/LTL13720048145274483164.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3330962452897381748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13720048145274483164.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3330962...267
Read 1 LTL properties
Checking formula 0 : !(((X("((p463==0)||(p1642==1))"))&&(F(G(F("((p463==0)||(p1642==1))"))))))
Formula 0 simplified : !(X"((p463==0)||(p1642==1))" & FGF"((p463==0)||(p1642==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.79862e+65 deadlock states
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
1056 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6536,302516,1,0,10,2.04382e+06,24,6,24629,369510,29
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-03 finished in 114793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&F((G(p1)||p2))))||F(X(p1))))'
Support contains 6 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2682 transition count 2402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2682 transition count 2402
Applied a total of 18 rules in 349 ms. Remains 2682 /2691 variables (removed 9) and now considering 2402/2411 (removed 9) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:10] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-20 06:48:11] [INFO ] Implicit Places using invariants in 831 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:11] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:48:14] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 3429 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:14] [INFO ] Computed 441 place invariants in 15 ms
[2022-05-20 06:48:15] [INFO ] Dead Transitions using invariants and state equation in 1398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2691 places, 2402/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2691 places, 2402/2411 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s2136 0) (EQ s496 1)), p1:(OR (EQ s698 0) (EQ s2621 1)), p2:(AND (EQ s211 0) (EQ s2249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2057 ms.
Product exploration explored 100000 steps with 50000 reset in 2077 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 9 factoid took 556 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-06 finished in 10103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&p1)))'
Support contains 4 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2681 transition count 2401
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2681 transition count 2401
Applied a total of 20 rules in 349 ms. Remains 2681 /2691 variables (removed 10) and now considering 2401/2411 (removed 10) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:48:20] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-20 06:48:21] [INFO ] Implicit Places using invariants in 829 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:48:21] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:48:23] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 3288 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:48:23] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:48:25] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2691 places, 2401/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2691 places, 2401/2411 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2319 0) (EQ s1547 1)), p0:(OR (EQ s1144 0) (EQ s2066 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2056 ms.
Product exploration explored 100000 steps with 50000 reset in 2099 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 865 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-08 finished in 10303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p1)&&p0))||X(G(p2)))))'
Support contains 4 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2683 transition count 2403
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2683 transition count 2403
Applied a total of 16 rules in 339 ms. Remains 2683 /2691 variables (removed 8) and now considering 2403/2411 (removed 8) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2022-05-20 06:48:30] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-20 06:48:31] [INFO ] Implicit Places using invariants in 871 ms returned []
// Phase 1: matrix 2403 rows 2683 cols
[2022-05-20 06:48:31] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:48:34] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3446 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2683 cols
[2022-05-20 06:48:34] [INFO ] Computed 441 place invariants in 16 ms
[2022-05-20 06:48:35] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2683/2691 places, 2403/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2683/2691 places, 2403/2411 transitions.
Stuttering acceptance computed with spot in 975 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1362 0) (EQ s2354 1)), p1:(AND (EQ s827 0) (EQ s1907 1)), p2:(AND (EQ s1362 0) (EQ s2354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-09 finished in 6212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((p0 U !X(G(p0))))&&X(G(p1))))))'
Support contains 4 out of 2691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2690 transition count 1848
Reduce places removed 562 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 564 rules applied. Total rules applied 1126 place count 2128 transition count 1846
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1128 place count 2126 transition count 1846
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 1128 place count 2126 transition count 1532
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1756 place count 1812 transition count 1532
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1761 place count 1807 transition count 1527
Iterating global reduction 3 with 5 rules applied. Total rules applied 1766 place count 1807 transition count 1527
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1766 place count 1807 transition count 1523
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1774 place count 1803 transition count 1523
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 1 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 3 with 1354 rules applied. Total rules applied 3128 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3129 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3131 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3333 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3369 place count 1006 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3371 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3372 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3372 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3376 place count 1001 transition count 840
Applied a total of 3376 rules in 455 ms. Remains 1001 /2691 variables (removed 1690) and now considering 840/2411 (removed 1571) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2022-05-20 06:48:37] [INFO ] Computed 440 place invariants in 1 ms
[2022-05-20 06:48:37] [INFO ] Implicit Places using invariants in 512 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 513 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2691 places, 840/2411 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 838
Applied a total of 4 rules in 36 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2022-05-20 06:48:37] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:48:38] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 838 rows 997 cols
[2022-05-20 06:48:38] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:48:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:48:39] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2691 places, 838/2411 transitions.
Finished structural reductions, in 2 iterations. Remains : 997/2691 places, 838/2411 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) p0), p0]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s232 0) (EQ s616 1)), p0:(OR (EQ s658 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 701 ms.
Stack based approach found an accepted trace after 105 steps with 1 reset with depth 104 and stack size 104 in 3 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-11 finished in 3348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2682 transition count 2402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2682 transition count 2402
Applied a total of 18 rules in 351 ms. Remains 2682 /2691 variables (removed 9) and now considering 2402/2411 (removed 9) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:40] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:48:41] [INFO ] Implicit Places using invariants in 857 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:41] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:48:43] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned []
Implicit Place search using SMT with State Equation took 3404 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:43] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:48:45] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2691 places, 2402/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2691 places, 2402/2411 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1504 0) (EQ s79 1)), p1:(OR (EQ s223 0) (EQ s1793 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 720 ms.
Product exploration explored 100000 steps with 0 reset in 952 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 460 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:48:47] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:48:48] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:48:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 149 ms returned sat
[2022-05-20 06:48:50] [INFO ] After 1338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:48:50] [INFO ] Deduced a trap composed of 18 places in 597 ms of which 2 ms to minimize.
[2022-05-20 06:48:51] [INFO ] Deduced a trap composed of 17 places in 561 ms of which 1 ms to minimize.
[2022-05-20 06:48:52] [INFO ] Deduced a trap composed of 32 places in 525 ms of which 1 ms to minimize.
[2022-05-20 06:48:52] [INFO ] Deduced a trap composed of 29 places in 526 ms of which 1 ms to minimize.
[2022-05-20 06:48:53] [INFO ] Deduced a trap composed of 18 places in 521 ms of which 1 ms to minimize.
[2022-05-20 06:48:54] [INFO ] Deduced a trap composed of 25 places in 497 ms of which 1 ms to minimize.
[2022-05-20 06:48:54] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 1 ms to minimize.
[2022-05-20 06:48:55] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 2 ms to minimize.
[2022-05-20 06:48:55] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 1 ms to minimize.
[2022-05-20 06:48:56] [INFO ] Deduced a trap composed of 30 places in 473 ms of which 1 ms to minimize.
[2022-05-20 06:48:56] [INFO ] Deduced a trap composed of 28 places in 486 ms of which 2 ms to minimize.
[2022-05-20 06:48:57] [INFO ] Deduced a trap composed of 24 places in 464 ms of which 2 ms to minimize.
[2022-05-20 06:48:57] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 1 ms to minimize.
[2022-05-20 06:48:58] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 1 ms to minimize.
[2022-05-20 06:48:59] [INFO ] Deduced a trap composed of 30 places in 458 ms of which 2 ms to minimize.
[2022-05-20 06:48:59] [INFO ] Deduced a trap composed of 21 places in 429 ms of which 1 ms to minimize.
[2022-05-20 06:49:00] [INFO ] Deduced a trap composed of 25 places in 424 ms of which 1 ms to minimize.
[2022-05-20 06:49:00] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2022-05-20 06:49:01] [INFO ] Deduced a trap composed of 18 places in 406 ms of which 1 ms to minimize.
[2022-05-20 06:49:01] [INFO ] Deduced a trap composed of 20 places in 408 ms of which 1 ms to minimize.
[2022-05-20 06:49:02] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 1 ms to minimize.
[2022-05-20 06:49:02] [INFO ] Deduced a trap composed of 16 places in 380 ms of which 1 ms to minimize.
[2022-05-20 06:49:02] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 1 ms to minimize.
[2022-05-20 06:49:03] [INFO ] Deduced a trap composed of 26 places in 361 ms of which 1 ms to minimize.
[2022-05-20 06:49:03] [INFO ] Deduced a trap composed of 34 places in 348 ms of which 1 ms to minimize.
[2022-05-20 06:49:04] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 1 ms to minimize.
[2022-05-20 06:49:04] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 1 ms to minimize.
[2022-05-20 06:49:05] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 1 ms to minimize.
[2022-05-20 06:49:05] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 1 ms to minimize.
[2022-05-20 06:49:05] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 1 ms to minimize.
[2022-05-20 06:49:06] [INFO ] Deduced a trap composed of 40 places in 314 ms of which 0 ms to minimize.
[2022-05-20 06:49:06] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 1 ms to minimize.
[2022-05-20 06:49:07] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 1 ms to minimize.
[2022-05-20 06:49:07] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 1 ms to minimize.
[2022-05-20 06:49:07] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 1 ms to minimize.
[2022-05-20 06:49:08] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 1 ms to minimize.
[2022-05-20 06:49:08] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 1 ms to minimize.
[2022-05-20 06:49:09] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 0 ms to minimize.
[2022-05-20 06:49:09] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 1 ms to minimize.
[2022-05-20 06:49:09] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 1 ms to minimize.
[2022-05-20 06:49:10] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 1 ms to minimize.
[2022-05-20 06:49:10] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 1 ms to minimize.
[2022-05-20 06:49:10] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 1 ms to minimize.
[2022-05-20 06:49:11] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 1 ms to minimize.
[2022-05-20 06:49:11] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 1 ms to minimize.
[2022-05-20 06:49:11] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 0 ms to minimize.
[2022-05-20 06:49:12] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 1 ms to minimize.
[2022-05-20 06:49:12] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 0 ms to minimize.
[2022-05-20 06:49:12] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 0 ms to minimize.
[2022-05-20 06:49:13] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 0 ms to minimize.
[2022-05-20 06:49:13] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 2 ms to minimize.
[2022-05-20 06:49:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 06:49:13] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 219 ms.
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2682 transition count 1844
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2124 transition count 1844
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1116 place count 2124 transition count 1525
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1754 place count 1805 transition count 1525
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3112 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3113 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3317 place count 1024 transition count 844
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3349 place count 1008 transition count 844
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3350 place count 1008 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3351 place count 1007 transition count 843
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3470 place count 1007 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3471 place count 1006 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3472 place count 1005 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3472 place count 1005 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3476 place count 1003 transition count 840
Applied a total of 3476 rules in 381 ms. Remains 1003 /2682 variables (removed 1679) and now considering 840/2402 (removed 1562) transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/2682 places, 840/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 840 rows 1003 cols
[2022-05-20 06:49:14] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:49:14] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:49:14] [INFO ] [Nat]Absence check using 440 positive place invariants in 61 ms returned sat
[2022-05-20 06:49:14] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:49:14] [INFO ] After 37ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:14] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-20 06:49:14] [INFO ] After 631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 840/840 transitions.
Applied a total of 0 rules in 19 ms. Remains 1003 /1003 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228607 steps, run timeout after 3024 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 228607 steps, saw 192378 distinct states, run finished after 3024 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 840 rows 1003 cols
[2022-05-20 06:49:18] [INFO ] Computed 440 place invariants in 1 ms
[2022-05-20 06:49:18] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:49:18] [INFO ] [Nat]Absence check using 440 positive place invariants in 62 ms returned sat
[2022-05-20 06:49:18] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:49:18] [INFO ] After 29ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:18] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-20 06:49:18] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 840/840 transitions.
Applied a total of 0 rules in 21 ms. Remains 1003 /1003 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 840/840 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 840/840 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1003 cols
[2022-05-20 06:49:18] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:49:19] [INFO ] Implicit Places using invariants in 499 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 502 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1001/1003 places, 840/840 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 999 transition count 838
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 999 transition count 838
Applied a total of 4 rules in 37 ms. Remains 999 /1001 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:19] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:49:19] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:19] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:49:20] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 999/1003 places, 838/840 transitions.
Finished structural reductions, in 2 iterations. Remains : 999/1003 places, 838/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 227085 steps, run timeout after 3009 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227085 steps, saw 189674 distinct states, run finished after 3009 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:24] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:24] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:49:24] [INFO ] [Nat]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:49:24] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:49:24] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:24] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-20 06:49:24] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 48 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 24 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:24] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:25] [INFO ] Implicit Places using invariants in 538 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:25] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:49:26] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2022-05-20 06:49:26] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:26] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:49:27] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Partial Free-agglomeration rule applied 232 times.
Drop transitions removed 232 transitions
Iterating global reduction 0 with 232 rules applied. Total rules applied 232 place count 999 transition count 838
Applied a total of 232 rules in 45 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:49:27] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:49:27] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:49:27] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:49:27] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:27] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-20 06:49:27] [INFO ] After 101ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:28] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2022-05-20 06:49:28] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2022-05-20 06:49:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2022-05-20 06:49:28] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-20 06:49:28] [INFO ] After 1279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:49:28] [INFO ] Flatten gal took : 28 ms
[2022-05-20 06:49:28] [INFO ] Flatten gal took : 28 ms
[2022-05-20 06:49:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality651444152564580126.gal : 3 ms
[2022-05-20 06:49:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17364796627545572283.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7554888229934442717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality651444152564580126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17364796627545572283.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality17364796627545572283.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 96
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :96 after 195
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :195 after 481
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :481 after 1637
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1637 after 29964
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :29964 after 1.8498e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.8498e+06 after 1.62121e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.62121e+08 after 1.06625e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.06625e+09 after 2.17345e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.17345e+12 after 2.25632e+15
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.25632e+15 after 2.21437e+19
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.21437e+19 after 1.66397e+23
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.66397e+23 after 1.22883e+30
Detected timeout of ITS tools.
[2022-05-20 06:49:43] [INFO ] Flatten gal took : 27 ms
[2022-05-20 06:49:43] [INFO ] Applying decomposition
[2022-05-20 06:49:43] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5691071496887909640.txt' '-o' '/tmp/graph5691071496887909640.bin' '-w' '/tmp/graph5691071496887909640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5691071496887909640.bin' '-l' '-1' '-v' '-w' '/tmp/graph5691071496887909640.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:49:43] [INFO ] Decomposing Gal with order
[2022-05-20 06:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:49:43] [INFO ] Removed a total of 218 redundant transitions.
[2022-05-20 06:49:43] [INFO ] Flatten gal took : 43 ms
[2022-05-20 06:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 4 ms.
[2022-05-20 06:49:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8333964912298398572.gal : 5 ms
[2022-05-20 06:49:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5104413643993327468.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7554888229934442717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8333964912298398572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5104413643993327468.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5104413643993327468.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3 after 4.61174e+06
Reachability property apf4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.27929e+34,2.01417,58612,2481,140,107707,918,1012,234298,110,11984,0
Total reachable state count : 22792945882375477097033330910560256
Verifying 1 reachability properties.
Reachability property apf4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1.77869e+33,2.02153,58612,857,125,107707,918,1032,234298,115,11984,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 11 factoid took 440 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Applied a total of 0 rules in 180 ms. Remains 2682 /2682 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:49:46] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-20 06:49:47] [INFO ] Implicit Places using invariants in 837 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:49:47] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:49:50] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 3430 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:49:50] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-20 06:49:51] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2682 places, 2402/2402 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 424 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:49:52] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:49:52] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:49:53] [INFO ] [Nat]Absence check using 441 positive place invariants in 148 ms returned sat
[2022-05-20 06:49:54] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:49:55] [INFO ] Deduced a trap composed of 18 places in 558 ms of which 2 ms to minimize.
[2022-05-20 06:49:56] [INFO ] Deduced a trap composed of 17 places in 571 ms of which 1 ms to minimize.
[2022-05-20 06:49:56] [INFO ] Deduced a trap composed of 32 places in 550 ms of which 2 ms to minimize.
[2022-05-20 06:49:57] [INFO ] Deduced a trap composed of 29 places in 542 ms of which 2 ms to minimize.
[2022-05-20 06:49:58] [INFO ] Deduced a trap composed of 18 places in 538 ms of which 1 ms to minimize.
[2022-05-20 06:49:58] [INFO ] Deduced a trap composed of 25 places in 531 ms of which 1 ms to minimize.
[2022-05-20 06:49:59] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 1 ms to minimize.
[2022-05-20 06:49:59] [INFO ] Deduced a trap composed of 25 places in 523 ms of which 2 ms to minimize.
[2022-05-20 06:50:00] [INFO ] Deduced a trap composed of 33 places in 521 ms of which 1 ms to minimize.
[2022-05-20 06:50:01] [INFO ] Deduced a trap composed of 30 places in 488 ms of which 1 ms to minimize.
[2022-05-20 06:50:01] [INFO ] Deduced a trap composed of 28 places in 469 ms of which 1 ms to minimize.
[2022-05-20 06:50:02] [INFO ] Deduced a trap composed of 24 places in 490 ms of which 2 ms to minimize.
[2022-05-20 06:50:02] [INFO ] Deduced a trap composed of 33 places in 483 ms of which 1 ms to minimize.
[2022-05-20 06:50:03] [INFO ] Deduced a trap composed of 20 places in 449 ms of which 1 ms to minimize.
[2022-05-20 06:50:03] [INFO ] Deduced a trap composed of 30 places in 462 ms of which 1 ms to minimize.
[2022-05-20 06:50:04] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 2 ms to minimize.
[2022-05-20 06:50:04] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 2 ms to minimize.
[2022-05-20 06:50:05] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 1 ms to minimize.
[2022-05-20 06:50:05] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 2 ms to minimize.
[2022-05-20 06:50:06] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 1 ms to minimize.
[2022-05-20 06:50:06] [INFO ] Deduced a trap composed of 23 places in 412 ms of which 1 ms to minimize.
[2022-05-20 06:50:07] [INFO ] Deduced a trap composed of 16 places in 415 ms of which 1 ms to minimize.
[2022-05-20 06:50:07] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 1 ms to minimize.
[2022-05-20 06:50:08] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
[2022-05-20 06:50:08] [INFO ] Deduced a trap composed of 34 places in 373 ms of which 1 ms to minimize.
[2022-05-20 06:50:09] [INFO ] Deduced a trap composed of 23 places in 369 ms of which 1 ms to minimize.
[2022-05-20 06:50:09] [INFO ] Deduced a trap composed of 35 places in 356 ms of which 1 ms to minimize.
[2022-05-20 06:50:10] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 1 ms to minimize.
[2022-05-20 06:50:10] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 1 ms to minimize.
[2022-05-20 06:50:11] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 1 ms to minimize.
[2022-05-20 06:50:11] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 1 ms to minimize.
[2022-05-20 06:50:11] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 1 ms to minimize.
[2022-05-20 06:50:12] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 1 ms to minimize.
[2022-05-20 06:50:12] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 1 ms to minimize.
[2022-05-20 06:50:13] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 1 ms to minimize.
[2022-05-20 06:50:13] [INFO ] Deduced a trap composed of 36 places in 301 ms of which 1 ms to minimize.
[2022-05-20 06:50:13] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 1 ms to minimize.
[2022-05-20 06:50:14] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 1 ms to minimize.
[2022-05-20 06:50:14] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 1 ms to minimize.
[2022-05-20 06:50:14] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 1 ms to minimize.
[2022-05-20 06:50:15] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 1 ms to minimize.
[2022-05-20 06:50:15] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2022-05-20 06:50:16] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 1 ms to minimize.
[2022-05-20 06:50:16] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 1 ms to minimize.
[2022-05-20 06:50:16] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 0 ms to minimize.
[2022-05-20 06:50:17] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 1 ms to minimize.
[2022-05-20 06:50:17] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 1 ms to minimize.
[2022-05-20 06:50:17] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 0 ms to minimize.
[2022-05-20 06:50:18] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2022-05-20 06:50:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 06:50:18] [INFO ] After 25284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 242 ms.
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2682 transition count 1844
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2124 transition count 1844
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 1116 place count 2124 transition count 1525
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1754 place count 1805 transition count 1525
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3112 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3113 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3317 place count 1024 transition count 844
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3349 place count 1008 transition count 844
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3350 place count 1008 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3351 place count 1007 transition count 843
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 3470 place count 1007 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3471 place count 1006 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3472 place count 1005 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3472 place count 1005 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3476 place count 1003 transition count 840
Applied a total of 3476 rules in 439 ms. Remains 1003 /2682 variables (removed 1679) and now considering 840/2402 (removed 1562) transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/2682 places, 840/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 113118 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113118 steps, saw 95323 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 840 rows 1003 cols
[2022-05-20 06:50:22] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:50:22] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:50:22] [INFO ] [Nat]Absence check using 440 positive place invariants in 74 ms returned sat
[2022-05-20 06:50:22] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 06:50:23] [INFO ] After 101ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:23] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-20 06:50:23] [INFO ] After 1038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 840/840 transitions.
Applied a total of 0 rules in 21 ms. Remains 1003 /1003 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 840/840 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 840/840 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 840/840 (removed 0) transitions.
// Phase 1: matrix 840 rows 1003 cols
[2022-05-20 06:50:23] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:50:23] [INFO ] Implicit Places using invariants in 537 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 538 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1001/1003 places, 840/840 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 999 transition count 838
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 999 transition count 838
Applied a total of 4 rules in 36 ms. Remains 999 /1001 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:24] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:50:24] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:24] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:50:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:50:25] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 999/1003 places, 838/840 transitions.
Finished structural reductions, in 2 iterations. Remains : 999/1003 places, 838/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 116929 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116929 steps, saw 97163 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:29] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:50:29] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:50:29] [INFO ] [Nat]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:50:29] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:50:29] [INFO ] After 95ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:30] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-20 06:50:30] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 21 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 19 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:30] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:50:30] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:30] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:50:31] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2022-05-20 06:50:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:31] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:50:32] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Partial Free-agglomeration rule applied 232 times.
Drop transitions removed 232 transitions
Iterating global reduction 0 with 232 rules applied. Total rules applied 232 place count 999 transition count 838
Applied a total of 232 rules in 44 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:50:32] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:50:32] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:50:32] [INFO ] [Nat]Absence check using 438 positive place invariants in 58 ms returned sat
[2022-05-20 06:50:33] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:33] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-20 06:50:33] [INFO ] After 260ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:33] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2022-05-20 06:50:33] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2022-05-20 06:50:34] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 1 ms to minimize.
[2022-05-20 06:50:34] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2022-05-20 06:50:34] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2022-05-20 06:50:34] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2022-05-20 06:50:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1354 ms
[2022-05-20 06:50:34] [INFO ] After 1811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-05-20 06:50:35] [INFO ] After 2605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:50:35] [INFO ] Flatten gal took : 27 ms
[2022-05-20 06:50:35] [INFO ] Flatten gal took : 26 ms
[2022-05-20 06:50:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4083205483369120593.gal : 21 ms
[2022-05-20 06:50:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10172787150641420077.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12016739745290031590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4083205483369120593.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10172787150641420077.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10172787150641420077.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 45
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :45 after 96
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :96 after 195
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :195 after 481
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :481 after 1637
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1637 after 29964
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :29964 after 1.8498e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.8498e+06 after 1.62121e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.62121e+08 after 1.06625e+09
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.06625e+09 after 2.17345e+12
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.17345e+12 after 2.25632e+15
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :2.25632e+15 after 2.21437e+19
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :2.21437e+19 after 1.66397e+23
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :1.66397e+23 after 1.22883e+30
Detected timeout of ITS tools.
[2022-05-20 06:50:50] [INFO ] Flatten gal took : 46 ms
[2022-05-20 06:50:50] [INFO ] Applying decomposition
[2022-05-20 06:50:50] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14591880253219843962.txt' '-o' '/tmp/graph14591880253219843962.bin' '-w' '/tmp/graph14591880253219843962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14591880253219843962.bin' '-l' '-1' '-v' '-w' '/tmp/graph14591880253219843962.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:50:50] [INFO ] Decomposing Gal with order
[2022-05-20 06:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:50:50] [INFO ] Removed a total of 215 redundant transitions.
[2022-05-20 06:50:50] [INFO ] Flatten gal took : 76 ms
[2022-05-20 06:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 13 ms.
[2022-05-20 06:50:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3971369439181073364.gal : 22 ms
[2022-05-20 06:50:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7634093047472334758.prop : 16 ms
Invoking ITS tools like this :cd /tmp/redAtoms12016739745290031590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3971369439181073364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7634093047472334758.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality7634093047472334758.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3 after 3
Reachability property apf4 is true.
Reachability property apf3 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.9501e+31,1.32883,44716,2103,130,84318,691,1019,162867,108,7710,0
Total reachable state count : 39501031537548993987877967757312
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,5.3273e+22,1.34041,44980,549,114,84318,691,1027,162867,113,7710,0
Reachability property apf3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,7.10307e+21,1.34364,44980,525,114,84318,691,1036,162867,115,7710,0
Reachability property apf4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1.539e+22,1.3451,44980,547,114,84318,691,1046,162867,115,7710,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 11 factoid took 447 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 730 ms.
Product exploration explored 100000 steps with 0 reset in 952 ms.
Built C files in :
/tmp/ltsmin1855570137289971592
[2022-05-20 06:50:54] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1855570137289971592
Running compilation step : cd /tmp/ltsmin1855570137289971592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1855570137289971592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1855570137289971592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Applied a total of 0 rules in 190 ms. Remains 2682 /2682 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:50:57] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:50:59] [INFO ] Implicit Places using invariants in 1653 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:50:59] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:51:01] [INFO ] Implicit Places using invariants and state equation in 2665 ms returned []
Implicit Place search using SMT with State Equation took 4341 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2022-05-20 06:51:01] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:51:03] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2682/2682 places, 2402/2402 transitions.
Built C files in :
/tmp/ltsmin12595243611384149033
[2022-05-20 06:51:03] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12595243611384149033
Running compilation step : cd /tmp/ltsmin12595243611384149033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12595243611384149033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12595243611384149033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 06:51:06] [INFO ] Flatten gal took : 52 ms
[2022-05-20 06:51:06] [INFO ] Flatten gal took : 53 ms
[2022-05-20 06:51:06] [INFO ] Time to serialize gal into /tmp/LTL6973928344244407879.gal : 10 ms
[2022-05-20 06:51:06] [INFO ] Time to serialize properties into /tmp/LTL11344736094174199852.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6973928344244407879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11344736094174199852.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6973928...267
Read 1 LTL properties
Checking formula 0 : !((F(G(((X("((p250==0)||(p2079==1))"))||("(p1746==0)"))||("(p80==1)")))))
Formula 0 simplified : !FG("(p80==1)" | "(p1746==0)" | X"((p250==0)||(p2079==1))")
Detected timeout of ITS tools.
[2022-05-20 06:51:21] [INFO ] Flatten gal took : 52 ms
[2022-05-20 06:51:21] [INFO ] Applying decomposition
[2022-05-20 06:51:21] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15526685938840420636.txt' '-o' '/tmp/graph15526685938840420636.bin' '-w' '/tmp/graph15526685938840420636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15526685938840420636.bin' '-l' '-1' '-v' '-w' '/tmp/graph15526685938840420636.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:51:22] [INFO ] Decomposing Gal with order
[2022-05-20 06:51:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:51:22] [INFO ] Removed a total of 400 redundant transitions.
[2022-05-20 06:51:22] [INFO ] Flatten gal took : 94 ms
[2022-05-20 06:51:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 06:51:22] [INFO ] Time to serialize gal into /tmp/LTL6038958731599108047.gal : 12 ms
[2022-05-20 06:51:22] [INFO ] Time to serialize properties into /tmp/LTL5912469536726640215.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6038958731599108047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5912469536726640215.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6038958...245
Read 1 LTL properties
Checking formula 0 : !((F(G(((X("((i4.i1.i6.u78.p250==0)||(i26.u637.p2079==1))"))||("(i23.u536.p1746==0)"))||("(i2.u30.p80==1)")))))
Formula 0 simplified : !FG("(i2.u30.p80==1)" | "(i23.u536.p1746==0)" | X"((i4.i1.i6.u78.p250==0)||(i26.u637.p2079==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6119634641766096787
[2022-05-20 06:51:37] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6119634641766096787
Running compilation step : cd /tmp/ltsmin6119634641766096787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6119634641766096787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6119634641766096787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-12 finished in 180229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 2 out of 2691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2681 transition count 2401
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2681 transition count 2401
Applied a total of 20 rules in 590 ms. Remains 2681 /2691 variables (removed 10) and now considering 2401/2411 (removed 10) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:51:41] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:51:42] [INFO ] Implicit Places using invariants in 1518 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:51:42] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:51:44] [INFO ] Implicit Places using invariants and state equation in 2340 ms returned []
Implicit Place search using SMT with State Equation took 3888 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2022-05-20 06:51:44] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:51:46] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2691 places, 2401/2411 transitions.
Finished structural reductions, in 1 iterations. Remains : 2681/2691 places, 2401/2411 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1918 0) (EQ s649 1)), p1:(OR (EQ s1918 0) (EQ s649 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 682 ms.
Stack based approach found an accepted trace after 9416 steps with 0 reset with depth 9417 and stack size 9417 in 77 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-14 finished in 6785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!F((p0 U p1)) U X((G(p0) U p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Found a SL insensitive property : ShieldPPPt-PT-040B-LTLCardinality-12
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2691 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2691/2691 places, 2411/2411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 563 transitions
Trivial Post-agglo rules discarded 563 transitions
Performed 563 trivial Post agglomeration. Transition count delta: 563
Iterating post reduction 0 with 563 rules applied. Total rules applied 563 place count 2690 transition count 1847
Reduce places removed 563 places and 0 transitions.
Iterating post reduction 1 with 563 rules applied. Total rules applied 1126 place count 2127 transition count 1847
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 1126 place count 2127 transition count 1535
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1750 place count 1815 transition count 1535
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1755 place count 1810 transition count 1530
Iterating global reduction 2 with 5 rules applied. Total rules applied 1760 place count 1810 transition count 1530
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1760 place count 1810 transition count 1526
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1768 place count 1806 transition count 1526
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3126 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3127 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3129 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3331 place count 1025 transition count 845
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3363 place count 1009 transition count 845
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3365 place count 1007 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3366 place count 1006 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3366 place count 1006 transition count 841
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3370 place count 1004 transition count 841
Applied a total of 3370 rules in 400 ms. Remains 1004 /2691 variables (removed 1687) and now considering 841/2411 (removed 1570) transitions.
// Phase 1: matrix 841 rows 1004 cols
[2022-05-20 06:51:47] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:51:48] [INFO ] Implicit Places using invariants in 498 ms returned [987, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 520 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1002/2691 places, 841/2411 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1000 transition count 839
Applied a total of 4 rules in 39 ms. Remains 1000 /1002 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:51:48] [INFO ] Computed 438 place invariants in 5 ms
[2022-05-20 06:51:48] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:51:48] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:51:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:51:49] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1000/2691 places, 839/2411 transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/2691 places, 839/2411 transitions.
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s557 0) (EQ s22 1)), p1:(OR (EQ s76 0) (EQ s675 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 685 ms.
Product exploration explored 100000 steps with 0 reset in 809 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 419 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:51:52] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:51:52] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:51:52] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:51:52] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:51:52] [INFO ] After 96ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:51:53] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-20 06:51:53] [INFO ] After 981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 839/839 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1000 transition count 838
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 999 transition count 838
Applied a total of 2 rules in 39 ms. Remains 999 /1000 variables (removed 1) and now considering 838/839 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 999/1000 places, 838/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 128425 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128425 steps, saw 98819 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:51:56] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:51:56] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:51:57] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-05-20 06:51:57] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:51:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:51:57] [INFO ] After 110ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:51:57] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-20 06:51:57] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 19 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 19 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:51:57] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:51:58] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:51:58] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:51:59] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2022-05-20 06:51:59] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:51:59] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:51:59] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Partial Free-agglomeration rule applied 232 times.
Drop transitions removed 232 transitions
Iterating global reduction 0 with 232 rules applied. Total rules applied 232 place count 999 transition count 838
Applied a total of 232 rules in 58 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:51:59] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:52:00] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:52:00] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2022-05-20 06:52:00] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:01] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-05-20 06:52:01] [INFO ] After 949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:01] [INFO ] Flatten gal took : 24 ms
[2022-05-20 06:52:01] [INFO ] Flatten gal took : 23 ms
[2022-05-20 06:52:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1868681719581189753.gal : 2 ms
[2022-05-20 06:52:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3868208327494103726.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5517813142771238396;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1868681719581189753.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3868208327494103726.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3868208327494103726.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 45
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :45 after 96
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :96 after 195
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :195 after 317
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :317 after 3304
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3304 after 49413
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :49413 after 6.52718e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6.52718e+06 after 9.3143e+12
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9.3143e+12 after 5.04889e+27
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5.04889e+27 after 1.97912e+61
Reachability property apf4 is true.
Reachability property apf3 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.06021e+126,0.995681,30832,2,4297,20,114182,6,0,4836,128166,0
Total reachable state count : 3.060208234405063831535556313824027607321e+126
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1600,0.998683,31096,2,1021,20,114182,7,0,4842,128166,0
Reachability property apf3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1600,1.0005,31096,2,1021,20,114182,8,0,4848,128166,0
Reachability property apf4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1600,1.0027,31096,2,1021,20,114182,9,0,4853,128166,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 839/839 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:02] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:52:03] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:03] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:52:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:52:04] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:04] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:52:04] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 839/839 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 7 factoid took 601 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:06] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:52:06] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:52:06] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:52:06] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:52:06] [INFO ] After 103ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:07] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-20 06:52:07] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 839/839 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1000 transition count 838
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 999 transition count 838
Applied a total of 2 rules in 47 ms. Remains 999 /1000 variables (removed 1) and now considering 838/839 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 999/1000 places, 838/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 123628 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123628 steps, saw 95154 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:52:10] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:52:10] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:52:11] [INFO ] [Nat]Absence check using 438 positive place invariants in 60 ms returned sat
[2022-05-20 06:52:11] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:52:11] [INFO ] After 102ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:11] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 06:52:11] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 999/999 places, 838/838 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:52:11] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:52:12] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:52:12] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:52:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:52:13] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
[2022-05-20 06:52:13] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:52:13] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:52:13] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 999/999 places, 838/838 transitions.
Partial Free-agglomeration rule applied 232 times.
Drop transitions removed 232 transitions
Iterating global reduction 0 with 232 rules applied. Total rules applied 232 place count 999 transition count 838
Applied a total of 232 rules in 45 ms. Remains 999 /999 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 838 rows 999 cols
[2022-05-20 06:52:13] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:52:14] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 06:52:14] [INFO ] [Nat]Absence check using 438 positive place invariants in 63 ms returned sat
[2022-05-20 06:52:14] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:14] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-20 06:52:14] [INFO ] After 889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 06:52:15] [INFO ] Flatten gal took : 24 ms
[2022-05-20 06:52:15] [INFO ] Flatten gal took : 23 ms
[2022-05-20 06:52:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17003449585270372679.gal : 3 ms
[2022-05-20 06:52:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16071586256957544920.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12022300036850243262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17003449585270372679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16071586256957544920.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16071586256957544920.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 45
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :45 after 96
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :96 after 195
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :195 after 317
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :317 after 3304
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3304 after 49413
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :49413 after 6.52718e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6.52718e+06 after 9.3143e+12
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9.3143e+12 after 5.04889e+27
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5.04889e+27 after 1.97912e+61
Reachability property apf4 is true.
Reachability property apf3 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.06021e+126,1.18143,30824,2,4297,20,114182,6,0,4836,128166,0
Total reachable state count : 3.060208234405063831535556313824027607321e+126
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1600,1.18545,30824,2,1021,20,114182,7,0,4842,128166,0
Reachability property apf3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1600,1.18739,30824,2,1021,20,114182,8,0,4848,128166,0
Reachability property apf4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1600,1.18974,30824,2,1021,20,114182,9,0,4853,128166,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 348 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 743 ms.
Product exploration explored 100000 steps with 0 reset in 909 ms.
Built C files in :
/tmp/ltsmin11152557455786958810
[2022-05-20 06:52:18] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11152557455786958810
Running compilation step : cd /tmp/ltsmin11152557455786958810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1458 ms.
Running link step : cd /tmp/ltsmin11152557455786958810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11152557455786958810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9218289240425327876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 839/839 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 839/839 (removed 0) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:33] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:52:34] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:34] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 06:52:35] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
// Phase 1: matrix 839 rows 1000 cols
[2022-05-20 06:52:35] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:52:35] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 839/839 transitions.
Built C files in :
/tmp/ltsmin8364318443847964553
[2022-05-20 06:52:35] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8364318443847964553
Running compilation step : cd /tmp/ltsmin8364318443847964553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1459 ms.
Running link step : cd /tmp/ltsmin8364318443847964553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8364318443847964553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5883879843275789449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 06:52:50] [INFO ] Flatten gal took : 21 ms
[2022-05-20 06:52:50] [INFO ] Flatten gal took : 21 ms
[2022-05-20 06:52:50] [INFO ] Time to serialize gal into /tmp/LTL1196332330143079863.gal : 4 ms
[2022-05-20 06:52:50] [INFO ] Time to serialize properties into /tmp/LTL1344871337551324975.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1196332330143079863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1344871337551324975.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1196332...266
Read 1 LTL properties
Checking formula 0 : !((F(G(((X("((p250==0)||(p2079==1))"))||("(p1746==0)"))||("(p80==1)")))))
Formula 0 simplified : !FG("(p80==1)" | "(p1746==0)" | X"((p250==0)||(p2079==1))")
Detected timeout of ITS tools.
[2022-05-20 06:53:05] [INFO ] Flatten gal took : 22 ms
[2022-05-20 06:53:05] [INFO ] Applying decomposition
[2022-05-20 06:53:05] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7289926944923365711.txt' '-o' '/tmp/graph7289926944923365711.bin' '-w' '/tmp/graph7289926944923365711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7289926944923365711.bin' '-l' '-1' '-v' '-w' '/tmp/graph7289926944923365711.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:53:05] [INFO ] Decomposing Gal with order
[2022-05-20 06:53:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:53:06] [INFO ] Removed a total of 246 redundant transitions.
[2022-05-20 06:53:06] [INFO ] Flatten gal took : 39 ms
[2022-05-20 06:53:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 5 ms.
[2022-05-20 06:53:06] [INFO ] Time to serialize gal into /tmp/LTL11210546045244604496.gal : 5 ms
[2022-05-20 06:53:06] [INFO ] Time to serialize properties into /tmp/LTL721388820864893609.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11210546045244604496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL721388820864893609.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1121054...245
Read 1 LTL properties
Checking formula 0 : !((F(G(((X("((i2.u26.p250==0)||(i26.u218.p2079==1))"))||("(i22.u180.p1746==0)"))||("(i0.u8.p80==1)")))))
Formula 0 simplified : !FG("(i0.u8.p80==1)" | "(i22.u180.p1746==0)" | X"((i2.u26.p250==0)||(i26.u218.p2079==1))")
Reverse transition relation is NOT exact ! Due to transitions i2.t6, i2.u26.t122, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 6.79862e+65 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
137 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48092,56972,1,0,95095,516,6077,144903,708,2899,178780
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-12 finished in 80431 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 06:53:07] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2542729022114263165
[2022-05-20 06:53:07] [INFO ] Too many transitions (2411) to apply POR reductions. Disabling POR matrices.
[2022-05-20 06:53:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2542729022114263165
Running compilation step : cd /tmp/ltsmin2542729022114263165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 06:53:07] [INFO ] Applying decomposition
[2022-05-20 06:53:07] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14997489158203654583.txt' '-o' '/tmp/graph14997489158203654583.bin' '-w' '/tmp/graph14997489158203654583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14997489158203654583.bin' '-l' '-1' '-v' '-w' '/tmp/graph14997489158203654583.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:53:08] [INFO ] Decomposing Gal with order
[2022-05-20 06:53:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:53:08] [INFO ] Removed a total of 395 redundant transitions.
[2022-05-20 06:53:08] [INFO ] Flatten gal took : 103 ms
[2022-05-20 06:53:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 06:53:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality6650991032868650040.gal : 16 ms
[2022-05-20 06:53:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality14287697927174968417.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6650991032868650040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14287697927174968417.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((X(X((!(F(("(i0.u855.p2754==1)")U("((i22.u483.p1540==0)||(i19.u410.p1309==1))"))))U(X((G("(i0.u855.p2754==1)"))U("((i35.u841.p2706==...186
Formula 0 simplified : !XX(!F("(i0.u855.p2754==1)" U "((i22.u483.p1540==0)||(i19.u410.p1309==1))") U X(G"(i0.u855.p2754==1)" U "((i35.u841.p2706==0)||(i10....172
Compilation finished in 5257 ms.
Running link step : cd /tmp/ltsmin2542729022114263165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2542729022114263165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((!<>(((LTLAPp0==true) U (LTLAPp1==true))) U X(([]((LTLAPp0==true)) U (LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 666 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 654872 ms.
BK_STOP 1653029593958
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-040B, 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 r222-tall-165286025600667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 ;