About the Execution of ITS-Tools for CloudReconfiguration-PT-315
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1747.836 | 182220.00 | 266715.00 | 950.80 | FFFFTFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r101-tall-167814474900115.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CloudReconfiguration-PT-315, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814474900115
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678229535804
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-07 22:52:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 22:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 22:52:17] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-07 22:52:17] [INFO ] Transformed 2585 places.
[2023-03-07 22:52:17] [INFO ] Transformed 3095 transitions.
[2023-03-07 22:52:17] [INFO ] Found NUPN structural information;
[2023-03-07 22:52:17] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 512 places :
Symmetric choice reduction at 0 with 512 rule applications. Total rules 512 place count 2073 transition count 2583
Iterating global reduction 0 with 512 rules applied. Total rules applied 1024 place count 2073 transition count 2583
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1053 place count 2073 transition count 2554
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1290 place count 1836 transition count 2317
Iterating global reduction 1 with 237 rules applied. Total rules applied 1527 place count 1836 transition count 2317
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 1613 place count 1750 transition count 2231
Iterating global reduction 1 with 86 rules applied. Total rules applied 1699 place count 1750 transition count 2231
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1717 place count 1750 transition count 2213
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1763 place count 1704 transition count 2167
Iterating global reduction 2 with 46 rules applied. Total rules applied 1809 place count 1704 transition count 2167
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1818 place count 1704 transition count 2158
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1853 place count 1669 transition count 2118
Iterating global reduction 3 with 35 rules applied. Total rules applied 1888 place count 1669 transition count 2118
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1910 place count 1647 transition count 2096
Iterating global reduction 3 with 22 rules applied. Total rules applied 1932 place count 1647 transition count 2096
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1952 place count 1627 transition count 2076
Iterating global reduction 3 with 20 rules applied. Total rules applied 1972 place count 1627 transition count 2076
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1991 place count 1608 transition count 2057
Iterating global reduction 3 with 19 rules applied. Total rules applied 2010 place count 1608 transition count 2057
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2026 place count 1592 transition count 2030
Iterating global reduction 3 with 16 rules applied. Total rules applied 2042 place count 1592 transition count 2030
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2048 place count 1586 transition count 2020
Iterating global reduction 3 with 6 rules applied. Total rules applied 2054 place count 1586 transition count 2020
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2060 place count 1580 transition count 2013
Iterating global reduction 3 with 6 rules applied. Total rules applied 2066 place count 1580 transition count 2013
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2069 place count 1580 transition count 2010
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2070 place count 1579 transition count 2009
Iterating global reduction 4 with 1 rules applied. Total rules applied 2071 place count 1579 transition count 2009
Applied a total of 2071 rules in 1413 ms. Remains 1579 /2585 variables (removed 1006) and now considering 2009/3095 (removed 1086) transitions.
// Phase 1: matrix 2009 rows 1579 cols
[2023-03-07 22:52:19] [INFO ] Computed 4 place invariants in 31 ms
[2023-03-07 22:52:19] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-07 22:52:19] [INFO ] Invariant cache hit.
[2023-03-07 22:52:20] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2023-03-07 22:52:20] [INFO ] Invariant cache hit.
[2023-03-07 22:52:21] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1579/2585 places, 2009/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3716 ms. Remains : 1579/2585 places, 2009/3095 transitions.
Support contains 35 out of 1579 places after structural reductions.
[2023-03-07 22:52:21] [INFO ] Flatten gal took : 128 ms
[2023-03-07 22:52:21] [INFO ] Flatten gal took : 71 ms
[2023-03-07 22:52:22] [INFO ] Input system was already deterministic with 2009 transitions.
Support contains 33 out of 1579 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-07 22:52:22] [INFO ] Invariant cache hit.
[2023-03-07 22:52:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 22:52:24] [INFO ] After 1343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-07 22:52:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-07 22:52:26] [INFO ] After 1698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-07 22:52:28] [INFO ] After 3602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2023-03-07 22:52:29] [INFO ] After 5632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 11 properties in 193 ms.
Support contains 10 out of 1579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Graph (trivial) has 1899 edges and 1579 vertex of which 684 / 1579 are part of one of the 63 SCC in 7 ms
Free SCC test removed 621 places
Drop transitions removed 784 transitions
Reduce isomorphic transitions removed 784 transitions.
Graph (complete) has 1400 edges and 958 vertex of which 949 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 534 transitions
Trivial Post-agglo rules discarded 534 transitions
Performed 534 trivial Post agglomeration. Transition count delta: 534
Iterating post reduction 0 with 541 rules applied. Total rules applied 543 place count 949 transition count 680
Reduce places removed 534 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 592 rules applied. Total rules applied 1135 place count 415 transition count 622
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 39 rules applied. Total rules applied 1174 place count 378 transition count 620
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1176 place count 376 transition count 620
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1176 place count 376 transition count 573
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1270 place count 329 transition count 573
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1281 place count 318 transition count 560
Iterating global reduction 4 with 11 rules applied. Total rules applied 1292 place count 318 transition count 560
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1292 place count 318 transition count 558
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1296 place count 316 transition count 558
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1304 place count 308 transition count 547
Iterating global reduction 4 with 8 rules applied. Total rules applied 1312 place count 308 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1317 place count 308 transition count 542
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1319 place count 306 transition count 534
Iterating global reduction 5 with 2 rules applied. Total rules applied 1321 place count 306 transition count 534
Performed 163 Post agglomeration using F-continuation condition with reduction of 105 identical transitions.
Deduced a syphon composed of 163 places in 1 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 5 with 326 rules applied. Total rules applied 1647 place count 143 transition count 266
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1664 place count 143 transition count 249
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1667 place count 140 transition count 246
Iterating global reduction 6 with 3 rules applied. Total rules applied 1670 place count 140 transition count 246
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1671 place count 139 transition count 245
Iterating global reduction 6 with 1 rules applied. Total rules applied 1672 place count 139 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1673 place count 139 transition count 244
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1691 place count 130 transition count 235
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1702 place count 130 transition count 224
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 8 with 2 rules applied. Total rules applied 1704 place count 129 transition count 223
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1705 place count 129 transition count 222
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 1775 place count 94 transition count 258
Drop transitions removed 21 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 9 with 45 rules applied. Total rules applied 1820 place count 94 transition count 213
Discarding 23 places :
Symmetric choice reduction at 10 with 23 rule applications. Total rules 1843 place count 71 transition count 179
Iterating global reduction 10 with 23 rules applied. Total rules applied 1866 place count 71 transition count 179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1878 place count 71 transition count 167
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1883 place count 66 transition count 157
Iterating global reduction 11 with 5 rules applied. Total rules applied 1888 place count 66 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1893 place count 66 transition count 152
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 1915 place count 66 transition count 130
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1916 place count 65 transition count 127
Iterating global reduction 12 with 1 rules applied. Total rules applied 1917 place count 65 transition count 127
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1918 place count 64 transition count 126
Iterating global reduction 12 with 1 rules applied. Total rules applied 1919 place count 64 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1920 place count 64 transition count 125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1921 place count 64 transition count 124
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1925 place count 64 transition count 120
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1930 place count 60 transition count 119
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1932 place count 60 transition count 117
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1933 place count 59 transition count 116
Iterating global reduction 14 with 1 rules applied. Total rules applied 1934 place count 59 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1936 place count 59 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1937 place count 59 transition count 116
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1938 place count 59 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1939 place count 58 transition count 114
Applied a total of 1939 rules in 156 ms. Remains 58 /1579 variables (removed 1521) and now considering 114/2009 (removed 1895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 58/1579 places, 114/2009 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-07 22:52:30] [INFO ] Flow matrix only has 109 transitions (discarded 5 similar events)
// Phase 1: matrix 109 rows 58 cols
[2023-03-07 22:52:30] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-07 22:52:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 22:52:30] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 22:52:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 22:52:30] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 22:52:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 22:52:30] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-07 22:52:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2023-03-07 22:52:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-07 22:52:30] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-07 22:52:30] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2188 edges and 1579 vertex of which 1570 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((F(G(p1))&&(F(G(p3))||p2)))))))'
Support contains 5 out of 1579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1561 transition count 1991
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1561 transition count 1991
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1549 transition count 1978
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1549 transition count 1978
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 1542 transition count 1971
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 1542 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1537 transition count 1965
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1537 transition count 1965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 1534 transition count 1962
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 1534 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 1531 transition count 1959
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 1531 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 1528 transition count 1956
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 1528 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 1525 transition count 1951
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 1525 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 1524 transition count 1949
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 1524 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 1523 transition count 1948
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 1523 transition count 1948
Applied a total of 112 rules in 544 ms. Remains 1523 /1579 variables (removed 56) and now considering 1948/2009 (removed 61) transitions.
// Phase 1: matrix 1948 rows 1523 cols
[2023-03-07 22:52:31] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-07 22:52:31] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-07 22:52:31] [INFO ] Invariant cache hit.
[2023-03-07 22:52:32] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2023-03-07 22:52:32] [INFO ] Invariant cache hit.
[2023-03-07 22:52:33] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1523/1579 places, 1948/2009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2451 ms. Remains : 1523/1579 places, 1948/2009 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 6}, { cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s640 1), p2:(OR (EQ s1475 0) (EQ s1438 1)), p1:(OR (EQ s1475 0) (EQ s1438 1)), p3:(OR (EQ s633 0) (EQ s553 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-00 finished in 2941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Graph (trivial) has 1917 edges and 1579 vertex of which 698 / 1579 are part of one of the 63 SCC in 4 ms
Free SCC test removed 635 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1446 edges and 944 vertex of which 935 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 523 transitions
Trivial Post-agglo rules discarded 523 transitions
Performed 523 trivial Post agglomeration. Transition count delta: 523
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 934 transition count 743
Reduce places removed 523 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 545 rules applied. Total rules applied 1070 place count 411 transition count 721
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1080 place count 401 transition count 721
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1080 place count 401 transition count 676
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1170 place count 356 transition count 676
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1185 place count 341 transition count 654
Iterating global reduction 3 with 15 rules applied. Total rules applied 1200 place count 341 transition count 654
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1200 place count 341 transition count 653
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 1202 place count 340 transition count 653
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1213 place count 329 transition count 637
Iterating global reduction 3 with 11 rules applied. Total rules applied 1224 place count 329 transition count 637
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1229 place count 329 transition count 632
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1231 place count 327 transition count 628
Iterating global reduction 4 with 2 rules applied. Total rules applied 1233 place count 327 transition count 628
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1234 place count 326 transition count 626
Iterating global reduction 4 with 1 rules applied. Total rules applied 1235 place count 326 transition count 626
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1236 place count 325 transition count 624
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 325 transition count 624
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1238 place count 324 transition count 622
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 324 transition count 622
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1240 place count 323 transition count 620
Iterating global reduction 4 with 1 rules applied. Total rules applied 1241 place count 323 transition count 620
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1242 place count 322 transition count 613
Iterating global reduction 4 with 1 rules applied. Total rules applied 1243 place count 322 transition count 613
Performed 158 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 316 rules applied. Total rules applied 1559 place count 164 transition count 365
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1570 place count 164 transition count 354
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1575 place count 159 transition count 347
Iterating global reduction 5 with 5 rules applied. Total rules applied 1580 place count 159 transition count 347
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1582 place count 157 transition count 344
Iterating global reduction 5 with 2 rules applied. Total rules applied 1584 place count 157 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1585 place count 157 transition count 343
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1586 place count 156 transition count 341
Iterating global reduction 6 with 1 rules applied. Total rules applied 1587 place count 156 transition count 341
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1588 place count 155 transition count 339
Iterating global reduction 6 with 1 rules applied. Total rules applied 1589 place count 155 transition count 339
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1590 place count 154 transition count 337
Iterating global reduction 6 with 1 rules applied. Total rules applied 1591 place count 154 transition count 337
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1592 place count 153 transition count 330
Iterating global reduction 6 with 1 rules applied. Total rules applied 1593 place count 153 transition count 330
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1613 place count 143 transition count 320
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1625 place count 143 transition count 308
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1659 place count 126 transition count 342
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1676 place count 126 transition count 325
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1685 place count 117 transition count 307
Iterating global reduction 8 with 9 rules applied. Total rules applied 1694 place count 117 transition count 307
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1700 place count 117 transition count 301
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 1736 place count 117 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1737 place count 116 transition count 264
Applied a total of 1737 rules in 123 ms. Remains 116 /1579 variables (removed 1463) and now considering 264/2009 (removed 1745) transitions.
[2023-03-07 22:52:33] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 116 cols
[2023-03-07 22:52:33] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 22:52:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 22:52:33] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
[2023-03-07 22:52:33] [INFO ] Invariant cache hit.
[2023-03-07 22:52:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 22:52:33] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [43, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1579 places, 264/2009 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 262
Applied a total of 2 rules in 8 ms. Remains 112 /114 variables (removed 2) and now considering 262/264 (removed 2) transitions.
[2023-03-07 22:52:33] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 112 cols
[2023-03-07 22:52:33] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 22:52:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-07 22:52:33] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2023-03-07 22:52:33] [INFO ] Invariant cache hit.
[2023-03-07 22:52:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 22:52:33] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1579 places, 262/2009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 112/1579 places, 262/2009 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-01 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 3 out of 1579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Graph (trivial) has 1913 edges and 1579 vertex of which 698 / 1579 are part of one of the 63 SCC in 3 ms
Free SCC test removed 635 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1446 edges and 944 vertex of which 935 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 522 transitions
Trivial Post-agglo rules discarded 522 transitions
Performed 522 trivial Post agglomeration. Transition count delta: 522
Iterating post reduction 0 with 522 rules applied. Total rules applied 524 place count 934 transition count 744
Reduce places removed 522 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 544 rules applied. Total rules applied 1068 place count 412 transition count 722
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 1079 place count 402 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1080 place count 401 transition count 721
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1080 place count 401 transition count 677
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1168 place count 357 transition count 677
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1184 place count 341 transition count 654
Iterating global reduction 4 with 16 rules applied. Total rules applied 1200 place count 341 transition count 654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1201 place count 341 transition count 653
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1201 place count 341 transition count 651
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1205 place count 339 transition count 651
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1216 place count 328 transition count 635
Iterating global reduction 5 with 11 rules applied. Total rules applied 1227 place count 328 transition count 635
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1232 place count 328 transition count 630
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1234 place count 326 transition count 626
Iterating global reduction 6 with 2 rules applied. Total rules applied 1236 place count 326 transition count 626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1237 place count 325 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 1238 place count 325 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1239 place count 324 transition count 622
Iterating global reduction 6 with 1 rules applied. Total rules applied 1240 place count 324 transition count 622
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1241 place count 323 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 1242 place count 323 transition count 620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1243 place count 322 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 1244 place count 322 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1245 place count 321 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 1246 place count 321 transition count 611
Performed 155 Post agglomeration using F-continuation condition with reduction of 88 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 6 with 310 rules applied. Total rules applied 1556 place count 166 transition count 368
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1567 place count 166 transition count 357
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1571 place count 162 transition count 352
Iterating global reduction 7 with 4 rules applied. Total rules applied 1575 place count 162 transition count 352
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1576 place count 161 transition count 351
Iterating global reduction 7 with 1 rules applied. Total rules applied 1577 place count 161 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1578 place count 161 transition count 350
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1596 place count 152 transition count 341
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1607 place count 152 transition count 330
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1608 place count 151 transition count 328
Iterating global reduction 9 with 1 rules applied. Total rules applied 1609 place count 151 transition count 328
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1647 place count 132 transition count 365
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1667 place count 132 transition count 345
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1676 place count 123 transition count 327
Iterating global reduction 10 with 9 rules applied. Total rules applied 1685 place count 123 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1690 place count 123 transition count 322
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 11 with 43 rules applied. Total rules applied 1733 place count 123 transition count 279
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1735 place count 123 transition count 279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1736 place count 123 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1737 place count 122 transition count 277
Applied a total of 1737 rules in 121 ms. Remains 122 /1579 variables (removed 1457) and now considering 277/2009 (removed 1732) transitions.
[2023-03-07 22:52:34] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
// Phase 1: matrix 218 rows 122 cols
[2023-03-07 22:52:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 22:52:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 22:52:34] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2023-03-07 22:52:34] [INFO ] Invariant cache hit.
[2023-03-07 22:52:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 22:52:34] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [47, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 145 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1579 places, 277/2009 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 275
Applied a total of 2 rules in 8 ms. Remains 118 /120 variables (removed 2) and now considering 275/277 (removed 2) transitions.
[2023-03-07 22:52:34] [INFO ] Flow matrix only has 216 transitions (discarded 59 similar events)
// Phase 1: matrix 216 rows 118 cols
[2023-03-07 22:52:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 22:52:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-07 22:52:34] [INFO ] Flow matrix only has 216 transitions (discarded 59 similar events)
[2023-03-07 22:52:34] [INFO ] Invariant cache hit.
[2023-03-07 22:52:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 22:52:34] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1579 places, 275/2009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 118/1579 places, 275/2009 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s80 1), p1:(AND (NEQ s12 0) (NEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-02 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 5 out of 1579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1560 transition count 1990
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1560 transition count 1990
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 1547 transition count 1976
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 1547 transition count 1976
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 1538 transition count 1967
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 1538 transition count 1967
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 1531 transition count 1958
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 1531 transition count 1958
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 1527 transition count 1954
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 1527 transition count 1954
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 1523 transition count 1950
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 1523 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 1519 transition count 1946
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 1519 transition count 1946
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 1515 transition count 1940
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 1513 transition count 1936
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 1513 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 1511 transition count 1933
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 1510 transition count 1932
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 1510 transition count 1932
Applied a total of 138 rules in 604 ms. Remains 1510 /1579 variables (removed 69) and now considering 1932/2009 (removed 77) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2023-03-07 22:52:35] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-07 22:52:35] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-07 22:52:35] [INFO ] Invariant cache hit.
[2023-03-07 22:52:36] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2023-03-07 22:52:36] [INFO ] Invariant cache hit.
[2023-03-07 22:52:37] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1579 places, 1932/2009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2449 ms. Remains : 1510/1579 places, 1932/2009 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s1018 0) (OR (EQ s460 0) (EQ s1275 1))), p0:(OR (EQ s1316 0) (EQ s462 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1200 ms.
Product exploration explored 100000 steps with 50000 reset in 1072 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2109 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
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 5 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-315-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-04 finished in 4968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&(!p1||F(!p2))))))'
Support contains 5 out of 1579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Graph (trivial) has 1910 edges and 1579 vertex of which 678 / 1579 are part of one of the 63 SCC in 4 ms
Free SCC test removed 615 places
Ensure Unique test removed 714 transitions
Reduce isomorphic transitions removed 714 transitions.
Graph (complete) has 1471 edges and 964 vertex of which 955 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 531 transitions
Trivial Post-agglo rules discarded 531 transitions
Performed 531 trivial Post agglomeration. Transition count delta: 531
Iterating post reduction 0 with 531 rules applied. Total rules applied 533 place count 954 transition count 758
Reduce places removed 531 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 556 rules applied. Total rules applied 1089 place count 423 transition count 733
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1102 place count 411 transition count 732
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1103 place count 410 transition count 732
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1103 place count 410 transition count 686
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1195 place count 364 transition count 686
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1209 place count 350 transition count 666
Iterating global reduction 4 with 14 rules applied. Total rules applied 1223 place count 350 transition count 666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1223 place count 350 transition count 664
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 1227 place count 348 transition count 664
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1235 place count 340 transition count 652
Iterating global reduction 4 with 8 rules applied. Total rules applied 1243 place count 340 transition count 652
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1246 place count 340 transition count 649
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1248 place count 338 transition count 645
Iterating global reduction 5 with 2 rules applied. Total rules applied 1250 place count 338 transition count 645
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1251 place count 337 transition count 643
Iterating global reduction 5 with 1 rules applied. Total rules applied 1252 place count 337 transition count 643
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1253 place count 336 transition count 641
Iterating global reduction 5 with 1 rules applied. Total rules applied 1254 place count 336 transition count 641
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1255 place count 335 transition count 639
Iterating global reduction 5 with 1 rules applied. Total rules applied 1256 place count 335 transition count 639
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1257 place count 334 transition count 637
Iterating global reduction 5 with 1 rules applied. Total rules applied 1258 place count 334 transition count 637
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1259 place count 333 transition count 630
Iterating global reduction 5 with 1 rules applied. Total rules applied 1260 place count 333 transition count 630
Performed 158 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 316 rules applied. Total rules applied 1576 place count 175 transition count 385
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1590 place count 175 transition count 371
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1595 place count 170 transition count 364
Iterating global reduction 6 with 5 rules applied. Total rules applied 1600 place count 170 transition count 364
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1602 place count 168 transition count 361
Iterating global reduction 6 with 2 rules applied. Total rules applied 1604 place count 168 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1605 place count 168 transition count 360
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1606 place count 167 transition count 358
Iterating global reduction 7 with 1 rules applied. Total rules applied 1607 place count 167 transition count 358
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1608 place count 166 transition count 356
Iterating global reduction 7 with 1 rules applied. Total rules applied 1609 place count 166 transition count 356
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1610 place count 165 transition count 354
Iterating global reduction 7 with 1 rules applied. Total rules applied 1611 place count 165 transition count 354
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1629 place count 156 transition count 345
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1640 place count 156 transition count 334
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1676 place count 138 transition count 370
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1695 place count 138 transition count 351
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1704 place count 129 transition count 333
Iterating global reduction 9 with 9 rules applied. Total rules applied 1713 place count 129 transition count 333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1719 place count 129 transition count 327
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1759 place count 129 transition count 287
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1760 place count 129 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1761 place count 128 transition count 286
Applied a total of 1761 rules in 96 ms. Remains 128 /1579 variables (removed 1451) and now considering 286/2009 (removed 1723) transitions.
[2023-03-07 22:52:39] [INFO ] Flow matrix only has 229 transitions (discarded 57 similar events)
// Phase 1: matrix 229 rows 128 cols
[2023-03-07 22:52:39] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 22:52:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-07 22:52:39] [INFO ] Flow matrix only has 229 transitions (discarded 57 similar events)
[2023-03-07 22:52:39] [INFO ] Invariant cache hit.
[2023-03-07 22:52:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 22:52:39] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [53, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 159 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/1579 places, 286/2009 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 284
Applied a total of 2 rules in 6 ms. Remains 124 /126 variables (removed 2) and now considering 284/286 (removed 2) transitions.
[2023-03-07 22:52:39] [INFO ] Flow matrix only has 227 transitions (discarded 57 similar events)
// Phase 1: matrix 227 rows 124 cols
[2023-03-07 22:52:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-07 22:52:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-07 22:52:39] [INFO ] Flow matrix only has 227 transitions (discarded 57 similar events)
[2023-03-07 22:52:39] [INFO ] Invariant cache hit.
[2023-03-07 22:52:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 22:52:39] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/1579 places, 284/2009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 124/1579 places, 284/2009 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p2, (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(OR (EQ s15 0) (EQ s50 1)), p0:(NEQ s9 1), p1:(OR (EQ s84 0) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 279 steps with 28 reset in 4 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-05 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((G(p1)||X(p0)))||(!p1&&(G(p1)||X(p0))))))'
Support contains 3 out of 1579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1559 transition count 1989
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1559 transition count 1989
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 1546 transition count 1975
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 1546 transition count 1975
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1537 transition count 1966
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1537 transition count 1966
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 1530 transition count 1957
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 1530 transition count 1957
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 1526 transition count 1953
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 1526 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 1522 transition count 1949
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 1522 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 1518 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 1518 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 1514 transition count 1939
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 1512 transition count 1935
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 1512 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 1510 transition count 1932
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 1509 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 1509 transition count 1931
Applied a total of 140 rules in 632 ms. Remains 1509 /1579 variables (removed 70) and now considering 1931/2009 (removed 78) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2023-03-07 22:52:40] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-07 22:52:40] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-07 22:52:40] [INFO ] Invariant cache hit.
[2023-03-07 22:52:41] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-03-07 22:52:41] [INFO ] Invariant cache hit.
[2023-03-07 22:52:42] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1579 places, 1931/2009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2457 ms. Remains : 1509/1579 places, 1931/2009 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s526 1), p1:(OR (EQ s436 0) (EQ s703 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 758 reset in 199 ms.
Product exploration explored 100000 steps with 779 reset in 271 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 575 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-07 22:52:44] [INFO ] Invariant cache hit.
[2023-03-07 22:52:44] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 22:52:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-07 22:52:45] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-07 22:52:45] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-07 22:52:45] [INFO ] After 1250ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 533 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 53 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2023-03-07 22:52:46] [INFO ] Invariant cache hit.
[2023-03-07 22:52:46] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-07 22:52:46] [INFO ] Invariant cache hit.
[2023-03-07 22:52:47] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2023-03-07 22:52:47] [INFO ] Invariant cache hit.
[2023-03-07 22:52:48] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1868 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 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 22 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 319002 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319002 steps, saw 91425 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-07 22:52:52] [INFO ] Invariant cache hit.
[2023-03-07 22:52:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-07 22:52:53] [INFO ] After 596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-07 22:52:53] [INFO ] After 700ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-07 22:52:53] [INFO ] After 997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-07 22:52:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-07 22:52:54] [INFO ] After 752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 22:52:54] [INFO ] After 1039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-07 22:52:54] [INFO ] After 1465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 780 reset in 135 ms.
Product exploration explored 100000 steps with 777 reset in 151 ms.
Applying partial POR strategy [true, true, false, true, false]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Graph (trivial) has 1838 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 6 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1371 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 870 transition count 1194
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 486 place count 870 transition count 1183
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 486 place count 870 transition count 1195
Deduced a syphon composed of 493 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 506 place count 870 transition count 1195
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 786 place count 590 transition count 905
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 1066 place count 590 transition count 905
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1077 place count 579 transition count 890
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1088 place count 579 transition count 890
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1093 place count 579 transition count 885
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1104 place count 568 transition count 874
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1115 place count 568 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1117 place count 566 transition count 870
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 566 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1121 place count 564 transition count 866
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1123 place count 564 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1127 place count 560 transition count 862
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1131 place count 560 transition count 862
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1133 place count 558 transition count 858
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1135 place count 558 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1137 place count 556 transition count 854
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 556 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1143 place count 552 transition count 848
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1147 place count 552 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1151 place count 548 transition count 832
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1155 place count 548 transition count 832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1156 place count 548 transition count 832
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1160 place count 544 transition count 828
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1164 place count 544 transition count 828
Performed 104 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 314 places in 0 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1268 place count 544 transition count 901
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1306 place count 544 transition count 863
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1406 place count 444 transition count 753
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1506 place count 444 transition count 753
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1512 place count 438 transition count 744
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1518 place count 438 transition count 744
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1525 place count 438 transition count 744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1529 place count 438 transition count 740
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1544 place count 423 transition count 721
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1559 place count 423 transition count 721
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1565 place count 423 transition count 715
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1569 place count 419 transition count 711
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1573 place count 419 transition count 711
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1576 place count 419 transition count 711
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1582 place count 419 transition count 705
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1585 place count 416 transition count 702
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1588 place count 416 transition count 702
Performed 71 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1659 place count 416 transition count 1032
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1780 place count 416 transition count 911
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 1904 place count 292 transition count 578
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 9 with 124 rules applied. Total rules applied 2028 place count 292 transition count 578
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 2045 place count 292 transition count 561
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2072 place count 265 transition count 504
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2099 place count 265 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2101 place count 265 transition count 536
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2103 place count 263 transition count 518
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2105 place count 263 transition count 518
Deduced a syphon composed of 139 places in 0 ms
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 2151 place count 263 transition count 472
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2155 place count 259 transition count 468
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2159 place count 259 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2162 place count 259 transition count 528
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2165 place count 256 transition count 513
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2168 place count 256 transition count 513
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 2168 rules in 319 ms. Remains 256 /1509 variables (removed 1253) and now considering 513/1931 (removed 1418) transitions.
[2023-03-07 22:52:56] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-07 22:52:56] [INFO ] Flow matrix only has 456 transitions (discarded 57 similar events)
// Phase 1: matrix 456 rows 256 cols
[2023-03-07 22:52:56] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 22:52:56] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1509 places, 513/1931 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 256/1509 places, 513/1931 transitions.
Built C files in :
/tmp/ltsmin699500775436394114
[2023-03-07 22:52:56] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin699500775436394114
Running compilation step : cd /tmp/ltsmin699500775436394114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin699500775436394114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin699500775436394114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 57 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2023-03-07 22:52:59] [INFO ] Computed 4 place invariants in 14 ms
[2023-03-07 22:52:59] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-07 22:52:59] [INFO ] Invariant cache hit.
[2023-03-07 22:53:00] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2023-03-07 22:53:00] [INFO ] Invariant cache hit.
[2023-03-07 22:53:01] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1893 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Built C files in :
/tmp/ltsmin16498133177165779121
[2023-03-07 22:53:01] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16498133177165779121
Running compilation step : cd /tmp/ltsmin16498133177165779121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16498133177165779121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16498133177165779121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 22:53:04] [INFO ] Flatten gal took : 56 ms
[2023-03-07 22:53:04] [INFO ] Flatten gal took : 47 ms
[2023-03-07 22:53:04] [INFO ] Time to serialize gal into /tmp/LTL1808313841988319317.gal : 12 ms
[2023-03-07 22:53:04] [INFO ] Time to serialize properties into /tmp/LTL18188966347026892011.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1808313841988319317.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15110467597405269828.hoa' '-atoms' '/tmp/LTL18188966347026892011.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18188966347026892011.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15110467597405269828.hoa
Detected timeout of ITS tools.
[2023-03-07 22:53:19] [INFO ] Flatten gal took : 44 ms
[2023-03-07 22:53:19] [INFO ] Flatten gal took : 43 ms
[2023-03-07 22:53:19] [INFO ] Time to serialize gal into /tmp/LTL11058026806038564422.gal : 7 ms
[2023-03-07 22:53:19] [INFO ] Time to serialize properties into /tmp/LTL10936962229143911631.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11058026806038564422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10936962229143911631.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X("(p913!=1)"))U((G((X("(p913!=1)"))||(G("((p781==0)||(p1259==1))"))))||((!("((p781==0)||(p1259==1))"))&&((X("(p913!=1)"))||(G("((...184
Formula 0 simplified : X!"(p913!=1)" R (F(X!"(p913!=1)" & F!"((p781==0)||(p1259==1))") & ("((p781==0)||(p1259==1))" | (X!"(p913!=1)" & F!"((p781==0)||(p125...165
Detected timeout of ITS tools.
[2023-03-07 22:53:35] [INFO ] Flatten gal took : 34 ms
[2023-03-07 22:53:35] [INFO ] Applying decomposition
[2023-03-07 22:53:35] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17544455448567650730.txt' '-o' '/tmp/graph17544455448567650730.bin' '-w' '/tmp/graph17544455448567650730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17544455448567650730.bin' '-l' '-1' '-v' '-w' '/tmp/graph17544455448567650730.weights' '-q' '0' '-e' '0.001'
[2023-03-07 22:53:35] [INFO ] Decomposing Gal with order
[2023-03-07 22:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 22:53:35] [INFO ] Removed a total of 514 redundant transitions.
[2023-03-07 22:53:35] [INFO ] Flatten gal took : 115 ms
[2023-03-07 22:53:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 25 ms.
[2023-03-07 22:53:35] [INFO ] Time to serialize gal into /tmp/LTL1539096952480826573.gal : 18 ms
[2023-03-07 22:53:35] [INFO ] Time to serialize properties into /tmp/LTL8153291404080204597.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1539096952480826573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8153291404080204597.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X("(i16.i0.i0.u204.p913!=1)"))U((G((X("(i16.i0.i0.u204.p913!=1)"))||(G("((i12.i0.i2.u168.p781==0)||(i18.i0.i4.u272.p1259==1))"))))...319
Formula 0 simplified : X!"(i16.i0.i0.u204.p913!=1)" R (F(X!"(i16.i0.i0.u204.p913!=1)" & F!"((i12.i0.i2.u168.p781==0)||(i18.i0.i4.u272.p1259==1))") & ("((i1...300
Reverse transition relation is NOT exact ! Due to transitions t26, t199, t282, t314, t393, t464, t710, t762, t823, t872, t998, t1174, t1204, t1256, t1288, ...2105
Computing Next relation with stutter on 89440 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2760770901532937776
[2023-03-07 22:53:50] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2760770901532937776
Running compilation step : cd /tmp/ltsmin2760770901532937776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2760770901532937776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2760770901532937776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-06 finished in 73717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1559 transition count 1989
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1559 transition count 1989
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 1545 transition count 1974
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 1545 transition count 1974
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 1536 transition count 1965
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 1536 transition count 1965
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 1529 transition count 1956
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 1529 transition count 1956
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 1525 transition count 1952
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 1525 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 1521 transition count 1948
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 1521 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 1517 transition count 1944
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 1517 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 128 place count 1513 transition count 1938
Iterating global reduction 0 with 4 rules applied. Total rules applied 132 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 1511 transition count 1934
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 1510 transition count 1933
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 1510 transition count 1933
Applied a total of 138 rules in 527 ms. Remains 1510 /1579 variables (removed 69) and now considering 1933/2009 (removed 76) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2023-03-07 22:53:54] [INFO ] Computed 4 place invariants in 16 ms
[2023-03-07 22:53:54] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-07 22:53:54] [INFO ] Invariant cache hit.
[2023-03-07 22:53:55] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-07 22:53:55] [INFO ] Invariant cache hit.
[2023-03-07 22:53:56] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1579 places, 1933/2009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2347 ms. Remains : 1510/1579 places, 1933/2009 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1442 0) (EQ s882 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 799 reset in 132 ms.
Product exploration explored 100000 steps with 779 reset in 163 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 447315 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447315 steps, saw 120432 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 22:53:59] [INFO ] Invariant cache hit.
[2023-03-07 22:53:59] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 22:54:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-07 22:54:00] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 22:54:00] [INFO ] After 832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-07 22:54:01] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1842 edges and 1510 vertex of which 693 / 1510 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Graph (complete) has 1310 edges and 880 vertex of which 871 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 871 transition count 636
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 550 rules applied. Total rules applied 1050 place count 380 transition count 577
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1088 place count 342 transition count 577
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1088 place count 342 transition count 529
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1184 place count 294 transition count 529
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1195 place count 283 transition count 513
Iterating global reduction 3 with 11 rules applied. Total rules applied 1206 place count 283 transition count 513
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1209 place count 283 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1212 place count 280 transition count 510
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1220 place count 272 transition count 500
Iterating global reduction 5 with 8 rules applied. Total rules applied 1228 place count 272 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1234 place count 272 transition count 494
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1236 place count 270 transition count 482
Iterating global reduction 6 with 2 rules applied. Total rules applied 1238 place count 270 transition count 482
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1239 place count 270 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1240 place count 269 transition count 481
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 8 with 284 rules applied. Total rules applied 1524 place count 127 transition count 243
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 8 with 12 rules applied. Total rules applied 1536 place count 127 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1538 place count 126 transition count 230
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1541 place count 123 transition count 227
Iterating global reduction 10 with 3 rules applied. Total rules applied 1544 place count 123 transition count 227
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1568 place count 111 transition count 212
Drop transitions removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1581 place count 111 transition count 199
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 68 rules applied. Total rules applied 1649 place count 77 transition count 230
Drop transitions removed 33 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 11 with 59 rules applied. Total rules applied 1708 place count 77 transition count 171
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1732 place count 53 transition count 147
Iterating global reduction 12 with 24 rules applied. Total rules applied 1756 place count 53 transition count 147
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1771 place count 53 transition count 132
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1777 place count 47 transition count 120
Iterating global reduction 13 with 6 rules applied. Total rules applied 1783 place count 47 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1788 place count 47 transition count 115
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 14 with 31 rules applied. Total rules applied 1819 place count 47 transition count 84
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1822 place count 44 transition count 75
Iterating global reduction 14 with 3 rules applied. Total rules applied 1825 place count 44 transition count 75
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1828 place count 41 transition count 72
Iterating global reduction 14 with 3 rules applied. Total rules applied 1831 place count 41 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1834 place count 41 transition count 69
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1837 place count 41 transition count 66
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1841 place count 41 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1845 place count 37 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1846 place count 37 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1848 place count 37 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1849 place count 37 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1850 place count 36 transition count 59
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 35 edges and 35 vertex of which 24 / 35 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 16 with 2 rules applied. Total rules applied 1852 place count 20 transition count 59
Drop transitions removed 25 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 17 with 31 rules applied. Total rules applied 1883 place count 20 transition count 28
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 1886 place count 17 transition count 25
Iterating global reduction 18 with 3 rules applied. Total rules applied 1889 place count 17 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 1895 place count 14 transition count 22
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 1902 place count 14 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1903 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1904 place count 13 transition count 14
Applied a total of 1904 rules in 58 ms. Remains 13 /1510 variables (removed 1497) and now considering 14/1933 (removed 1919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 13/1510 places, 14/1933 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 55 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
[2023-03-07 22:54:01] [INFO ] Invariant cache hit.
[2023-03-07 22:54:01] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-07 22:54:01] [INFO ] Invariant cache hit.
[2023-03-07 22:54:02] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2023-03-07 22:54:02] [INFO ] Invariant cache hit.
[2023-03-07 22:54:03] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1841 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449917 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449917 steps, saw 121076 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 22:54:06] [INFO ] Invariant cache hit.
[2023-03-07 22:54:06] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 22:54:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-07 22:54:07] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 22:54:07] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-07 22:54:07] [INFO ] After 1021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 146 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=146 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 763 reset in 126 ms.
Product exploration explored 100000 steps with 778 reset in 132 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1842 edges and 1510 vertex of which 693 / 1510 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1373 edges and 880 vertex of which 871 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 871 transition count 1197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 490 place count 871 transition count 1185
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 490 place count 871 transition count 1197
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 510 place count 871 transition count 1197
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 793 place count 588 transition count 904
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1076 place count 588 transition count 904
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1088 place count 576 transition count 888
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1100 place count 576 transition count 888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1106 place count 576 transition count 882
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1118 place count 564 transition count 870
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1130 place count 564 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1132 place count 562 transition count 866
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 562 transition count 866
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1136 place count 560 transition count 862
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1138 place count 560 transition count 862
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1142 place count 556 transition count 858
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1146 place count 556 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1148 place count 554 transition count 854
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1150 place count 554 transition count 854
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1152 place count 552 transition count 850
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1154 place count 552 transition count 850
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1158 place count 548 transition count 844
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1162 place count 548 transition count 844
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1166 place count 544 transition count 828
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1170 place count 544 transition count 828
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1171 place count 544 transition count 828
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1175 place count 540 transition count 824
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1179 place count 540 transition count 824
Performed 105 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 315 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1284 place count 540 transition count 900
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1322 place count 540 transition count 862
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1422 place count 440 transition count 752
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1522 place count 440 transition count 752
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1527 place count 435 transition count 745
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 1532 place count 435 transition count 745
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1539 place count 435 transition count 745
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1543 place count 435 transition count 741
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1558 place count 420 transition count 722
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1573 place count 420 transition count 722
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1579 place count 420 transition count 716
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1583 place count 416 transition count 712
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1587 place count 416 transition count 712
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1590 place count 416 transition count 712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1596 place count 416 transition count 706
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1599 place count 413 transition count 703
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1602 place count 413 transition count 703
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1672 place count 413 transition count 1019
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 8 with 119 rules applied. Total rules applied 1791 place count 413 transition count 900
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1917 place count 287 transition count 567
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2043 place count 287 transition count 567
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2058 place count 287 transition count 552
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 2083 place count 262 transition count 502
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 25 rules applied. Total rules applied 2108 place count 262 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2111 place count 262 transition count 552
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2114 place count 259 transition count 524
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2117 place count 259 transition count 524
Deduced a syphon composed of 140 places in 0 ms
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 10 with 51 rules applied. Total rules applied 2168 place count 259 transition count 473
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2172 place count 255 transition count 469
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2176 place count 255 transition count 469
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2179 place count 255 transition count 529
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2182 place count 252 transition count 514
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2185 place count 252 transition count 514
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2185 rules in 187 ms. Remains 252 /1510 variables (removed 1258) and now considering 514/1933 (removed 1419) transitions.
[2023-03-07 22:54:08] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-07 22:54:08] [INFO ] Flow matrix only has 457 transitions (discarded 57 similar events)
// Phase 1: matrix 457 rows 252 cols
[2023-03-07 22:54:08] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 22:54:09] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/1510 places, 514/1933 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 252/1510 places, 514/1933 transitions.
Built C files in :
/tmp/ltsmin14156520549324017207
[2023-03-07 22:54:09] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14156520549324017207
Running compilation step : cd /tmp/ltsmin14156520549324017207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14156520549324017207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14156520549324017207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 46 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2023-03-07 22:54:12] [INFO ] Computed 4 place invariants in 14 ms
[2023-03-07 22:54:12] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-07 22:54:12] [INFO ] Invariant cache hit.
[2023-03-07 22:54:13] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2023-03-07 22:54:13] [INFO ] Invariant cache hit.
[2023-03-07 22:54:13] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1828 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Built C files in :
/tmp/ltsmin5116412339785872110
[2023-03-07 22:54:13] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5116412339785872110
Running compilation step : cd /tmp/ltsmin5116412339785872110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5116412339785872110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5116412339785872110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 22:54:17] [INFO ] Flatten gal took : 32 ms
[2023-03-07 22:54:17] [INFO ] Flatten gal took : 33 ms
[2023-03-07 22:54:17] [INFO ] Time to serialize gal into /tmp/LTL9008815970071015182.gal : 6 ms
[2023-03-07 22:54:17] [INFO ] Time to serialize properties into /tmp/LTL14309287988078864303.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9008815970071015182.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13230674513707318594.hoa' '-atoms' '/tmp/LTL14309287988078864303.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14309287988078864303.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13230674513707318594.hoa
Detected timeout of ITS tools.
[2023-03-07 22:54:32] [INFO ] Flatten gal took : 32 ms
[2023-03-07 22:54:32] [INFO ] Flatten gal took : 32 ms
[2023-03-07 22:54:32] [INFO ] Time to serialize gal into /tmp/LTL888277262254248276.gal : 6 ms
[2023-03-07 22:54:32] [INFO ] Time to serialize properties into /tmp/LTL8036483864943122332.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL888277262254248276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8036483864943122332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G("((p2426==0)||(p1514==1))"))))
Formula 0 simplified : XF!"((p2426==0)||(p1514==1))"
Detected timeout of ITS tools.
[2023-03-07 22:54:47] [INFO ] Flatten gal took : 31 ms
[2023-03-07 22:54:47] [INFO ] Applying decomposition
[2023-03-07 22:54:47] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3320758583052931793.txt' '-o' '/tmp/graph3320758583052931793.bin' '-w' '/tmp/graph3320758583052931793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3320758583052931793.bin' '-l' '-1' '-v' '-w' '/tmp/graph3320758583052931793.weights' '-q' '0' '-e' '0.001'
[2023-03-07 22:54:47] [INFO ] Decomposing Gal with order
[2023-03-07 22:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 22:54:47] [INFO ] Removed a total of 538 redundant transitions.
[2023-03-07 22:54:47] [INFO ] Flatten gal took : 99 ms
[2023-03-07 22:54:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 8 ms.
[2023-03-07 22:54:47] [INFO ] Time to serialize gal into /tmp/LTL12710991548866239699.gal : 10 ms
[2023-03-07 22:54:47] [INFO ] Time to serialize properties into /tmp/LTL7571119747800782123.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12710991548866239699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7571119747800782123.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((i37.u585.p2426==0)||(i24.u354.p1514==1))"))))
Formula 0 simplified : XF!"((i37.u585.p2426==0)||(i24.u354.p1514==1))"
Reverse transition relation is NOT exact ! Due to transitions t26, t99, t199, t228, t282, t314, t343, t393, t464, t681, t710, t762, t823, t872, t998, t1174...1602
Computing Next relation with stutter on 89440 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
696 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,7.09609,262284,1,0,421149,11364,18847,996991,589,72222,1978770
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-08 finished in 62096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(X(G((p1 U X(X(!p1))))))))))'
Support contains 4 out of 1579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1558 transition count 1988
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1558 transition count 1988
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 1544 transition count 1973
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 1544 transition count 1973
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 1535 transition count 1964
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 1535 transition count 1964
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 95 place count 1528 transition count 1955
Iterating global reduction 0 with 7 rules applied. Total rules applied 102 place count 1528 transition count 1955
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 1524 transition count 1951
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 1524 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 114 place count 1520 transition count 1947
Iterating global reduction 0 with 4 rules applied. Total rules applied 118 place count 1520 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 1516 transition count 1943
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 1516 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 130 place count 1512 transition count 1937
Iterating global reduction 0 with 4 rules applied. Total rules applied 134 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 1510 transition count 1933
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 1510 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 140 place count 1508 transition count 1930
Iterating global reduction 0 with 2 rules applied. Total rules applied 142 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 1507 transition count 1929
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 1507 transition count 1929
Applied a total of 144 rules in 569 ms. Remains 1507 /1579 variables (removed 72) and now considering 1929/2009 (removed 80) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2023-03-07 22:54:56] [INFO ] Computed 4 place invariants in 23 ms
[2023-03-07 22:54:56] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-07 22:54:56] [INFO ] Invariant cache hit.
[2023-03-07 22:54:57] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2023-03-07 22:54:57] [INFO ] Invariant cache hit.
[2023-03-07 22:54:58] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1579 places, 1929/2009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2371 ms. Remains : 1507/1579 places, 1929/2009 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={} source=8 dest: 2}, { cond=(NOT p0), acceptance={} source=8 dest: 5}]], initial=6, aps=[p0:(OR (EQ s266 0) (EQ s1264 1)), p1:(OR (EQ s1220 0) (EQ s437 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 177 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-10 finished in 2707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1579/1579 places, 2009/2009 transitions.
Graph (trivial) has 1916 edges and 1579 vertex of which 695 / 1579 are part of one of the 63 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1450 edges and 947 vertex of which 938 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 525 transitions
Trivial Post-agglo rules discarded 525 transitions
Performed 525 trivial Post agglomeration. Transition count delta: 525
Iterating post reduction 0 with 525 rules applied. Total rules applied 527 place count 937 transition count 745
Reduce places removed 525 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 547 rules applied. Total rules applied 1074 place count 412 transition count 723
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1084 place count 402 transition count 723
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1084 place count 402 transition count 679
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1172 place count 358 transition count 679
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1189 place count 341 transition count 655
Iterating global reduction 3 with 17 rules applied. Total rules applied 1206 place count 341 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 1208 place count 341 transition count 653
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1209 place count 340 transition count 653
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1209 place count 340 transition count 651
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1213 place count 338 transition count 651
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1224 place count 327 transition count 635
Iterating global reduction 5 with 11 rules applied. Total rules applied 1235 place count 327 transition count 635
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1240 place count 327 transition count 630
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1242 place count 325 transition count 626
Iterating global reduction 6 with 2 rules applied. Total rules applied 1244 place count 325 transition count 626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1245 place count 324 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 1246 place count 324 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1247 place count 323 transition count 622
Iterating global reduction 6 with 1 rules applied. Total rules applied 1248 place count 323 transition count 622
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1249 place count 322 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 1250 place count 322 transition count 620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1251 place count 321 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 1252 place count 321 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1253 place count 320 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 1254 place count 320 transition count 611
Performed 156 Post agglomeration using F-continuation condition with reduction of 89 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 6 with 312 rules applied. Total rules applied 1566 place count 164 transition count 366
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1577 place count 164 transition count 355
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1582 place count 159 transition count 348
Iterating global reduction 7 with 5 rules applied. Total rules applied 1587 place count 159 transition count 348
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1589 place count 157 transition count 345
Iterating global reduction 7 with 2 rules applied. Total rules applied 1591 place count 157 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1592 place count 157 transition count 344
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1593 place count 156 transition count 342
Iterating global reduction 8 with 1 rules applied. Total rules applied 1594 place count 156 transition count 342
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1595 place count 155 transition count 340
Iterating global reduction 8 with 1 rules applied. Total rules applied 1596 place count 155 transition count 340
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1597 place count 154 transition count 338
Iterating global reduction 8 with 1 rules applied. Total rules applied 1598 place count 154 transition count 338
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1599 place count 153 transition count 331
Iterating global reduction 8 with 1 rules applied. Total rules applied 1600 place count 153 transition count 331
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1620 place count 143 transition count 321
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1632 place count 143 transition count 309
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1666 place count 126 transition count 343
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1683 place count 126 transition count 326
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1692 place count 117 transition count 308
Iterating global reduction 10 with 9 rules applied. Total rules applied 1701 place count 117 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1707 place count 117 transition count 302
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1743 place count 117 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1744 place count 116 transition count 265
Applied a total of 1744 rules in 78 ms. Remains 116 /1579 variables (removed 1463) and now considering 265/2009 (removed 1744) transitions.
[2023-03-07 22:54:58] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 116 cols
[2023-03-07 22:54:58] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 22:54:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 22:54:58] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2023-03-07 22:54:58] [INFO ] Invariant cache hit.
[2023-03-07 22:54:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 22:54:58] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [45, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1579 places, 265/2009 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 263
Applied a total of 2 rules in 5 ms. Remains 112 /114 variables (removed 2) and now considering 263/265 (removed 2) transitions.
[2023-03-07 22:54:58] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 112 cols
[2023-03-07 22:54:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-07 22:54:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 22:54:58] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2023-03-07 22:54:58] [INFO ] Invariant cache hit.
[2023-03-07 22:54:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 22:54:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1579 places, 263/2009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 112/1579 places, 263/2009 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6498 steps with 545 reset in 7 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-11 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((G(p1)||X(p0)))||(!p1&&(G(p1)||X(p0))))))'
[2023-03-07 22:54:59] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3467300696976945298
[2023-03-07 22:54:59] [INFO ] Too many transitions (2009) to apply POR reductions. Disabling POR matrices.
[2023-03-07 22:54:59] [INFO ] Applying decomposition
[2023-03-07 22:54:59] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3467300696976945298
Running compilation step : cd /tmp/ltsmin3467300696976945298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-07 22:54:59] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11660060594998459869.txt' '-o' '/tmp/graph11660060594998459869.bin' '-w' '/tmp/graph11660060594998459869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11660060594998459869.bin' '-l' '-1' '-v' '-w' '/tmp/graph11660060594998459869.weights' '-q' '0' '-e' '0.001'
[2023-03-07 22:54:59] [INFO ] Decomposing Gal with order
[2023-03-07 22:54:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 22:54:59] [INFO ] Removed a total of 540 redundant transitions.
[2023-03-07 22:54:59] [INFO ] Flatten gal took : 62 ms
[2023-03-07 22:54:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 16 ms.
[2023-03-07 22:54:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality10669250667995199713.gal : 14 ms
[2023-03-07 22:54:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality16391513723688271475.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10669250667995199713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16391513723688271475.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((X("(i14.i0.i0.u213.p913!=1)"))U((G((G("((i11.u176.p781==0)||(i18.i0.i1.u296.p1259==1))"))||(X("(i14.i0.i0.u213.p913!=1)"))))||((!(...301
Formula 0 simplified : X!"(i14.i0.i0.u213.p913!=1)" R (F(X!"(i14.i0.i0.u213.p913!=1)" & F!"((i11.u176.p781==0)||(i18.i0.i1.u296.p1259==1))") & ("((i11.u176...282
Compilation finished in 3428 ms.
Running link step : cd /tmp/ltsmin3467300696976945298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3467300696976945298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U ([](([]((LTLAPp1==true))||X((LTLAPp0==true))))||(!(LTLAPp1==true)&&([]((LTLAPp1==true))||X((LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t199, t282, t314, t393, t464, t615, t681, t710, t733, t762, t794, t823, t842, t872,...2360
Computing Next relation with stutter on 97692 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
803 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,8.19284,305940,1,0,577187,9993,23871,991728,606,66677,1873779
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 179806 ms.
BK_STOP 1678229718024
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="CloudReconfiguration-PT-315"
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-5348"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-315, 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 r101-tall-167814474900115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-315.tgz
mv CloudReconfiguration-PT-315 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 ;