About the Execution of ITS-Tools for ShieldRVs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9285.747 | 3600000.00 | 9303800.00 | 15570.90 | ?T?FTF?TFFFFT?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025800796.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800796
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 6.6K Apr 30 06:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 06:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 06:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 122K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653048421621
Running Version 202205111006
[2022-05-20 12:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:07:02] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-20 12:07:02] [INFO ] Transformed 403 places.
[2022-05-20 12:07:02] [INFO ] Transformed 453 transitions.
[2022-05-20 12:07:02] [INFO ] Found NUPN structural information;
[2022-05-20 12:07:02] [INFO ] Parsed PT model containing 403 places and 453 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-010B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 453/453 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 343 transition count 393
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 343 transition count 393
Applied a total of 120 rules in 60 ms. Remains 343 /403 variables (removed 60) and now considering 393/453 (removed 60) transitions.
// Phase 1: matrix 393 rows 343 cols
[2022-05-20 12:07:03] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-20 12:07:03] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 393 rows 343 cols
[2022-05-20 12:07:03] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-20 12:07:03] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
// Phase 1: matrix 393 rows 343 cols
[2022-05-20 12:07:03] [INFO ] Computed 41 place invariants in 12 ms
[2022-05-20 12:07:03] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/403 places, 393/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/403 places, 393/453 transitions.
Support contains 43 out of 343 places after structural reductions.
[2022-05-20 12:07:04] [INFO ] Flatten gal took : 58 ms
[2022-05-20 12:07:04] [INFO ] Flatten gal took : 28 ms
[2022-05-20 12:07:04] [INFO ] Input system was already deterministic with 393 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 393 rows 343 cols
[2022-05-20 12:07:04] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:07:04] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2022-05-20 12:07:04] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 5 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 374 ms
[2022-05-20 12:07:05] [INFO ] After 509ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:07:05] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:07:05] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-05-20 12:07:05] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-20 12:07:05] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-20 12:07:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 528 ms
[2022-05-20 12:07:06] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-20 12:07:06] [INFO ] After 752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 343/343 places, 393/393 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 343 transition count 354
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 304 transition count 354
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 78 place count 304 transition count 303
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 180 place count 253 transition count 303
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 242 transition count 292
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 242 transition count 292
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 202 place count 242 transition count 287
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 212 place count 237 transition count 287
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 398 place count 144 transition count 194
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 144 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 143 transition count 193
Applied a total of 420 rules in 98 ms. Remains 143 /343 variables (removed 200) and now considering 193/393 (removed 200) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/343 places, 193/393 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Finished Best-First random walk after 745 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=372 )
FORMULA ShieldRVs-PT-010B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 85 stabilizing places and 85 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&G(((F(p1)||p2)&&F(G(p3)))))))'
Support contains 6 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 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 0 with 38 rules applied. Total rules applied 38 place count 342 transition count 354
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 304 transition count 354
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 76 place count 304 transition count 304
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 176 place count 254 transition count 304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 245 transition count 295
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 245 transition count 295
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 194 place count 245 transition count 292
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 200 place count 242 transition count 292
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 388 place count 148 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 146 transition count 196
Applied a total of 390 rules in 47 ms. Remains 146 /343 variables (removed 197) and now considering 196/393 (removed 197) transitions.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:07:06] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:07:06] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:07:06] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:06] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2022-05-20 12:07:06] [INFO ] Redundant transitions in 44 ms returned [195]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 195 rows 146 cols
[2022-05-20 12:07:06] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 12:07:06] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/343 places, 195/393 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/343 places, 195/393 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p3), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s55 0), p3:(OR (EQ s121 0) (EQ s123 0) (EQ s128 0)), p2:(EQ s19 0), p1:(EQ s41 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 683 reset in 368 ms.
Product exploration explored 100000 steps with 685 reset in 291 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/146 stabilizing places and 2/195 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 p2 p1), (X p3), (X p0), (X (X p3)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p3), (NOT p1)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 195 rows 146 cols
[2022-05-20 12:07:08] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:07:08] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:07:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 12:07:08] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:07:08] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 942 ms.
[2022-05-20 12:07:09] [INFO ] After 1040ms 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 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 195/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 146 transition count 193
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 144 transition count 193
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 6 place count 143 transition count 192
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 28 place count 143 transition count 192
Applied a total of 28 rules in 14 ms. Remains 143 /146 variables (removed 3) and now considering 192/195 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/146 places, 192/195 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1530130 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :{}
Probabilistic random walk after 1530130 steps, saw 301303 distinct states, run finished after 3003 ms. (steps per millisecond=509 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 12:07:12] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-20 12:07:12] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:07:12] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:07:12] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:07:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-20 12:07:12] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2022-05-20 12:07:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-05-20 12:07:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 132 ms
[2022-05-20 12:07:12] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 12:07:12] [INFO ] After 228ms 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 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 192/192 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 12:07:12] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 12:07:13] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 12:07:13] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-20 12:07:13] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-05-20 12:07:13] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 12:07:13] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:13] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 12:07:13] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:07:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:07:13] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:07:13] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:07:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-20 12:07:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2022-05-20 12:07:13] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:07:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2022-05-20 12:07:13] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 12:07:13] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:07:13] [INFO ] Flatten gal took : 15 ms
[2022-05-20 12:07:13] [INFO ] Flatten gal took : 14 ms
[2022-05-20 12:07:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2935708914772501592.gal : 9 ms
[2022-05-20 12:07:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2520027998695259119.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16721448351332410774;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2935708914772501592.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2520027998695259119.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2520027998695259119.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 133
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :133 after 719
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :719 after 6221
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6221 after 18099
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18099 after 564411
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :564411 after 7.35911e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.35911e+06 after 4.46606e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.46606e+08 after 4.46834e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.46834e+10 after 5.81336e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.81336e+12 after 9.96261e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.60166e+19,8.2959,208400,2,10087,19,473469,7,0,769,1.67831e+06,0
Total reachable state count : 46016585654112626456
Verifying 1 reachability properties.
Reachability property apf2 does not hold.
No reachable states exhibit your property : apf2
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,0,8.29928,208400,1,0,19,473469,7,0,772,1.67831e+06,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 p1), (X p3), (X p0), (X (X p3)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0)), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 442 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3)]
Support contains 4 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 195/195 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 146 cols
[2022-05-20 12:07:22] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:22] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 195 rows 146 cols
[2022-05-20 12:07:22] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2022-05-20 12:07:22] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 195 rows 146 cols
[2022-05-20 12:07:22] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:22] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 195/195 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p3), (X p3), (X p0), (X (X p3)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3)]
Finished random walk after 392 steps, including 2 resets, run visited all 2 properties in 6 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND p0 p3), (X p3), (X p0), (X (X p3)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p3))]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3)]
Product exploration explored 100000 steps with 686 reset in 243 ms.
Product exploration explored 100000 steps with 678 reset in 286 ms.
Built C files in :
/tmp/ltsmin14218168413484256766
[2022-05-20 12:07:24] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2022-05-20 12:07:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:07:24] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2022-05-20 12:07:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:07:24] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2022-05-20 12:07:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:07:24] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14218168413484256766
Running compilation step : cd /tmp/ltsmin14218168413484256766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 999 ms.
Running link step : cd /tmp/ltsmin14218168413484256766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14218168413484256766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10586527007789062220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 144 transition count 193
Applied a total of 1 rules in 16 ms. Remains 144 /146 variables (removed 2) and now considering 193/195 (removed 2) transitions.
// Phase 1: matrix 193 rows 144 cols
[2022-05-20 12:07:39] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:39] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 193 rows 144 cols
[2022-05-20 12:07:39] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:07:39] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-20 12:07:39] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 193 rows 144 cols
[2022-05-20 12:07:39] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:07:39] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/146 places, 193/195 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/146 places, 193/195 transitions.
Built C files in :
/tmp/ltsmin8242747468223314737
[2022-05-20 12:07:39] [INFO ] Computing symmetric may disable matrix : 193 transitions.
[2022-05-20 12:07:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:07:39] [INFO ] Computing symmetric may enable matrix : 193 transitions.
[2022-05-20 12:07:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:07:39] [INFO ] Computing Do-Not-Accords matrix : 193 transitions.
[2022-05-20 12:07:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:07:39] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8242747468223314737
Running compilation step : cd /tmp/ltsmin8242747468223314737;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin8242747468223314737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8242747468223314737;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3999093546738658099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:07:54] [INFO ] Flatten gal took : 14 ms
[2022-05-20 12:07:54] [INFO ] Flatten gal took : 13 ms
[2022-05-20 12:07:54] [INFO ] Time to serialize gal into /tmp/LTL2365724441367649879.gal : 2 ms
[2022-05-20 12:07:54] [INFO ] Time to serialize properties into /tmp/LTL17091908087164489868.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2365724441367649879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17091908087164489868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2365724...267
Read 1 LTL properties
Checking formula 0 : !((G((F("(p153==0)"))&&(G(((F("(p118==0)"))||("(p62==0)"))&&(F(G("(((p336==0)||(p341==0))||(p350==0))"))))))))
Formula 0 simplified : !G(F"(p153==0)" & G(FG"(((p336==0)||(p341==0))||(p350==0))" & ("(p62==0)" | F"(p118==0)")))
Detected timeout of ITS tools.
[2022-05-20 12:08:10] [INFO ] Flatten gal took : 19 ms
[2022-05-20 12:08:10] [INFO ] Applying decomposition
[2022-05-20 12:08:10] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5532113542430780863.txt' '-o' '/tmp/graph5532113542430780863.bin' '-w' '/tmp/graph5532113542430780863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5532113542430780863.bin' '-l' '-1' '-v' '-w' '/tmp/graph5532113542430780863.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:08:10] [INFO ] Decomposing Gal with order
[2022-05-20 12:08:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:08:10] [INFO ] Removed a total of 223 redundant transitions.
[2022-05-20 12:08:10] [INFO ] Flatten gal took : 53 ms
[2022-05-20 12:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 8 ms.
[2022-05-20 12:08:10] [INFO ] Time to serialize gal into /tmp/LTL9146850243932861290.gal : 3 ms
[2022-05-20 12:08:10] [INFO ] Time to serialize properties into /tmp/LTL8024739290409456072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9146850243932861290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8024739290409456072.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9146850...245
Read 1 LTL properties
Checking formula 0 : !((G((F("(i3.u16.p153==0)"))&&(G(((F("(i2.u11.p118==0)"))||("(i1.u5.p62==0)"))&&(F(G("(((i8.u35.p336==0)||(i8.u36.p341==0))||(i8.u37.p...172
Formula 0 simplified : !G(F"(i3.u16.p153==0)" & G(FG"(((i8.u35.p336==0)||(i8.u36.p341==0))||(i8.u37.p350==0))" & ("(i1.u5.p62==0)" | F"(i2.u11.p118==0)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12388442279153377907
[2022-05-20 12:08:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12388442279153377907
Running compilation step : cd /tmp/ltsmin12388442279153377907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 324 ms.
Running link step : cd /tmp/ltsmin12388442279153377907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12388442279153377907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&[](((<>((LTLAPp1==true))||(LTLAPp2==true))&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010B-LTLFireability-00 finished in 93783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(X(p0))||(X(p1)&&p2)))||p3)))'
Support contains 7 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 31 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:08:40] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:08:40] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:08:40] [INFO ] Computed 41 place invariants in 19 ms
[2022-05-20 12:08:40] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:08:40] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 12:08:41] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s248 1) (EQ s251 1) (EQ s259 1)), p2:(EQ s145 0), p1:(EQ s31 0), p0:(OR (EQ s259 0) (EQ s266 0) (EQ s287 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33477 reset in 236 ms.
Product exploration explored 100000 steps with 33315 reset in 227 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Computed a total of 79 stabilizing places and 79 stable transitions
Detected a total of 79/333 stabilizing places and 79/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 409 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:08:42] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:08:42] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 12:08:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2022-05-20 12:08:43] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2022-05-20 12:08:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 696 ms
[2022-05-20 12:08:43] [INFO ] After 950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-20 12:08:43] [INFO ] After 1090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 333/333 places, 383/383 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 333 transition count 343
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 293 transition count 343
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 80 place count 293 transition count 293
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 243 transition count 293
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 372 place count 147 transition count 197
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 393 place count 147 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 146 transition count 196
Applied a total of 394 rules in 35 ms. Remains 146 /333 variables (removed 187) and now considering 196/383 (removed 187) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/333 places, 196/383 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:08:44] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:08:44] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:08:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:08:44] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:08:44] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 12:08:44] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1453375 steps, run timeout after 3001 ms. (steps per millisecond=484 ) properties seen :{}
Probabilistic random walk after 1453375 steps, saw 270323 distinct states, run finished after 3001 ms. (steps per millisecond=484 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:08:47] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:08:47] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:08:47] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:08:47] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:08:47] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 12:08:47] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:08:47] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:08:47] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:08:47] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-20 12:08:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2022-05-20 12:08:47] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:08:47] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:08:48] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:08:48] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:08:48] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:08:48] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:08:48] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:08:48] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 12:08:48] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:08:48] [INFO ] Flatten gal took : 15 ms
[2022-05-20 12:08:48] [INFO ] Flatten gal took : 13 ms
[2022-05-20 12:08:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16444543778515883331.gal : 2 ms
[2022-05-20 12:08:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17804216503362361182.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11889533726438447654;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16444543778515883331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17804216503362361182.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17804216503362361182.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 121
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :121 after 362
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :362 after 1118
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1118 after 18237
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18237 after 96376
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96376 after 8.85075e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.85075e+06 after 8.38165e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.38165e+08 after 7.75085e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.75085e+10 after 7.00399e+13
Detected timeout of ITS tools.
[2022-05-20 12:09:03] [INFO ] Flatten gal took : 18 ms
[2022-05-20 12:09:03] [INFO ] Applying decomposition
[2022-05-20 12:09:03] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1342402951654551190.txt' '-o' '/tmp/graph1342402951654551190.bin' '-w' '/tmp/graph1342402951654551190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1342402951654551190.bin' '-l' '-1' '-v' '-w' '/tmp/graph1342402951654551190.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:09:03] [INFO ] Decomposing Gal with order
[2022-05-20 12:09:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:09:03] [INFO ] Removed a total of 224 redundant transitions.
[2022-05-20 12:09:03] [INFO ] Flatten gal took : 21 ms
[2022-05-20 12:09:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 4 ms.
[2022-05-20 12:09:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13191985824171938824.gal : 2 ms
[2022-05-20 12:09:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality915847875406906268.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11889533726438447654;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13191985824171938824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality915847875406906268.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality915847875406906268.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :66 after 186
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :186 after 153218
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :153218 after 2.45174e+08
Reachability property apf7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.90679e+16,11.7836,208824,4821,156,236730,711,277,1.60714e+06,77,8140,0
Total reachable state count : 29067897593106667
Verifying 1 reachability properties.
Reachability property apf7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,62,11.8038,209088,70,50,236730,711,297,1.60714e+06,80,8140,0
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p3) p2))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1093 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 383/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 333 /333 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:09:16] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:09:16] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:09:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:09:17] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:09:17] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 12:09:17] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/333 places, 383/383 transitions.
Computed a total of 79 stabilizing places and 79 stable transitions
Computed a total of 79 stabilizing places and 79 stable transitions
Detected a total of 79/333 stabilizing places and 79/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:09:18] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:09:18] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 12:09:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2022-05-20 12:09:18] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2022-05-20 12:09:18] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 892 ms
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 202 ms
[2022-05-20 12:09:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:09:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-20 12:09:19] [INFO ] After 1540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-20 12:09:19] [INFO ] After 1699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 65 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 333/333 places, 383/383 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 333 transition count 343
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 293 transition count 343
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 80 place count 293 transition count 293
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 243 transition count 293
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 372 place count 147 transition count 197
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 393 place count 147 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 146 transition count 196
Applied a total of 394 rules in 33 ms. Remains 146 /333 variables (removed 187) and now considering 196/383 (removed 187) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/333 places, 196/383 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:09:20] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 12:09:20] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:09:20] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:09:20] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:09:20] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 12:09:20] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1463694 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :{}
Probabilistic random walk after 1463694 steps, saw 272229 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:09:23] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:09:23] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:09:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:09:23] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:09:23] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 12:09:23] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:09:23] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:09:23] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:09:23] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:09:23] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-05-20 12:09:23] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:09:23] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 12:09:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:09:23] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:09:23] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:09:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 12:09:23] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:09:24] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 12:09:24] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:09:24] [INFO ] Flatten gal took : 11 ms
[2022-05-20 12:09:24] [INFO ] Flatten gal took : 10 ms
[2022-05-20 12:09:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8467088557406627745.gal : 2 ms
[2022-05-20 12:09:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7051355900744871078.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7180645144094775876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8467088557406627745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7051355900744871078.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7051355900744871078.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 121
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :121 after 362
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :362 after 1118
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1118 after 18237
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18237 after 96376
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96376 after 8.85075e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.85075e+06 after 8.38165e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.38165e+08 after 7.75085e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.75085e+10 after 7.00399e+13
Detected timeout of ITS tools.
[2022-05-20 12:09:39] [INFO ] Flatten gal took : 13 ms
[2022-05-20 12:09:39] [INFO ] Applying decomposition
[2022-05-20 12:09:39] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17470644038076291481.txt' '-o' '/tmp/graph17470644038076291481.bin' '-w' '/tmp/graph17470644038076291481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17470644038076291481.bin' '-l' '-1' '-v' '-w' '/tmp/graph17470644038076291481.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:09:39] [INFO ] Decomposing Gal with order
[2022-05-20 12:09:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:09:39] [INFO ] Removed a total of 232 redundant transitions.
[2022-05-20 12:09:39] [INFO ] Flatten gal took : 34 ms
[2022-05-20 12:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 4 ms.
[2022-05-20 12:09:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7940088907396560512.gal : 2 ms
[2022-05-20 12:09:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5219706415076002501.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7180645144094775876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7940088907396560512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5219706415076002501.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5219706415076002501.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 150
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :150 after 24218
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24218 after 1.72227e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.72227e+08 after 1.08294e+13
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6518227517710918059
[2022-05-20 12:09:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6518227517710918059
Running compilation step : cd /tmp/ltsmin6518227517710918059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 429 ms.
Running link step : cd /tmp/ltsmin6518227517710918059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6518227517710918059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p3) p2))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1092 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33389 reset in 182 ms.
Product exploration explored 100000 steps with 33266 reset in 186 ms.
Built C files in :
/tmp/ltsmin3533890724748330496
[2022-05-20 12:10:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3533890724748330496
Running compilation step : cd /tmp/ltsmin3533890724748330496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 542 ms.
Running link step : cd /tmp/ltsmin3533890724748330496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3533890724748330496;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5789887096280711412.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 383/383 transitions.
Applied a total of 0 rules in 2 ms. Remains 333 /333 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:10:26] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:10:26] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:10:26] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:10:27] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:10:27] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 12:10:27] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/333 places, 383/383 transitions.
Built C files in :
/tmp/ltsmin6480048298123343748
[2022-05-20 12:10:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6480048298123343748
Running compilation step : cd /tmp/ltsmin6480048298123343748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 558 ms.
Running link step : cd /tmp/ltsmin6480048298123343748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6480048298123343748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15295489039688672023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:10:42] [INFO ] Flatten gal took : 14 ms
[2022-05-20 12:10:42] [INFO ] Flatten gal took : 12 ms
[2022-05-20 12:10:42] [INFO ] Time to serialize gal into /tmp/LTL8141519529565743512.gal : 10 ms
[2022-05-20 12:10:42] [INFO ] Time to serialize properties into /tmp/LTL16790303018436415074.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8141519529565743512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16790303018436415074.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8141519...267
Read 1 LTL properties
Checking formula 0 : !((G((F((X(X("(((p311==0)||(p319==0))||(p345==0))")))||((X("(p34==0)"))&&("(p172==0)"))))||("(((p297==1)&&(p302==1))&&(p311==1))"))))
Formula 0 simplified : !G("(((p297==1)&&(p302==1))&&(p311==1))" | F(XX"(((p311==0)||(p319==0))||(p345==0))" | ("(p172==0)" & X"(p34==0)")))
Detected timeout of ITS tools.
[2022-05-20 12:10:57] [INFO ] Flatten gal took : 26 ms
[2022-05-20 12:10:57] [INFO ] Applying decomposition
[2022-05-20 12:10:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4734956519857820015.txt' '-o' '/tmp/graph4734956519857820015.bin' '-w' '/tmp/graph4734956519857820015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4734956519857820015.bin' '-l' '-1' '-v' '-w' '/tmp/graph4734956519857820015.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:10:57] [INFO ] Decomposing Gal with order
[2022-05-20 12:10:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:10:57] [INFO ] Removed a total of 351 redundant transitions.
[2022-05-20 12:10:57] [INFO ] Flatten gal took : 56 ms
[2022-05-20 12:10:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 12:10:57] [INFO ] Time to serialize gal into /tmp/LTL3762505822648949468.gal : 173 ms
[2022-05-20 12:10:57] [INFO ] Time to serialize properties into /tmp/LTL8912517398413333716.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3762505822648949468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8912517398413333716.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3762505...245
Read 1 LTL properties
Checking formula 0 : !((G((F((X(X("(((i8.i1.u98.p311==0)||(i8.i0.u100.p319==0))||(i9.i2.u109.p345==0))")))||((X("(i0.i0.u13.p34==0)"))&&("(i4.i2.u55.p172==...236
Formula 0 simplified : !G("(((i8.i0.u94.p297==1)&&(i8.i0.u95.p302==1))&&(i8.i1.u98.p311==1))" | F(XX"(((i8.i1.u98.p311==0)||(i8.i0.u100.p319==0))||(i9.i2.u...221
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7519356375399844896
[2022-05-20 12:11:12] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7519356375399844896
Running compilation step : cd /tmp/ltsmin7519356375399844896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 536 ms.
Running link step : cd /tmp/ltsmin7519356375399844896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin7519356375399844896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X((LTLAPp0==true)))||(X((LTLAPp1==true))&&(LTLAPp2==true))))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010B-LTLFireability-02 finished in 167725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(X(p1)) U p2))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 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 0 with 38 rules applied. Total rules applied 38 place count 342 transition count 354
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 304 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 303 transition count 353
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 78 place count 303 transition count 302
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 180 place count 252 transition count 302
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 191 place count 241 transition count 291
Iterating global reduction 3 with 11 rules applied. Total rules applied 202 place count 241 transition count 291
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 202 place count 241 transition count 286
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 212 place count 236 transition count 286
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 390 place count 147 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 145 transition count 195
Applied a total of 392 rules in 40 ms. Remains 145 /343 variables (removed 198) and now considering 195/393 (removed 198) transitions.
// Phase 1: matrix 195 rows 145 cols
[2022-05-20 12:11:28] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:11:28] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 195 rows 145 cols
[2022-05-20 12:11:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:28] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2022-05-20 12:11:28] [INFO ] Redundant transitions in 51 ms returned [194]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:11:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:28] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/343 places, 194/393 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/343 places, 194/393 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s59 1), p0:(AND (EQ s59 1) (EQ s14 1)), p1:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-03 finished in 762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 332 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 332 transition count 382
Applied a total of 22 rules in 6 ms. Remains 332 /343 variables (removed 11) and now considering 382/393 (removed 11) transitions.
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:11:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:28] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:11:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:29] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:11:29] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:29] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/343 places, 382/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/343 places, 382/393 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s214 1) (EQ s218 1) (EQ s225 1)), p0:(OR (EQ s214 0) (EQ s218 0) (EQ s225 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 223 reset in 227 ms.
Product exploration explored 100000 steps with 224 reset in 251 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Computed a total of 79 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3935 steps, run visited all 1 properties in 15 ms. (steps per millisecond=262 )
Probabilistic random walk after 3935 steps, saw 3489 distinct states, run finished after 15 ms. (steps per millisecond=262 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 3 out of 332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 332/332 places, 382/382 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 331 transition count 340
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 290 transition count 340
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 290 transition count 290
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 240 transition count 290
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 376 place count 143 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 378 place count 141 transition count 191
Applied a total of 378 rules in 33 ms. Remains 141 /332 variables (removed 191) and now considering 191/382 (removed 191) transitions.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 12:11:30] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:30] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 12:11:30] [INFO ] Computed 41 place invariants in 16 ms
[2022-05-20 12:11:30] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-20 12:11:30] [INFO ] Redundant transitions in 42 ms returned [190]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 12:11:30] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:11:31] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/332 places, 190/382 transitions.
Applied a total of 0 rules in 13 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/332 places, 190/382 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1092 steps, including 7 resets, run visited all 1 properties in 4 ms. (steps per millisecond=273 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 702 reset in 235 ms.
Product exploration explored 100000 steps with 699 reset in 273 ms.
Built C files in :
/tmp/ltsmin5902806252691051222
[2022-05-20 12:11:31] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 12:11:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:11:31] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 12:11:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:11:31] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 12:11:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:11:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5902806252691051222
Running compilation step : cd /tmp/ltsmin5902806252691051222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 364 ms.
Running link step : cd /tmp/ltsmin5902806252691051222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5902806252691051222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5970029067862273000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 12:11:47] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:47] [INFO ] Implicit Places using invariants in 440 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 12:11:47] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2022-05-20 12:11:47] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 12:11:47] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:11:47] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin14594467387641134416
[2022-05-20 12:11:47] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 12:11:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:11:47] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 12:11:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:11:47] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 12:11:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:11:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14594467387641134416
Running compilation step : cd /tmp/ltsmin14594467387641134416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 341 ms.
Running link step : cd /tmp/ltsmin14594467387641134416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14594467387641134416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased192524889181646704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:12:02] [INFO ] Flatten gal took : 18 ms
[2022-05-20 12:12:02] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:12:02] [INFO ] Time to serialize gal into /tmp/LTL10890204801845812411.gal : 10 ms
[2022-05-20 12:12:02] [INFO ] Time to serialize properties into /tmp/LTL7918584845484463292.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10890204801845812411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7918584845484463292.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1089020...267
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(((p257==0)||(p263==0))||(p271==0))")))||("(((p257==1)&&(p263==1))&&(p271==1))"))))
Formula 0 simplified : !X("(((p257==1)&&(p263==1))&&(p271==1))" | FG"(((p257==0)||(p263==0))||(p271==0))")
Detected timeout of ITS tools.
[2022-05-20 12:12:17] [INFO ] Flatten gal took : 6 ms
[2022-05-20 12:12:17] [INFO ] Applying decomposition
[2022-05-20 12:12:17] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8412002725405310097.txt' '-o' '/tmp/graph8412002725405310097.bin' '-w' '/tmp/graph8412002725405310097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8412002725405310097.bin' '-l' '-1' '-v' '-w' '/tmp/graph8412002725405310097.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:12:18] [INFO ] Decomposing Gal with order
[2022-05-20 12:12:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:12:18] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 12:12:18] [INFO ] Flatten gal took : 29 ms
[2022-05-20 12:12:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 4 ms.
[2022-05-20 12:12:18] [INFO ] Time to serialize gal into /tmp/LTL11460085643825043478.gal : 19 ms
[2022-05-20 12:12:18] [INFO ] Time to serialize properties into /tmp/LTL3040237228371387224.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11460085643825043478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3040237228371387224.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1146008...246
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(((i6.u25.p257==0)||(i6.u26.p263==0))||(i6.u27.p271==0))")))||("(((i6.u25.p257==1)&&(i6.u26.p263==1))&&(i6.u27.p271==1))"))...157
Formula 0 simplified : !X("(((i6.u25.p257==1)&&(i6.u26.p263==1))&&(i6.u27.p271==1))" | FG"(((i6.u25.p257==0)||(i6.u26.p263==0))||(i6.u27.p271==0))")
Reverse transition relation is NOT exact ! Due to transitions t234_t232_t238_t237_t291, t168_t166_t172_t171_t275, t152_t150_t156_t155_t333, t118_t116_t128_...1531
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16909837938794731275
[2022-05-20 12:12:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16909837938794731275
Running compilation step : cd /tmp/ltsmin16909837938794731275;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin16909837938794731275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16909837938794731275;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010B-LTLFireability-06 finished in 79392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||p1))||F(p2)))'
Support contains 5 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 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 0 with 38 rules applied. Total rules applied 38 place count 342 transition count 354
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 304 transition count 354
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 76 place count 304 transition count 304
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 176 place count 254 transition count 304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 245 transition count 295
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 245 transition count 295
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 194 place count 245 transition count 292
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 200 place count 242 transition count 292
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 386 place count 149 transition count 199
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 147 transition count 197
Applied a total of 388 rules in 21 ms. Remains 147 /343 variables (removed 196) and now considering 197/393 (removed 196) transitions.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:12:48] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:48] [INFO ] Implicit Places using invariants in 484 ms returned []
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:12:48] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:48] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2022-05-20 12:12:48] [INFO ] Redundant transitions in 43 ms returned [196]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 196 rows 147 cols
[2022-05-20 12:12:48] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:49] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/343 places, 196/393 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/343 places, 196/393 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s17 0) (EQ s35 0) (EQ s45 0)), p2:(EQ s103 1), p1:(EQ s133 0)], 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][true, true, true]]
Product exploration explored 100000 steps with 20825 reset in 231 ms.
Product exploration explored 100000 steps with 20695 reset in 200 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/147 stabilizing places and 4/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
Knowledge based reduction with 7 factoid took 617 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :5
Finished Best-First random walk after 669 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=334 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 7 factoid took 702 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 147 cols
[2022-05-20 12:12:51] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:12:51] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 196 rows 147 cols
[2022-05-20 12:12:51] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2022-05-20 12:12:51] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 196 rows 147 cols
[2022-05-20 12:12:51] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:12:51] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 196/196 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/147 stabilizing places and 4/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 7 factoid took 519 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :5
Finished Best-First random walk after 1202 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=601 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 7 factoid took 666 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20790 reset in 209 ms.
Product exploration explored 100000 steps with 20727 reset in 216 ms.
Built C files in :
/tmp/ltsmin9965970381234034709
[2022-05-20 12:12:53] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2022-05-20 12:12:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:12:53] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2022-05-20 12:12:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:12:53] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2022-05-20 12:12:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:12:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9965970381234034709
Running compilation step : cd /tmp/ltsmin9965970381234034709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 358 ms.
Running link step : cd /tmp/ltsmin9965970381234034709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9965970381234034709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3165112402964037242.hoa' '--buchi-type=spotba'
LTSmin run took 3838 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-010B-LTLFireability-07 finished in 10009 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(!F(p0))))&&X(G(p1))))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 332 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 332 transition count 382
Applied a total of 22 rules in 8 ms. Remains 332 /343 variables (removed 11) and now considering 382/393 (removed 11) transitions.
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:12:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:58] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:12:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:58] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:12:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:58] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/343 places, 382/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/343 places, 382/393 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s257 1), p1:(OR (EQ s55 0) (EQ s58 0) (EQ s65 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-08 finished in 659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(G(p0))||p1))&&F(p2))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 334 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 334 transition count 384
Applied a total of 18 rules in 9 ms. Remains 334 /343 variables (removed 9) and now considering 384/393 (removed 9) transitions.
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:12:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:58] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:12:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:59] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:12:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:12:59] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/343 places, 384/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 334/343 places, 384/393 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s282 1), p1:(EQ s282 0), p0:(EQ s20 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3779 reset in 192 ms.
Product exploration explored 100000 steps with 3730 reset in 181 ms.
Computed a total of 80 stabilizing places and 80 stable transitions
Computed a total of 80 stabilizing places and 80 stable transitions
Detected a total of 80/334 stabilizing places and 80/384 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
Finished random walk after 1249 steps, including 2 resets, run visited all 3 properties in 9 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:13:00] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:00] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2022-05-20 12:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:01] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-20 12:13:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:13:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2022-05-20 12:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:01] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-05-20 12:13:01] [INFO ] Computed and/alt/rep : 383/1199/383 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-20 12:13:07] [INFO ] Added : 372 causal constraints over 76 iterations in 6259 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 384/384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 333 transition count 343
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 293 transition count 343
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 80 place count 293 transition count 293
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 243 transition count 293
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 374 place count 146 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 144 transition count 194
Applied a total of 376 rules in 14 ms. Remains 144 /334 variables (removed 190) and now considering 194/384 (removed 190) transitions.
// Phase 1: matrix 194 rows 144 cols
[2022-05-20 12:13:07] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:07] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 194 rows 144 cols
[2022-05-20 12:13:07] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:08] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2022-05-20 12:13:08] [INFO ] Redundant transitions in 39 ms returned [193]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 193 rows 144 cols
[2022-05-20 12:13:08] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:08] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/334 places, 193/384 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/334 places, 193/384 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/144 stabilizing places and 2/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
Finished random walk after 391 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=195 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
// Phase 1: matrix 193 rows 144 cols
[2022-05-20 12:13:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:09] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 12:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:09] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-20 12:13:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:13:09] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 12:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:09] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-20 12:13:09] [INFO ] Computed and/alt/rep : 173/728/173 causal constraints (skipped 18 transitions) in 12 ms.
[2022-05-20 12:13:10] [INFO ] Added : 172 causal constraints over 35 iterations in 685 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
Stuttering criterion allowed to conclude after 1191 steps with 17 reset in 2 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-09 finished in 11499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X(p0))&&F(G(p1))))))'
Support contains 5 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 334 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 334 transition count 384
Applied a total of 18 rules in 5 ms. Remains 334 /343 variables (removed 9) and now considering 384/393 (removed 9) transitions.
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:13:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:10] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:13:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:10] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 334 cols
[2022-05-20 12:13:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:11] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/343 places, 384/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 334/343 places, 384/393 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s297 1), p1:(OR (EQ s129 1) (EQ s227 0) (EQ s236 0) (EQ s255 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-10 finished in 889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 342 transition count 353
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 303 transition count 353
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 78 place count 303 transition count 304
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 254 transition count 304
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 187 place count 243 transition count 293
Iterating global reduction 2 with 11 rules applied. Total rules applied 198 place count 243 transition count 293
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 198 place count 243 transition count 288
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 208 place count 238 transition count 288
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 394 place count 145 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 396 place count 143 transition count 193
Applied a total of 396 rules in 34 ms. Remains 143 /343 variables (removed 200) and now considering 193/393 (removed 200) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 12:13:11] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:11] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 12:13:11] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:11] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2022-05-20 12:13:11] [INFO ] Redundant transitions in 46 ms returned [192]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 12:13:11] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:11] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/343 places, 192/393 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/343 places, 192/393 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s81 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-11 finished in 594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(p1)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 5 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:13:11] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:13:11] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:13:11] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:12] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:13:12] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:12] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 132 ms :[p1, p1, true]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s293 1), p1:(AND (EQ s315 1) (EQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Computed a total of 80 stabilizing places and 80 stable transitions
Computed a total of 80 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-010B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-010B-LTLFireability-12 finished in 1319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 342 transition count 353
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 303 transition count 353
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 303 transition count 305
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 255 transition count 305
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 184 place count 245 transition count 295
Iterating global reduction 2 with 10 rules applied. Total rules applied 194 place count 245 transition count 295
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 194 place count 245 transition count 290
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 204 place count 240 transition count 290
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 390 place count 147 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 145 transition count 195
Applied a total of 392 rules in 23 ms. Remains 145 /343 variables (removed 198) and now considering 195/393 (removed 198) transitions.
// Phase 1: matrix 195 rows 145 cols
[2022-05-20 12:13:13] [INFO ] Computed 41 place invariants in 8 ms
[2022-05-20 12:13:13] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 195 rows 145 cols
[2022-05-20 12:13:13] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:13] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2022-05-20 12:13:14] [INFO ] Redundant transitions in 33 ms returned [194]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:14] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:14] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/343 places, 194/393 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/343 places, 194/393 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s37 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 37197 reset in 170 ms.
Product exploration explored 100000 steps with 37167 reset in 222 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:14] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:14] [INFO ] [Real]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 12:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:15] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-20 12:13:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:13:15] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 12:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:15] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-20 12:13:15] [INFO ] Computed and/alt/rep : 171/719/171 causal constraints (skipped 20 transitions) in 12 ms.
[2022-05-20 12:13:15] [INFO ] Added : 166 causal constraints over 34 iterations in 670 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:15] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:15] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:15] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:16] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-20 12:13:16] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 194/194 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:16] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:16] [INFO ] [Real]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 12:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:16] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:13:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:13:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 12:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:13:16] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-20 12:13:16] [INFO ] Computed and/alt/rep : 171/719/171 causal constraints (skipped 20 transitions) in 13 ms.
[2022-05-20 12:13:17] [INFO ] Added : 166 causal constraints over 34 iterations in 644 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Product exploration explored 100000 steps with 37226 reset in 184 ms.
Product exploration explored 100000 steps with 37176 reset in 200 ms.
Built C files in :
/tmp/ltsmin668788530914454251
[2022-05-20 12:13:17] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2022-05-20 12:13:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:13:17] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2022-05-20 12:13:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:13:17] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2022-05-20 12:13:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:13:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin668788530914454251
Running compilation step : cd /tmp/ltsmin668788530914454251;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 365 ms.
Running link step : cd /tmp/ltsmin668788530914454251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin668788530914454251;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2667602442510506192.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:33] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:33] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:33] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:13:33] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-05-20 12:13:33] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 194 rows 145 cols
[2022-05-20 12:13:33] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:13:33] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 194/194 transitions.
Built C files in :
/tmp/ltsmin17391467114117208319
[2022-05-20 12:13:33] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2022-05-20 12:13:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:13:33] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2022-05-20 12:13:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:13:33] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2022-05-20 12:13:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:13:33] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17391467114117208319
Running compilation step : cd /tmp/ltsmin17391467114117208319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 348 ms.
Running link step : cd /tmp/ltsmin17391467114117208319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17391467114117208319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18392869442057971791.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:13:48] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:13:48] [INFO ] Flatten gal took : 6 ms
[2022-05-20 12:13:48] [INFO ] Time to serialize gal into /tmp/LTL12360665857992872754.gal : 1 ms
[2022-05-20 12:13:48] [INFO ] Time to serialize properties into /tmp/LTL5588297212310889535.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12360665857992872754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5588297212310889535.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1236066...267
Read 1 LTL properties
Checking formula 0 : !((F("((p105==1)||(p39==1))")))
Formula 0 simplified : !F"((p105==1)||(p39==1))"
Detected timeout of ITS tools.
[2022-05-20 12:14:03] [INFO ] Flatten gal took : 6 ms
[2022-05-20 12:14:03] [INFO ] Applying decomposition
[2022-05-20 12:14:03] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5908985087703870243.txt' '-o' '/tmp/graph5908985087703870243.bin' '-w' '/tmp/graph5908985087703870243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5908985087703870243.bin' '-l' '-1' '-v' '-w' '/tmp/graph5908985087703870243.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:14:03] [INFO ] Decomposing Gal with order
[2022-05-20 12:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:14:03] [INFO ] Removed a total of 208 redundant transitions.
[2022-05-20 12:14:03] [INFO ] Flatten gal took : 12 ms
[2022-05-20 12:14:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 20 ms.
[2022-05-20 12:14:03] [INFO ] Time to serialize gal into /tmp/LTL4994396009634119713.gal : 2 ms
[2022-05-20 12:14:03] [INFO ] Time to serialize properties into /tmp/LTL18219175188301081915.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4994396009634119713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18219175188301081915.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4994396...246
Read 1 LTL properties
Checking formula 0 : !((F("((i2.u11.p105==1)||(i0.u4.p39==1))")))
Formula 0 simplified : !F"((i2.u11.p105==1)||(i0.u4.p39==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9962582157507914992
[2022-05-20 12:14:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9962582157507914992
Running compilation step : cd /tmp/ltsmin9962582157507914992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin9962582157507914992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9962582157507914992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010B-LTLFireability-13 finished in 80608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 332 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 332 transition count 382
Applied a total of 22 rules in 4 ms. Remains 332 /343 variables (removed 11) and now considering 382/393 (removed 11) transitions.
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:14:33] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:33] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:14:33] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 12:14:34] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 382 rows 332 cols
[2022-05-20 12:14:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:34] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/343 places, 382/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/343 places, 382/393 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s247 1) (EQ s250 1) (EQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1493 steps with 6 reset in 5 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-14 finished in 666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 7 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:14:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:34] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:14:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:34] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 333 cols
[2022-05-20 12:14:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:35] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s276 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Computed a total of 79 stabilizing places and 79 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-010B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-010B-LTLFireability-15 finished in 1183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&G(((F(p1)||p2)&&F(G(p3)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(X(p0))||(X(p1)&&p2)))||p3)))'
Found a CL insensitive property : ShieldRVs-PT-010B-LTLFireability-02
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 343 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 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 0 with 38 rules applied. Total rules applied 38 place count 342 transition count 354
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 304 transition count 354
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 76 place count 304 transition count 304
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 176 place count 254 transition count 304
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 186 place count 244 transition count 294
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 244 transition count 294
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 196 place count 244 transition count 289
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 206 place count 239 transition count 289
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 386 place count 149 transition count 199
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 147 transition count 197
Applied a total of 388 rules in 26 ms. Remains 147 /343 variables (removed 196) and now considering 197/393 (removed 196) transitions.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:14:36] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:14:36] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:14:36] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:36] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:14:36] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:14:36] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 147/343 places, 197/393 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/343 places, 197/393 transitions.
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s107 1) (EQ s109 1) (EQ s114 1)), p2:(EQ s60 0), p1:(EQ s10 0), p0:(OR (EQ s114 0) (EQ s117 0) (EQ s126 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31616 reset in 216 ms.
Product exploration explored 100000 steps with 31632 reset in 228 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/147 stabilizing places and 2/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:14:37] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:14:37] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:14:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:14:37] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:14:37] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 12:14:37] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 147/147 places, 197/197 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 147 transition count 196
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 146 transition count 196
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 146 transition count 196
Applied a total of 23 rules in 6 ms. Remains 146 /147 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/147 places, 196/197 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1550451 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1550451 steps, saw 287182 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:14:41] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 12:14:41] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:14:41] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 12:14:41] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:14:41] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2022-05-20 12:14:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-20 12:14:41] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-20 12:14:41] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:14:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:41] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:14:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:41] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2022-05-20 12:14:41] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:14:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:42] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 15 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:14:42] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:14:42] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:14:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 12:14:42] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:14:42] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-05-20 12:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-05-20 12:14:42] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 12:14:42] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:14:42] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:14:42] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:14:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12861325530514330406.gal : 0 ms
[2022-05-20 12:14:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4611760492514098187.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8193856259208879398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12861325530514330406.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4611760492514098187.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4611760492514098187.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 121
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :121 after 362
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :362 after 1118
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1118 after 18237
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18237 after 96376
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96376 after 8.85075e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.85075e+06 after 8.38165e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.38165e+08 after 7.75085e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.75085e+10 after 7.00399e+13
Detected timeout of ITS tools.
[2022-05-20 12:14:57] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:14:57] [INFO ] Applying decomposition
[2022-05-20 12:14:57] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12909365912764502717.txt' '-o' '/tmp/graph12909365912764502717.bin' '-w' '/tmp/graph12909365912764502717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12909365912764502717.bin' '-l' '-1' '-v' '-w' '/tmp/graph12909365912764502717.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:14:57] [INFO ] Decomposing Gal with order
[2022-05-20 12:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:14:57] [INFO ] Removed a total of 230 redundant transitions.
[2022-05-20 12:14:57] [INFO ] Flatten gal took : 46 ms
[2022-05-20 12:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 4 ms.
[2022-05-20 12:14:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13674277579304677386.gal : 1 ms
[2022-05-20 12:14:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1648694773212667113.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8193856259208879398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13674277579304677386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1648694773212667113.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality1648694773212667113.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :150 after 216
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :216 after 2130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2130 after 1.9782e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.9782e+07 after 6.94277e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12173393961138790441
[2022-05-20 12:15:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12173393961138790441
Running compilation step : cd /tmp/ltsmin12173393961138790441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 298 ms.
Running link step : cd /tmp/ltsmin12173393961138790441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin12173393961138790441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p3) p2))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 479 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:15:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:15:28] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:15:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:15:28] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:15:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:15:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 197/197 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/147 stabilizing places and 2/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 8 factoid took 324 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:15:29] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:15:29] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:15:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 12:15:29] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:15:29] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 12:15:29] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 147/147 places, 197/197 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 147 transition count 196
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 146 transition count 196
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 146 transition count 196
Applied a total of 23 rules in 5 ms. Remains 146 /147 variables (removed 1) and now considering 196/197 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/147 places, 196/197 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1576662 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1576662 steps, saw 291518 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:15:32] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:15:32] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:15:33] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 12:15:33] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2022-05-20 12:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-20 12:15:33] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 12:15:33] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:15:33] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:15:33] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:15:33] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:15:33] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-05-20 12:15:33] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:15:33] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:15:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 146 cols
[2022-05-20 12:15:33] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 12:15:33] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:15:33] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 12:15:33] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2022-05-20 12:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-20 12:15:33] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 12:15:33] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:15:33] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:15:33] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:15:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7908131580269145552.gal : 2 ms
[2022-05-20 12:15:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4226579544746738025.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12561369244477272585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7908131580269145552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4226579544746738025.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4226579544746738025.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 121
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :121 after 362
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :362 after 1118
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1118 after 18237
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18237 after 96376
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96376 after 8.85075e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.85075e+06 after 8.38165e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.38165e+08 after 7.75085e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.75085e+10 after 7.00399e+13
Detected timeout of ITS tools.
[2022-05-20 12:15:48] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:15:48] [INFO ] Applying decomposition
[2022-05-20 12:15:48] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2691805110711802537.txt' '-o' '/tmp/graph2691805110711802537.bin' '-w' '/tmp/graph2691805110711802537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2691805110711802537.bin' '-l' '-1' '-v' '-w' '/tmp/graph2691805110711802537.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:15:48] [INFO ] Decomposing Gal with order
[2022-05-20 12:15:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:15:48] [INFO ] Removed a total of 230 redundant transitions.
[2022-05-20 12:15:48] [INFO ] Flatten gal took : 25 ms
[2022-05-20 12:15:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 179 labels/synchronizations in 19 ms.
[2022-05-20 12:15:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13224100771355615371.gal : 1 ms
[2022-05-20 12:15:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6629632681310251398.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12561369244477272585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13224100771355615371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6629632681310251398.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality6629632681310251398.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 150
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :150 after 6442
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6442 after 1.74876e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.74876e+07 after 3.7905e+10
Reachability property apf7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.85277e+17,13.4696,234384,5049,142,258280,720,280,1.80116e+06,74,7886,0
Total reachable state count : 385277468846299201
Verifying 1 reachability properties.
Reachability property apf7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf7,1056,13.4925,234648,80,41,258280,720,300,1.80116e+06,77,7886,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p3) p2))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 568 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31460 reset in 195 ms.
Product exploration explored 100000 steps with 31540 reset in 207 ms.
Built C files in :
/tmp/ltsmin10479632228343245625
[2022-05-20 12:16:03] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10479632228343245625
Running compilation step : cd /tmp/ltsmin10479632228343245625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin10479632228343245625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10479632228343245625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12408750669708336764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:16:19] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:16:19] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:16:19] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:16:19] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 147 cols
[2022-05-20 12:16:19] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 12:16:19] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 197/197 transitions.
Built C files in :
/tmp/ltsmin7774384000893137813
[2022-05-20 12:16:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7774384000893137813
Running compilation step : cd /tmp/ltsmin7774384000893137813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin7774384000893137813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7774384000893137813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6380932592249086364.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:16:34] [INFO ] Flatten gal took : 9 ms
[2022-05-20 12:16:34] [INFO ] Flatten gal took : 7 ms
[2022-05-20 12:16:34] [INFO ] Time to serialize gal into /tmp/LTL8234321570273410283.gal : 1 ms
[2022-05-20 12:16:34] [INFO ] Time to serialize properties into /tmp/LTL1996013764763017026.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8234321570273410283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1996013764763017026.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8234321...266
Read 1 LTL properties
Checking formula 0 : !((G((F((X(X("(((p311==0)||(p319==0))||(p345==0))")))||((X("(p34==0)"))&&("(p172==0)"))))||("(((p297==1)&&(p302==1))&&(p311==1))"))))
Formula 0 simplified : !G("(((p297==1)&&(p302==1))&&(p311==1))" | F(XX"(((p311==0)||(p319==0))||(p345==0))" | ("(p172==0)" & X"(p34==0)")))
Detected timeout of ITS tools.
[2022-05-20 12:16:49] [INFO ] Flatten gal took : 12 ms
[2022-05-20 12:16:49] [INFO ] Applying decomposition
[2022-05-20 12:16:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3377966752561797689.txt' '-o' '/tmp/graph3377966752561797689.bin' '-w' '/tmp/graph3377966752561797689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3377966752561797689.bin' '-l' '-1' '-v' '-w' '/tmp/graph3377966752561797689.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:16:49] [INFO ] Decomposing Gal with order
[2022-05-20 12:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:16:49] [INFO ] Removed a total of 219 redundant transitions.
[2022-05-20 12:16:49] [INFO ] Flatten gal took : 17 ms
[2022-05-20 12:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 3 ms.
[2022-05-20 12:16:49] [INFO ] Time to serialize gal into /tmp/LTL5832080678240923758.gal : 1 ms
[2022-05-20 12:16:49] [INFO ] Time to serialize properties into /tmp/LTL12201646888791702200.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5832080678240923758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12201646888791702200.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5832080...246
Read 1 LTL properties
Checking formula 0 : !((G((F((X(X("(((i7.u32.p311==0)||(i7.u34.p319==0))||(i8.u37.p345==0))")))||((X("(i0.u3.p34==0)"))&&("(i4.u17.p172==0)"))))||("(((i7.u...209
Formula 0 simplified : !G("(((i7.u29.p297==1)&&(i7.u31.p302==1))&&(i7.u32.p311==1))" | F(XX"(((i7.u32.p311==0)||(i7.u34.p319==0))||(i8.u37.p345==0))" | ("(...194
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5563079659712354743
[2022-05-20 12:17:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5563079659712354743
Running compilation step : cd /tmp/ltsmin5563079659712354743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 307 ms.
Running link step : cd /tmp/ltsmin5563079659712354743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5563079659712354743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X((LTLAPp0==true)))||(X((LTLAPp1==true))&&(LTLAPp2==true))))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010B-LTLFireability-02 finished in 164067 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-20 12:17:19] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14751468392903247844
[2022-05-20 12:17:20] [INFO ] Computing symmetric may disable matrix : 393 transitions.
[2022-05-20 12:17:20] [INFO ] Applying decomposition
[2022-05-20 12:17:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:17:20] [INFO ] Computing symmetric may enable matrix : 393 transitions.
[2022-05-20 12:17:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:17:20] [INFO ] Computing Do-Not-Accords matrix : 393 transitions.
[2022-05-20 12:17:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:17:20] [INFO ] Flatten gal took : 20 ms
[2022-05-20 12:17:20] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14751468392903247844
Running compilation step : cd /tmp/ltsmin14751468392903247844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18317779202387132108.txt' '-o' '/tmp/graph18317779202387132108.bin' '-w' '/tmp/graph18317779202387132108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18317779202387132108.bin' '-l' '-1' '-v' '-w' '/tmp/graph18317779202387132108.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:17:20] [INFO ] Decomposing Gal with order
[2022-05-20 12:17:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:17:20] [INFO ] Removed a total of 351 redundant transitions.
[2022-05-20 12:17:20] [INFO ] Flatten gal took : 20 ms
[2022-05-20 12:17:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 12:17:20] [INFO ] Time to serialize gal into /tmp/LTLFireability9977998578852166876.gal : 3 ms
[2022-05-20 12:17:20] [INFO ] Time to serialize properties into /tmp/LTLFireability448390701615955726.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9977998578852166876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability448390701615955726.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 4 LTL properties
Checking formula 0 : !((G((F("(i3.i2.u48.p153==0)"))&&(G(((F("(i2.i0.u35.p118==0)"))||("(i1.i0.u20.p62==0)"))&&(F(G("(((i9.i0.u105.p336==0)||(i9.i0.u106.p3...194
Formula 0 simplified : !G(F"(i3.i2.u48.p153==0)" & G(FG"(((i9.i0.u105.p336==0)||(i9.i0.u106.p341==0))||(i9.i1.u109.p350==0))" & ("(i1.i0.u20.p62==0)" | F"(...177
Compilation finished in 778 ms.
Running link step : cd /tmp/ltsmin14751468392903247844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14751468392903247844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&[](((<>((LTLAPp1==true))||(LTLAPp2==true))&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14751468392903247844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&[](((<>((LTLAPp1==true))||(LTLAPp2==true))&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14751468392903247844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X((LTLAPp4==true)))||(X((LTLAPp5==true))&&(LTLAPp6==true))))||(LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 12:40:45] [INFO ] Applying decomposition
[2022-05-20 12:40:45] [INFO ] Flatten gal took : 43 ms
[2022-05-20 12:40:45] [INFO ] Decomposing Gal with order
[2022-05-20 12:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:40:45] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 12:40:45] [INFO ] Flatten gal took : 59 ms
[2022-05-20 12:40:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 6 ms.
[2022-05-20 12:40:45] [INFO ] Time to serialize gal into /tmp/LTLFireability10298311026377627914.gal : 13 ms
[2022-05-20 12:40:45] [INFO ] Time to serialize properties into /tmp/LTLFireability2735625386371130522.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10298311026377627914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2735625386371130522.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((G((F("(i0.i0.i0.i0.i0.i0.i1.i0.u37.p153==0)"))&&(G(((F("(i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.p118==0)"))||("(i0.i0.i0.i0.i0.i0.i0.i0.i1....272
Formula 0 simplified : !G(F"(i0.i0.i0.i0.i0.i0.i1.i0.u37.p153==0)" & G(FG"(((i0.i1.i0.i0.u70.p336==0)||(i0.i1.i0.i0.u71.p341==0))||(i0.i1.i0.u72.p350==0))"...255
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: LTL layer: formula: []((<>((X(X((LTLAPp4==true)))||(X((LTLAPp5==true))&&(LTLAPp6==true))))||(LTLAPp7==true)))
pins2lts-mc-linux64( 4/ 8), 0.006: "[]((<>((X(X((LTLAPp4==true)))||(X((LTLAPp5==true))&&(LTLAPp6==true))))||(LTLAPp7==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.232: DFS-FIFO for weak LTL, using special progress label 405
pins2lts-mc-linux64( 0/ 8), 0.232: There are 406 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.232: State length is 344, there are 404 groups
pins2lts-mc-linux64( 0/ 8), 0.232: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.232: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.232: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.232: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.295: ~1 levels ~960 states ~4192 transitions
pins2lts-mc-linux64( 7/ 8), 0.330: ~1 levels ~1920 states ~11984 transitions
pins2lts-mc-linux64( 6/ 8), 0.393: ~1 levels ~3840 states ~21600 transitions
pins2lts-mc-linux64( 7/ 8), 0.510: ~1 levels ~7680 states ~54400 transitions
pins2lts-mc-linux64( 7/ 8), 0.768: ~1 levels ~15360 states ~115008 transitions
pins2lts-mc-linux64( 7/ 8), 1.179: ~1 levels ~30720 states ~250480 transitions
pins2lts-mc-linux64( 2/ 8), 1.854: ~2 levels ~61440 states ~484824 transitions
pins2lts-mc-linux64( 2/ 8), 2.993: ~2 levels ~122880 states ~923696 transitions
pins2lts-mc-linux64( 2/ 8), 5.305: ~2 levels ~245760 states ~2143520 transitions
pins2lts-mc-linux64( 2/ 8), 8.888: ~2 levels ~491520 states ~4170808 transitions
pins2lts-mc-linux64( 2/ 8), 16.225: ~2 levels ~983040 states ~8763824 transitions
pins2lts-mc-linux64( 2/ 8), 30.585: ~2 levels ~1966080 states ~18218080 transitions
pins2lts-mc-linux64( 2/ 8), 59.467: ~2 levels ~3932160 states ~37110104 transitions
pins2lts-mc-linux64( 7/ 8), 119.894: ~2 levels ~7864320 states ~76491712 transitions
pins2lts-mc-linux64( 2/ 8), 235.447: ~2 levels ~15728640 states ~151153520 transitions
pins2lts-mc-linux64( 2/ 8), 494.323: ~2 levels ~31457280 states ~327208776 transitions
pins2lts-mc-linux64( 6/ 8), 723.621: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 723.697:
pins2lts-mc-linux64( 0/ 8), 723.697: mean standard work distribution: 3.0% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 723.697:
pins2lts-mc-linux64( 0/ 8), 723.697: Explored 43822748 states 473280912 transitions, fanout: 10.800
pins2lts-mc-linux64( 0/ 8), 723.697: Total exploration time 723.450 sec (723.380 sec minimum, 723.417 sec on average)
pins2lts-mc-linux64( 0/ 8), 723.697: States per second: 60575, Transitions per second: 654200
pins2lts-mc-linux64( 0/ 8), 723.697:
pins2lts-mc-linux64( 0/ 8), 723.697: Progress states detected: 85354552
pins2lts-mc-linux64( 0/ 8), 723.697: Redundant explorations: -52.7401
pins2lts-mc-linux64( 0/ 8), 723.697:
pins2lts-mc-linux64( 0/ 8), 723.697: Queue width: 8B, total height: 80115848, memory: 611.24MB
pins2lts-mc-linux64( 0/ 8), 723.697: Tree memory: 963.5MB, 10.9 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 723.697: Tree fill ratio (roots/leafs): 69.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 723.697: Stored 395 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 723.697: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 723.697: Est. total memory use: 1574.7MB (~1635.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14751468392903247844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X((LTLAPp4==true)))||(X((LTLAPp5==true))&&(LTLAPp6==true))))||(LTLAPp7==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14751468392903247844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X((LTLAPp4==true)))||(X((LTLAPp5==true))&&(LTLAPp6==true))))||(LTLAPp7==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 13:04:11] [INFO ] Flatten gal took : 12 ms
[2022-05-20 13:04:11] [INFO ] Input system was already deterministic with 393 transitions.
[2022-05-20 13:04:11] [INFO ] Transformed 343 places.
[2022-05-20 13:04:11] [INFO ] Transformed 393 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 13:04:11] [INFO ] Time to serialize gal into /tmp/LTLFireability10266866124843975266.gal : 3 ms
[2022-05-20 13:04:11] [INFO ] Time to serialize properties into /tmp/LTLFireability8332689007300952533.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10266866124843975266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8332689007300952533.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(p153==0)"))&&(G(((F("(p118==0)"))||("(p62==0)"))&&(F(G("(((p336==0)||(p341==0))||(p350==0))"))))))))
Formula 0 simplified : !G(F"(p153==0)" & G(FG"(((p336==0)||(p341==0))||(p350==0))" & ("(p62==0)" | F"(p118==0)")))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025800796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010B.tgz
mv ShieldRVs-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;