About the Execution of ITS-Tools for ShieldIIPs-PT-005B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.243 | 3600000.00 | 6416676.00 | 334328.10 | FT?F?FFFTTF??FFF | 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-165286024700076.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 ShieldIIPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 7.2K Apr 29 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 29 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 15:00 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.6K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 82K 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 ShieldIIPs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652919147693
Running Version 202205111006
[2022-05-19 00:12:28] [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-19 00:12:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 00:12:28] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2022-05-19 00:12:28] [INFO ] Transformed 303 places.
[2022-05-19 00:12:28] [INFO ] Transformed 298 transitions.
[2022-05-19 00:12:28] [INFO ] Found NUPN structural information;
[2022-05-19 00:12:28] [INFO ] Parsed PT model containing 303 places and 298 transitions in 192 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 1 formulas.
FORMULA ShieldIIPs-PT-005B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 273 transition count 268
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 273 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 272 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 272 transition count 267
Applied a total of 62 rules in 50 ms. Remains 272 /303 variables (removed 31) and now considering 267/298 (removed 31) transitions.
// Phase 1: matrix 267 rows 272 cols
[2022-05-19 00:12:29] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-19 00:12:29] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 267 rows 272 cols
[2022-05-19 00:12:29] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-19 00:12:29] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 267 rows 272 cols
[2022-05-19 00:12:29] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 00:12:29] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/303 places, 267/298 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/303 places, 267/298 transitions.
Support contains 43 out of 272 places after structural reductions.
[2022-05-19 00:12:29] [INFO ] Flatten gal took : 46 ms
[2022-05-19 00:12:29] [INFO ] Flatten gal took : 22 ms
[2022-05-19 00:12:30] [INFO ] Input system was already deterministic with 267 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 34) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 267 rows 272 cols
[2022-05-19 00:12:30] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 00:12:30] [INFO ] [Real]Absence check using 46 positive place invariants in 15 ms returned sat
[2022-05-19 00:12:30] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 3 ms to minimize.
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
[2022-05-19 00:12:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 285 ms
[2022-05-19 00:12:30] [INFO ] After 380ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:12:30] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:12:30] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2022-05-19 00:12:30] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-19 00:12:30] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2022-05-19 00:12:31] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2022-05-19 00:12:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2022-05-19 00:12:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2022-05-19 00:12:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2022-05-19 00:12:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 343 ms
[2022-05-19 00:12:31] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-19 00:12:31] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 267/267 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 272 transition count 241
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 246 transition count 241
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 246 transition count 215
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 220 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 215 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 215 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 288 place count 128 transition count 123
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 320 place count 128 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 126 transition count 122
Applied a total of 322 rules in 49 ms. Remains 126 /272 variables (removed 146) and now considering 122/267 (removed 145) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/272 places, 122/267 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1745728 steps, run timeout after 3001 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1745728 steps, saw 348486 distinct states, run finished after 3002 ms. (steps per millisecond=581 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:12:34] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-19 00:12:34] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2022-05-19 00:12:34] [INFO ] [Real]Absence check using 44 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 00:12:34] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:12:34] [INFO ] [Nat]Absence check using 44 positive place invariants in 5 ms returned sat
[2022-05-19 00:12:34] [INFO ] [Nat]Absence check using 44 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 00:12:34] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:12:34] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2022-05-19 00:12:34] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2022-05-19 00:12:34] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-05-19 00:12:34] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-19 00:12:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 146 ms
[2022-05-19 00:12:34] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 00:12:34] [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 126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 122/122 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:12:34] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:12:34] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:12:34] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-19 00:12:34] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-19 00:12:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:12:34] [INFO ] Computed 45 place invariants in 14 ms
[2022-05-19 00:12:34] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:12:34] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:12:34] [INFO ] [Real]Absence check using 44 positive place invariants in 4 ms returned sat
[2022-05-19 00:12:34] [INFO ] [Real]Absence check using 44 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 00:12:34] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:12:35] [INFO ] [Nat]Absence check using 44 positive place invariants in 5 ms returned sat
[2022-05-19 00:12:35] [INFO ] [Nat]Absence check using 44 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 00:12:35] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:12:35] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-19 00:12:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-19 00:12:35] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-19 00:12:35] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2022-05-19 00:12:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 137 ms
[2022-05-19 00:12:35] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-19 00:12:35] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 00:12:35] [INFO ] Flatten gal took : 11 ms
[2022-05-19 00:12:35] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:12:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8043772948911001432.gal : 5 ms
[2022-05-19 00:12:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12467970008576504885.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12613576644760984110;'/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/ReachabilityCardinality8043772948911001432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12467970008576504885.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/ReachabilityCardinality12467970008576504885.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 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 71
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71 after 232
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :232 after 2075
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2075 after 3040
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3040 after 15967
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :15967 after 251705
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :251705 after 1.71652e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.71652e+06 after 8.05874e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.05874e+07 after 1.44364e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.44364e+10 after 2.71353e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.71353e+10 after 5.90181e+11
Detected timeout of ITS tools.
[2022-05-19 00:12:50] [INFO ] Flatten gal took : 14 ms
[2022-05-19 00:12:50] [INFO ] Applying decomposition
[2022-05-19 00:12:50] [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/graph16217731711452574209.txt' '-o' '/tmp/graph16217731711452574209.bin' '-w' '/tmp/graph16217731711452574209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16217731711452574209.bin' '-l' '-1' '-v' '-w' '/tmp/graph16217731711452574209.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:12:50] [INFO ] Decomposing Gal with order
[2022-05-19 00:12:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:12:50] [INFO ] Removed a total of 101 redundant transitions.
[2022-05-19 00:12:50] [INFO ] Flatten gal took : 43 ms
[2022-05-19 00:12:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 8 ms.
[2022-05-19 00:12:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14764404086078287312.gal : 3 ms
[2022-05-19 00:12:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16378418990138811734.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12613576644760984110;'/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/ReachabilityCardinality14764404086078287312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16378418990138811734.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...300
Loading property file /tmp/ReachabilityCardinality16378418990138811734.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 :272 after 974
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :974 after 17012
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17012 after 1.4094e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.4094e+06 after 3.59632e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2928864481742669860
[2022-05-19 00:13:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2928864481742669860
Running compilation step : cd /tmp/ltsmin2928864481742669860;'/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 312 ms.
Running link step : cd /tmp/ltsmin2928864481742669860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2928864481742669860;'/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' 'AtomicPropp26==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Computed a total of 64 stabilizing places and 64 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 271 transition count 240
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 245 transition count 240
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 245 transition count 214
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 219 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 214 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 214 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 214 transition count 205
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 210 transition count 205
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 288 place count 127 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 125 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 124 transition count 120
Applied a total of 291 rules in 36 ms. Remains 124 /272 variables (removed 148) and now considering 120/267 (removed 147) transitions.
// Phase 1: matrix 120 rows 124 cols
[2022-05-19 00:13:21] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:13:21] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 120 rows 124 cols
[2022-05-19 00:13:21] [INFO ] Computed 45 place invariants in 8 ms
[2022-05-19 00:13:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-19 00:13:21] [INFO ] Redundant transitions in 21 ms returned [119]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 119 rows 124 cols
[2022-05-19 00:13:21] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:13:21] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/272 places, 119/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/272 places, 119/267 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 354 reset in 333 ms.
Product exploration explored 100000 steps with 358 reset in 295 ms.
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 183 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 26 ms :[(NOT p0)]
Finished random walk after 241 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=80 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 124 cols
[2022-05-19 00:13:22] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:13:22] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 119 rows 124 cols
[2022-05-19 00:13:22] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:13:22] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-19 00:13:22] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 119 rows 124 cols
[2022-05-19 00:13:22] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:13:22] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 119/119 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 82 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 32 ms :[(NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 354 reset in 217 ms.
Product exploration explored 100000 steps with 352 reset in 243 ms.
Built C files in :
/tmp/ltsmin8648729509414176601
[2022-05-19 00:13:23] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2022-05-19 00:13:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:13:23] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2022-05-19 00:13:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:13:23] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2022-05-19 00:13:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:13:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8648729509414176601
Running compilation step : cd /tmp/ltsmin8648729509414176601;'/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 228 ms.
Running link step : cd /tmp/ltsmin8648729509414176601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin8648729509414176601;'/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/stateBased5806864377634557398.hoa' '--buchi-type=spotba'
LTSmin run took 1241 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLFireability-00 finished in 4147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(X(p0)))) U (!F(p1)&&G(p2)&&!p3)))'
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 267 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 262
Applied a total of 10 rules in 10 ms. Remains 267 /272 variables (removed 5) and now considering 262/267 (removed 5) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:25] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:13:25] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:25] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:13:25] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:25] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-19 00:13:25] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/272 places, 262/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/272 places, 262/267 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2) p3), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s27 1), p2:(AND (EQ s24 1) (EQ s49 1)), p3:(AND (EQ s132 1) (EQ s140 1) (EQ s162 1)), p0:(EQ s63 1)], 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 2320 reset in 195 ms.
Product exploration explored 100000 steps with 2317 reset in 182 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/267 stabilizing places and 59/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR p1 (NOT p2))), (X (OR p1 (NOT p2) p3)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR p1 (NOT p2)))), (X (X (OR p1 (NOT p2) p3))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 535 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Finished random walk after 302 steps, including 0 resets, run visited all 5 properties in 14 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR p1 (NOT p2))), (X (OR p1 (NOT p2) p3)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR p1 (NOT p2)))), (X (X (OR p1 (NOT p2) p3))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 (NOT p2)))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 12 factoid took 812 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:27] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 00:13:28] [INFO ] [Real]Absence check using 46 positive place invariants in 11 ms returned sat
[2022-05-19 00:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 00:13:28] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-19 00:13:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 00:13:28] [INFO ] [Nat]Absence check using 46 positive place invariants in 10 ms returned sat
[2022-05-19 00:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 00:13:28] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-05-19 00:13:28] [INFO ] Computed and/alt/rep : 261/587/261 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-19 00:13:30] [INFO ] Added : 253 causal constraints over 56 iterations in 1852 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:30] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-19 00:13:30] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:30] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:13:30] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:30] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:13:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 262/262 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/267 stabilizing places and 59/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR p1 (NOT p2))), (X (OR p1 (NOT p2) p3)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR p1 (NOT p2)))), (X (X (OR p1 (NOT p2) p3))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 518 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Finished random walk after 293 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (OR p1 (NOT p2))), (X (OR p1 (NOT p2) p3)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR p1 (NOT p2)))), (X (X (OR p1 (NOT p2) p3))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 (NOT p2)))), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 12 factoid took 702 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:32] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:13:32] [INFO ] [Real]Absence check using 46 positive place invariants in 11 ms returned sat
[2022-05-19 00:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 00:13:32] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-05-19 00:13:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 00:13:32] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2022-05-19 00:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 00:13:33] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-05-19 00:13:33] [INFO ] Computed and/alt/rep : 261/587/261 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-19 00:13:34] [INFO ] Added : 253 causal constraints over 56 iterations in 1781 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Product exploration explored 100000 steps with 2321 reset in 147 ms.
Product exploration explored 100000 steps with 2310 reset in 156 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 267 transition count 262
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 23 place count 267 transition count 264
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 267 transition count 264
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 135 place count 267 transition count 264
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 167 place count 235 transition count 232
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 199 place count 235 transition count 232
Deduced a syphon composed of 103 places in 0 ms
Applied a total of 199 rules in 58 ms. Remains 235 /267 variables (removed 32) and now considering 232/262 (removed 30) transitions.
[2022-05-19 00:13:35] [INFO ] Redundant transitions in 28 ms returned [231]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 231 rows 235 cols
[2022-05-19 00:13:35] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:13:35] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/267 places, 231/262 transitions.
Deduced a syphon composed of 103 places in 0 ms
Applied a total of 0 rules in 14 ms. Remains 235 /235 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 235/267 places, 231/262 transitions.
Product exploration explored 100000 steps with 9364 reset in 373 ms.
Product exploration explored 100000 steps with 9314 reset in 356 ms.
Built C files in :
/tmp/ltsmin1036958634984770702
[2022-05-19 00:13:36] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1036958634984770702
Running compilation step : cd /tmp/ltsmin1036958634984770702;'/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 380 ms.
Running link step : cd /tmp/ltsmin1036958634984770702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1036958634984770702;'/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/stateBased443013624113067310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:51] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:13:51] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:51] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:13:52] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:13:52] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:13:52] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin14589681472154642770
[2022-05-19 00:13:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14589681472154642770
Running compilation step : cd /tmp/ltsmin14589681472154642770;'/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/ltsmin14589681472154642770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14589681472154642770;'/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/stateBased12975679685872441693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 00:14:07] [INFO ] Flatten gal took : 13 ms
[2022-05-19 00:14:07] [INFO ] Flatten gal took : 12 ms
[2022-05-19 00:14:07] [INFO ] Time to serialize gal into /tmp/LTL228234844590222206.gal : 2 ms
[2022-05-19 00:14:07] [INFO ] Time to serialize properties into /tmp/LTL9915059525503071893.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/LTL228234844590222206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9915059525503071893.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/LTL2282348...265
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(X("(p70==1)")))))U(((!(F("(p27==1)")))&&(G("((p24==1)&&(p53==1))")))&&(!("(((p146==1)&&(p154==1))&&(p182==1))")))))
Formula 0 simplified : !(FXFX"(p70==1)" U (!"(((p146==1)&&(p154==1))&&(p182==1))" & !F"(p27==1)" & G"((p24==1)&&(p53==1))"))
Detected timeout of ITS tools.
[2022-05-19 00:14:22] [INFO ] Flatten gal took : 17 ms
[2022-05-19 00:14:22] [INFO ] Applying decomposition
[2022-05-19 00:14:22] [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/graph17867634338732455601.txt' '-o' '/tmp/graph17867634338732455601.bin' '-w' '/tmp/graph17867634338732455601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17867634338732455601.bin' '-l' '-1' '-v' '-w' '/tmp/graph17867634338732455601.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:14:22] [INFO ] Decomposing Gal with order
[2022-05-19 00:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:14:22] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-19 00:14:22] [INFO ] Flatten gal took : 23 ms
[2022-05-19 00:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-19 00:14:22] [INFO ] Time to serialize gal into /tmp/LTL5778128366181934606.gal : 4 ms
[2022-05-19 00:14:22] [INFO ] Time to serialize properties into /tmp/LTL1951960223862745859.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/LTL5778128366181934606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1951960223862745859.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/LTL5778128...245
Read 1 LTL properties
Checking formula 0 : !(((F(X(F(X("(i4.i0.u23.p70==1)")))))U(((!(F("(i2.i0.u10.p27==1)")))&&(G("((i1.i2.u9.p24==1)&&(i1.i3.u18.p53==1))")))&&(!("(((i5.i2.u4...215
Formula 0 simplified : !(FXFX"(i4.i0.u23.p70==1)" U (!"(((i5.i2.u49.p146==1)&&(i5.i2.u52.p154==1))&&(i6.i1.u60.p182==1))" & !F"(i2.i0.u10.p27==1)" & G"((i1...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14488237869988221149
[2022-05-19 00:14:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14488237869988221149
Running compilation step : cd /tmp/ltsmin14488237869988221149;'/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 377 ms.
Running link step : cd /tmp/ltsmin14488237869988221149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14488237869988221149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(<>(X((LTLAPp0==true))))) U (!<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&!(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-02 finished in 87496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G(p0)&&p1))||!(!p2 U p3)||p2)))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 271 transition count 240
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 245 transition count 240
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 245 transition count 214
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 219 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 214 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 214 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 214 transition count 205
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 210 transition count 205
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 280 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 128 transition count 124
Applied a total of 283 rules in 27 ms. Remains 128 /272 variables (removed 144) and now considering 124/267 (removed 143) transitions.
// Phase 1: matrix 124 rows 128 cols
[2022-05-19 00:14:52] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:14:52] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 124 rows 128 cols
[2022-05-19 00:14:52] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:14:52] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-19 00:14:52] [INFO ] Redundant transitions in 20 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2022-05-19 00:14:52] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:14:52] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/272 places, 123/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 128/272 places, 123/267 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (OR (NOT p1) (NOT p0)), p3]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=p3, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s59 0) (EQ s70 0)), p3:(EQ s37 1), p1:(EQ s28 0), p2:(AND (EQ s59 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-03 finished in 494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(!(X(X(F(G(p0)))) U p1))))))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 263
Applied a total of 8 rules in 4 ms. Remains 268 /272 variables (removed 4) and now considering 263/267 (removed 4) transitions.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:14:53] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 00:14:53] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:14:53] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:14:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:14:53] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:14:53] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/272 places, 263/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/272 places, 263/267 transitions.
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 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=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s145 1), p0:(AND (EQ s227 1) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 198 reset in 243 ms.
Product exploration explored 100000 steps with 196 reset in 282 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 207 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 853 steps, including 1 resets, run visited all 3 properties in 13 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 195 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:14:55] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:14:55] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:14:55] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:14:55] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:14:55] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:14:55] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/268 places, 263/263 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 218 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 249 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 202 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 202 reset in 209 ms.
Product exploration explored 100000 steps with 196 reset in 231 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 197 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 268 transition count 263
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 25 place count 268 transition count 265
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 34 place count 268 transition count 265
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 140 place count 268 transition count 265
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 176 place count 232 transition count 229
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 212 place count 232 transition count 229
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 212 rules in 33 ms. Remains 232 /268 variables (removed 36) and now considering 229/263 (removed 34) transitions.
[2022-05-19 00:14:57] [INFO ] Redundant transitions in 21 ms returned [228]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 228 rows 232 cols
[2022-05-19 00:14:57] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:14:57] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/268 places, 228/263 transitions.
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 232/268 places, 228/263 transitions.
Product exploration explored 100000 steps with 535 reset in 237 ms.
Product exploration explored 100000 steps with 572 reset in 260 ms.
Built C files in :
/tmp/ltsmin10337242503240479160
[2022-05-19 00:14:57] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10337242503240479160
Running compilation step : cd /tmp/ltsmin10337242503240479160;'/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 369 ms.
Running link step : cd /tmp/ltsmin10337242503240479160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10337242503240479160;'/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/stateBased10559915962302207348.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Applied a total of 0 rules in 13 ms. Remains 268 /268 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:15:13] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:15:13] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:15:13] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:15:13] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:15:13] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 00:15:13] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/268 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin10640980879390919478
[2022-05-19 00:15:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10640980879390919478
Running compilation step : cd /tmp/ltsmin10640980879390919478;'/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 372 ms.
Running link step : cd /tmp/ltsmin10640980879390919478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10640980879390919478;'/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/stateBased17422896412477281396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 00:15:28] [INFO ] Flatten gal took : 11 ms
[2022-05-19 00:15:28] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:15:28] [INFO ] Time to serialize gal into /tmp/LTL1534605005671433256.gal : 2 ms
[2022-05-19 00:15:28] [INFO ] Time to serialize properties into /tmp/LTL11146294993063607235.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/LTL1534605005671433256.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11146294993063607235.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/LTL1534605...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(!((X(X(F(G("((p254==1)&&(p281==1))")))))U("(p161==1)"))))))))
Formula 0 simplified : !XXFX!(XXFG"((p254==1)&&(p281==1))" U "(p161==1)")
Detected timeout of ITS tools.
[2022-05-19 00:15:43] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:15:43] [INFO ] Applying decomposition
[2022-05-19 00:15:43] [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/graph13437437630747593826.txt' '-o' '/tmp/graph13437437630747593826.bin' '-w' '/tmp/graph13437437630747593826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13437437630747593826.bin' '-l' '-1' '-v' '-w' '/tmp/graph13437437630747593826.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:15:43] [INFO ] Decomposing Gal with order
[2022-05-19 00:15:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:15:43] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-19 00:15:43] [INFO ] Flatten gal took : 22 ms
[2022-05-19 00:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-19 00:15:43] [INFO ] Time to serialize gal into /tmp/LTL12698756820254500440.gal : 3 ms
[2022-05-19 00:15:43] [INFO ] Time to serialize properties into /tmp/LTL6868025887415650658.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/LTL12698756820254500440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6868025887415650658.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/LTL1269875...246
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(!((X(X(F(G("((i9.i0.u86.p254==1)&&(i9.i1.u94.p281==1))")))))U("(i5.i1.u55.p161==1)"))))))))
Formula 0 simplified : !XXFX!(XXFG"((i9.i0.u86.p254==1)&&(i9.i1.u94.p281==1))" U "(i5.i1.u55.p161==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1337693748199890583
[2022-05-19 00:15:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1337693748199890583
Running compilation step : cd /tmp/ltsmin1337693748199890583;'/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 369 ms.
Running link step : cd /tmp/ltsmin1337693748199890583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1337693748199890583;'/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(<>(X(!(X(X(<>([]((LTLAPp0==true))))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 80731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)&&p0))||F((F(p1)&&p2))||X(p2)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 263
Applied a total of 8 rules in 21 ms. Remains 268 /272 variables (removed 4) and now considering 263/267 (removed 4) transitions.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:16:13] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-19 00:16:13] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:16:13] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:14] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:16:14] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:14] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/272 places, 263/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/272 places, 263/267 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(EQ s212 1), p2:(EQ s259 1), p0:(EQ s259 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 92336 steps with 271 reset in 198 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 928 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p1)&&p0))))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 267 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 262
Applied a total of 10 rules in 17 ms. Remains 267 /272 variables (removed 5) and now considering 262/267 (removed 5) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:14] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:16:14] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:14] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:15] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:15] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:15] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/272 places, 262/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/272 places, 262/267 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s22 1) (EQ s37 1)), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-06 finished in 498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(G(p0))||p1))||X(p2)))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 263
Applied a total of 8 rules in 7 ms. Remains 268 /272 variables (removed 4) and now considering 263/267 (removed 4) transitions.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:16:15] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:15] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:16:15] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:15] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 268 cols
[2022-05-19 00:16:15] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/272 places, 263/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/272 places, 263/267 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(EQ s10 1), p1:(EQ s162 1), p0:(EQ s148 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 116 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-07 finished in 630 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 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 267 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 262
Applied a total of 10 rules in 8 ms. Remains 267 /272 variables (removed 5) and now considering 262/267 (removed 5) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:15] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-19 00:16:15] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:15] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:16] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:16] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:16] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/272 places, 262/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/272 places, 262/267 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s28 1) (NEQ s36 1) (NEQ s57 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]]
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-005B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-08 finished in 964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 271 transition count 240
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 245 transition count 240
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 245 transition count 214
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 219 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 214 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 214 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 214 transition count 205
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 210 transition count 205
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 284 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 126 transition count 122
Applied a total of 287 rules in 27 ms. Remains 126 /272 variables (removed 146) and now considering 122/267 (removed 145) transitions.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:16:16] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:16] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:16:16] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:16] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-05-19 00:16:17] [INFO ] Redundant transitions in 23 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:16:17] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:17] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/272 places, 121/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 126/272 places, 121/267 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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 27792 reset in 152 ms.
Product exploration explored 100000 steps with 27617 reset in 161 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/126 stabilizing places and 2/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 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)]
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 164 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 38 ms :[(NOT p0)]
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:16:17] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:17] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2022-05-19 00:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 00:16:17] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-19 00:16:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 00:16:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 00:16:18] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-19 00:16:18] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2022-05-19 00:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-19 00:16:18] [INFO ] Computed and/alt/rep : 114/348/114 causal constraints (skipped 5 transitions) in 7 ms.
[2022-05-19 00:16:18] [INFO ] Added : 46 causal constraints over 10 iterations in 144 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:16:18] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:18] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:16:18] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:18] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-19 00:16:18] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:16:18] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 121/121 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/126 stabilizing places and 2/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 152 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 32 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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 175 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)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:16:18] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:16:18] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2022-05-19 00:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 00:16:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-19 00:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 00:16:19] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2022-05-19 00:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 00:16:19] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-19 00:16:19] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2022-05-19 00:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-19 00:16:19] [INFO ] Computed and/alt/rep : 114/348/114 causal constraints (skipped 5 transitions) in 9 ms.
[2022-05-19 00:16:19] [INFO ] Added : 46 causal constraints over 10 iterations in 150 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27799 reset in 148 ms.
Product exploration explored 100000 steps with 27466 reset in 180 ms.
Built C files in :
/tmp/ltsmin10415598471603066814
[2022-05-19 00:16:19] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2022-05-19 00:16:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:16:19] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2022-05-19 00:16:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:16:19] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2022-05-19 00:16:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:16:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10415598471603066814
Running compilation step : cd /tmp/ltsmin10415598471603066814;'/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 244 ms.
Running link step : cd /tmp/ltsmin10415598471603066814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10415598471603066814;'/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/stateBased13327860237687049101.hoa' '--buchi-type=spotba'
LTSmin run took 182 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLFireability-09 finished in 3397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||G(p2))))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 271 transition count 240
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 245 transition count 240
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 245 transition count 214
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 219 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 215 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 112 place count 215 transition count 207
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 118 place count 212 transition count 207
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 282 place count 130 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 128 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 285 place count 127 transition count 123
Applied a total of 285 rules in 20 ms. Remains 127 /272 variables (removed 145) and now considering 123/267 (removed 144) transitions.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:20] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-19 00:16:20] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:20] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:20] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-19 00:16:20] [INFO ] Redundant transitions in 17 ms returned [122]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 122 rows 127 cols
[2022-05-19 00:16:20] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:16:20] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/272 places, 122/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 127/272 places, 122/267 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s13 0), p2:(EQ s94 0), p0:(EQ s79 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 93 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U G(p1))||X(G(p2))||p3)))'
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 267 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 262
Applied a total of 10 rules in 12 ms. Remains 267 /272 variables (removed 5) and now considering 262/267 (removed 5) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:20] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:20] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:20] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:21] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:21] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-19 00:16:21] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/272 places, 262/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/272 places, 262/267 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p3 p1 p2) (AND p0 p1 p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p3 p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s88 1) (EQ s168 1)), p0:(AND (EQ s126 1) (EQ s141 1)), p1:(EQ s163 1), p2:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1676 reset in 187 ms.
Product exploration explored 100000 steps with 1693 reset in 196 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/267 stabilizing places and 59/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 609 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 9) seen :5
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 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:16:22] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:16:22] [INFO ] [Real]Absence check using 46 positive place invariants in 8 ms returned sat
[2022-05-19 00:16:22] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-19 00:16:22] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2022-05-19 00:16:23] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 267 ms
[2022-05-19 00:16:23] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 00:16:23] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 262/262 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 267 transition count 237
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 242 transition count 237
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 242 transition count 212
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 217 transition count 212
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 272 place count 131 transition count 126
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 303 place count 131 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 305 place count 129 transition count 125
Applied a total of 305 rules in 17 ms. Remains 129 /267 variables (removed 138) and now considering 125/262 (removed 137) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/267 places, 125/262 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:16:23] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:16:23] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:16:23] [INFO ] [Nat]Absence check using 43 positive place invariants in 12 ms returned sat
[2022-05-19 00:16:23] [INFO ] [Nat]Absence check using 43 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 00:16:23] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-19 00:16:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 139 ms
[2022-05-19 00:16:23] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 00:16:23] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 125/125 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 128 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 127 transition count 123
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 127 transition count 123
Applied a total of 5 rules in 7 ms. Remains 127 /129 variables (removed 2) and now considering 123/125 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/129 places, 123/125 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1686543 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :{}
Probabilistic random walk after 1686543 steps, saw 344189 distinct states, run finished after 3004 ms. (steps per millisecond=561 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:26] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:16:26] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:16:26] [INFO ] [Nat]Absence check using 43 positive place invariants in 10 ms returned sat
[2022-05-19 00:16:26] [INFO ] [Nat]Absence check using 43 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 00:16:26] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:16:26] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-19 00:16:26] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-19 00:16:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2022-05-19 00:16:26] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 00:16:27] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:27] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:27] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:27] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:16:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-19 00:16:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:27] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:27] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:16:27] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:16:27] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:16:27] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2022-05-19 00:16:27] [INFO ] [Nat]Absence check using 43 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 00:16:27] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:16:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-05-19 00:16:27] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-05-19 00:16:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2022-05-19 00:16:27] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 00:16:27] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 00:16:27] [INFO ] Flatten gal took : 7 ms
[2022-05-19 00:16:27] [INFO ] Flatten gal took : 7 ms
[2022-05-19 00:16:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17764072984289304927.gal : 1 ms
[2022-05-19 00:16:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4882033110098289564.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1707915953412642774;'/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/ReachabilityCardinality17764072984289304927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4882033110098289564.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/ReachabilityCardinality4882033110098289564.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 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 71
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71 after 232
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :232 after 1881
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1881 after 2786
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2786 after 13177
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13177 after 216149
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :216149 after 5.99942e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.99942e+06 after 2.79647e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.79647e+08 after 2.49539e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.49539e+09 after 3.08761e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.08761e+10 after 6.47118e+11
Detected timeout of ITS tools.
[2022-05-19 00:16:42] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:16:42] [INFO ] Applying decomposition
[2022-05-19 00:16:42] [INFO ] Flatten gal took : 7 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/graph6453753248711234077.txt' '-o' '/tmp/graph6453753248711234077.bin' '-w' '/tmp/graph6453753248711234077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6453753248711234077.bin' '-l' '-1' '-v' '-w' '/tmp/graph6453753248711234077.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:16:42] [INFO ] Decomposing Gal with order
[2022-05-19 00:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:16:42] [INFO ] Removed a total of 98 redundant transitions.
[2022-05-19 00:16:42] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 3 ms.
[2022-05-19 00:16:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8554568410048070920.gal : 2 ms
[2022-05-19 00:16:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16945927028034646988.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1707915953412642774;'/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/ReachabilityCardinality8554568410048070920.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16945927028034646988.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/ReachabilityCardinality16945927028034646988.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 :272 after 1514
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1514 after 270650
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :270650 after 3.55602e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17133612036310004061
[2022-05-19 00:16:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17133612036310004061
Running compilation step : cd /tmp/ltsmin17133612036310004061;'/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 222 ms.
Running link step : cd /tmp/ltsmin17133612036310004061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17133612036310004061;'/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' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p3 p2 (NOT p0) p1))), (G (NOT (AND p3 p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p3) (NOT p0) p1)), (F (OR (AND p3 p2 p1) (AND p2 p0 p1))), (F (AND (NOT p3) p0)), (F p0), (F p1)]
Knowledge based reduction with 16 factoid took 892 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 209 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:17:14] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:17:14] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:17:14] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:17:14] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:17:14] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:17:14] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 262/262 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/267 stabilizing places and 59/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p3) p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 503 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 5 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 226 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:17:15] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:17:15] [INFO ] [Real]Absence check using 46 positive place invariants in 8 ms returned sat
[2022-05-19 00:17:15] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 00:17:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 8 ms returned sat
[2022-05-19 00:17:15] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-19 00:17:15] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-05-19 00:17:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 438 ms
[2022-05-19 00:17:16] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 00:17:16] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 262/262 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 267 transition count 237
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 242 transition count 237
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 242 transition count 212
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 217 transition count 212
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 272 place count 131 transition count 126
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 304 place count 131 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 306 place count 129 transition count 125
Applied a total of 306 rules in 15 ms. Remains 129 /267 variables (removed 138) and now considering 125/262 (removed 137) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/267 places, 125/262 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:17:16] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:17:16] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:17:16] [INFO ] [Nat]Absence check using 43 positive place invariants in 6 ms returned sat
[2022-05-19 00:17:16] [INFO ] [Nat]Absence check using 43 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 00:17:16] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:17:16] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2022-05-19 00:17:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-19 00:17:16] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-05-19 00:17:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2022-05-19 00:17:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 149 ms
[2022-05-19 00:17:16] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 00:17:16] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 125/125 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 128 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 127 transition count 123
Applied a total of 4 rules in 6 ms. Remains 127 /129 variables (removed 2) and now considering 123/125 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/129 places, 123/125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1676413 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :{}
Probabilistic random walk after 1676413 steps, saw 342090 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:17:19] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-19 00:17:19] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:17:19] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2022-05-19 00:17:19] [INFO ] [Nat]Absence check using 43 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 00:17:19] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:17:19] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-05-19 00:17:19] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-05-19 00:17:19] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-19 00:17:19] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2022-05-19 00:17:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 142 ms
[2022-05-19 00:17:19] [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-19 00:17:19] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:17:19] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:17:19] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:17:19] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:17:19] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-05-19 00:17:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:17:19] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:17:20] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:17:20] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:17:20] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:17:20] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2022-05-19 00:17:20] [INFO ] [Nat]Absence check using 43 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 00:17:20] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:17:20] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-19 00:17:20] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2022-05-19 00:17:20] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-19 00:17:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-19 00:17:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 150 ms
[2022-05-19 00:17:20] [INFO ] After 192ms 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-19 00:17:20] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 00:17:20] [INFO ] Flatten gal took : 8 ms
[2022-05-19 00:17:20] [INFO ] Flatten gal took : 6 ms
[2022-05-19 00:17:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2649600468379292098.gal : 1 ms
[2022-05-19 00:17:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4533837750149221746.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13023551212653675333;'/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/ReachabilityCardinality2649600468379292098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4533837750149221746.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/ReachabilityCardinality4533837750149221746.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 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 71
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71 after 232
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :232 after 1881
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1881 after 2786
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2786 after 13177
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13177 after 216149
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :216149 after 5.99942e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.99942e+06 after 2.79647e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.79647e+08 after 2.49539e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.49539e+09 after 3.08761e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.08761e+10 after 6.47118e+11
Detected timeout of ITS tools.
[2022-05-19 00:17:35] [INFO ] Flatten gal took : 6 ms
[2022-05-19 00:17:35] [INFO ] Applying decomposition
[2022-05-19 00:17:35] [INFO ] Flatten gal took : 5 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/graph4748714280412756903.txt' '-o' '/tmp/graph4748714280412756903.bin' '-w' '/tmp/graph4748714280412756903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4748714280412756903.bin' '-l' '-1' '-v' '-w' '/tmp/graph4748714280412756903.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:17:35] [INFO ] Decomposing Gal with order
[2022-05-19 00:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:17:35] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-19 00:17:35] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 2 ms.
[2022-05-19 00:17:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3337796458342640719.gal : 1 ms
[2022-05-19 00:17:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7766164862719703915.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13023551212653675333;'/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/ReachabilityCardinality3337796458342640719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7766164862719703915.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/ReachabilityCardinality7766164862719703915.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 :272 after 272
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :272 after 3620
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3620 after 765884
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :765884 after 8.68779e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.68779e+06 after 4.79112e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13840012089783677856
[2022-05-19 00:17:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13840012089783677856
Running compilation step : cd /tmp/ltsmin13840012089783677856;'/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 224 ms.
Running link step : cd /tmp/ltsmin13840012089783677856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13840012089783677856;'/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' 'apf4==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p3) p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F p0), (F (OR (AND (NOT p3) p1) (AND (NOT p2) p1))), (F (AND (NOT p3) p1 (NOT p0))), (F (AND p2 p1 p0)), (F (AND (NOT p3) p0))]
Knowledge based reduction with 9 factoid took 537 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 5 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 191 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 204 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 171 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 1687 reset in 193 ms.
Product exploration explored 100000 steps with 1746 reset in 188 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 262
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 24 place count 267 transition count 264
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 267 transition count 264
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 136 place count 267 transition count 264
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 170 place count 233 transition count 230
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 204 place count 233 transition count 230
Deduced a syphon composed of 102 places in 0 ms
Applied a total of 204 rules in 29 ms. Remains 233 /267 variables (removed 34) and now considering 230/262 (removed 32) transitions.
[2022-05-19 00:18:07] [INFO ] Redundant transitions in 20 ms returned [229]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 229 rows 233 cols
[2022-05-19 00:18:07] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:18:07] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/267 places, 229/262 transitions.
Deduced a syphon composed of 102 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 233 /233 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 233/267 places, 229/262 transitions.
Product exploration explored 100000 steps with 1723 reset in 216 ms.
Product exploration explored 100000 steps with 1687 reset in 236 ms.
Built C files in :
/tmp/ltsmin7201467507897344587
[2022-05-19 00:18:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7201467507897344587
Running compilation step : cd /tmp/ltsmin7201467507897344587;'/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 375 ms.
Running link step : cd /tmp/ltsmin7201467507897344587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7201467507897344587;'/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/stateBased4093896333812688974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:18:23] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:18:23] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:18:23] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:18:23] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:18:23] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:18:23] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/267 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin7783189963210831760
[2022-05-19 00:18:23] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7783189963210831760
Running compilation step : cd /tmp/ltsmin7783189963210831760;'/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 380 ms.
Running link step : cd /tmp/ltsmin7783189963210831760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7783189963210831760;'/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/stateBased6704367868815141283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 00:18:38] [INFO ] Flatten gal took : 8 ms
[2022-05-19 00:18:38] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:18:38] [INFO ] Time to serialize gal into /tmp/LTL544097183311114127.gal : 1 ms
[2022-05-19 00:18:38] [INFO ] Time to serialize properties into /tmp/LTL17536306144363695044.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/LTL544097183311114127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17536306144363695044.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/LTL5440971...266
Read 1 LTL properties
Checking formula 0 : !((G(((!(("((p140==1)&&(p156==1))")U(G("(p183==1)"))))||(X(G("(p189==0)"))))||("((p95==1)&&(p189==1))"))))
Formula 0 simplified : !G("((p95==1)&&(p189==1))" | !("((p140==1)&&(p156==1))" U G"(p183==1)") | XG"(p189==0)")
Detected timeout of ITS tools.
[2022-05-19 00:18:53] [INFO ] Flatten gal took : 12 ms
[2022-05-19 00:18:53] [INFO ] Applying decomposition
[2022-05-19 00:18:53] [INFO ] Flatten gal took : 7 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/graph5513977238153689655.txt' '-o' '/tmp/graph5513977238153689655.bin' '-w' '/tmp/graph5513977238153689655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5513977238153689655.bin' '-l' '-1' '-v' '-w' '/tmp/graph5513977238153689655.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:18:53] [INFO ] Decomposing Gal with order
[2022-05-19 00:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:18:53] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-19 00:18:53] [INFO ] Flatten gal took : 14 ms
[2022-05-19 00:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-19 00:18:53] [INFO ] Time to serialize gal into /tmp/LTL11008298371087315474.gal : 2 ms
[2022-05-19 00:18:53] [INFO ] Time to serialize properties into /tmp/LTL75236828282803634.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/LTL11008298371087315474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL75236828282803634.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/LTL1100829...244
Read 1 LTL properties
Checking formula 0 : !((G(((!(("((i4.i2.u48.p140==1)&&(i4.i3.u53.p156==1))")U(G("(i5.i2.u61.p183==1)"))))||(X(G("(i6.i2.u64.p189==0)"))))||("((i2.i3.u33.p9...187
Formula 0 simplified : !G("((i2.i3.u33.p95==1)&&(i6.i2.u64.p189==1))" | !("((i4.i2.u48.p140==1)&&(i4.i3.u53.p156==1))" U G"(i5.i2.u61.p183==1)") | XG"(i6.i...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8047525909679364823
[2022-05-19 00:19:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8047525909679364823
Running compilation step : cd /tmp/ltsmin8047525909679364823;'/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 360 ms.
Running link step : cd /tmp/ltsmin8047525909679364823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8047525909679364823;'/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) U []((LTLAPp1==true)))||X([]((LTLAPp2==true)))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-11 finished in 183094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(!(!F(p0) U (G(p1)&&p2)))))))'
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 271 transition count 241
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 246 transition count 241
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 246 transition count 216
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 221 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 216 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 110 place count 216 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 212 transition count 207
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 278 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 129 transition count 125
Applied a total of 281 rules in 19 ms. Remains 129 /272 variables (removed 143) and now considering 125/267 (removed 142) transitions.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:19:23] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:19:23] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:19:23] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:19:23] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-19 00:19:24] [INFO ] Redundant transitions in 19 ms returned [124]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:24] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:19:24] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/272 places, 124/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 129/272 places, 124/267 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND p1 p2), (AND p1 p2), (AND p2 p1 (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s49 1), p1:(AND (EQ s111 1) (EQ s124 1)), p0:(AND (EQ s28 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 457 reset in 213 ms.
Product exploration explored 100000 steps with 478 reset in 234 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 212 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 114 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 281 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 109 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:25] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:19:25] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:25] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:19:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-19 00:19:25] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:25] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:19:25] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 124/124 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 194 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 107 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Finished random walk after 115 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 230 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 109 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Product exploration explored 100000 steps with 460 reset in 215 ms.
Product exploration explored 100000 steps with 456 reset in 237 ms.
Built C files in :
/tmp/ltsmin10075071344808255239
[2022-05-19 00:19:27] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2022-05-19 00:19:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:19:27] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2022-05-19 00:19:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:19:27] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2022-05-19 00:19:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:19:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10075071344808255239
Running compilation step : cd /tmp/ltsmin10075071344808255239;'/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 228 ms.
Running link step : cd /tmp/ltsmin10075071344808255239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10075071344808255239;'/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/stateBased8599318281275710327.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:42] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:19:42] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:42] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:19:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-19 00:19:42] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:19:42] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:19:42] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 124/124 transitions.
Built C files in :
/tmp/ltsmin4243253364385671716
[2022-05-19 00:19:42] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2022-05-19 00:19:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:19:42] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2022-05-19 00:19:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:19:42] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2022-05-19 00:19:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:19:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4243253364385671716
Running compilation step : cd /tmp/ltsmin4243253364385671716;'/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 246 ms.
Running link step : cd /tmp/ltsmin4243253364385671716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4243253364385671716;'/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/stateBased374313974232403575.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 00:19:57] [INFO ] Flatten gal took : 8 ms
[2022-05-19 00:19:57] [INFO ] Flatten gal took : 5 ms
[2022-05-19 00:19:57] [INFO ] Time to serialize gal into /tmp/LTL8415519715500046412.gal : 1 ms
[2022-05-19 00:19:57] [INFO ] Time to serialize properties into /tmp/LTL6598453911716305411.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/LTL8415519715500046412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6598453911716305411.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/LTL8415519...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(!((!(F("((p75==1)&&(p117==1))")))U((G("((p260==1)&&(p289==1))"))&&("(p111==1)")))))))))
Formula 0 simplified : !GFGF!(!F"((p75==1)&&(p117==1))" U ("(p111==1)" & G"((p260==1)&&(p289==1))"))
Detected timeout of ITS tools.
[2022-05-19 00:20:12] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:20:12] [INFO ] Applying decomposition
[2022-05-19 00:20:12] [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/graph12779815847475774933.txt' '-o' '/tmp/graph12779815847475774933.bin' '-w' '/tmp/graph12779815847475774933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12779815847475774933.bin' '-l' '-1' '-v' '-w' '/tmp/graph12779815847475774933.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:20:12] [INFO ] Decomposing Gal with order
[2022-05-19 00:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:20:12] [INFO ] Removed a total of 78 redundant transitions.
[2022-05-19 00:20:12] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 2 ms.
[2022-05-19 00:20:12] [INFO ] Time to serialize gal into /tmp/LTL7245912166801521505.gal : 1 ms
[2022-05-19 00:20:12] [INFO ] Time to serialize properties into /tmp/LTL5841403034428080625.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/LTL7245912166801521505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5841403034428080625.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/LTL7245912...245
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(!((!(F("((i1.i0.u10.p75==1)&&(i1.i2.u18.p117==1))")))U((G("((i4.i0.u39.p260==1)&&(i4.i3.u45.p289==1))"))&&("(i1.i1.u17.p111...169
Formula 0 simplified : !GFGF!(!F"((i1.i0.u10.p75==1)&&(i1.i2.u18.p117==1))" U ("(i1.i1.u17.p111==1)" & G"((i4.i0.u39.p260==1)&&(i4.i3.u45.p289==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17609805808854148016
[2022-05-19 00:20:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17609805808854148016
Running compilation step : cd /tmp/ltsmin17609805808854148016;'/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 232 ms.
Running link step : cd /tmp/ltsmin17609805808854148016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17609805808854148016;'/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)) U ([]((LTLAPp1==true))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-12 finished in 78965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 271 transition count 240
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 245 transition count 240
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 245 transition count 214
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 219 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 214 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 214 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 214 transition count 205
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 210 transition count 205
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 286 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 289 place count 125 transition count 121
Applied a total of 289 rules in 19 ms. Remains 125 /272 variables (removed 147) and now considering 121/267 (removed 146) transitions.
// Phase 1: matrix 121 rows 125 cols
[2022-05-19 00:20:42] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:42] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 121 rows 125 cols
[2022-05-19 00:20:42] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:20:42] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-19 00:20:42] [INFO ] Redundant transitions in 17 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 120 rows 125 cols
[2022-05-19 00:20:42] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:20:43] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/272 places, 120/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 125/272 places, 120/267 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s81 1) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 708 steps with 4 reset in 4 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-13 finished in 318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(F(p1)))))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 267 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 262
Applied a total of 10 rules in 7 ms. Remains 267 /272 variables (removed 5) and now considering 262/267 (removed 5) transitions.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:20:43] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-19 00:20:43] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:20:43] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-19 00:20:43] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2022-05-19 00:20:43] [INFO ] Computed 46 place invariants in 0 ms
[2022-05-19 00:20:43] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/272 places, 262/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/272 places, 262/267 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s89 1), p1:(NEQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1245 steps with 1 reset in 4 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-14 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 271 transition count 241
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 246 transition count 241
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 246 transition count 215
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 220 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 216 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 110 place count 216 transition count 208
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 116 place count 213 transition count 208
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 280 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 128 transition count 124
Applied a total of 283 rules in 17 ms. Remains 128 /272 variables (removed 144) and now considering 124/267 (removed 143) transitions.
// Phase 1: matrix 124 rows 128 cols
[2022-05-19 00:20:43] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:43] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 124 rows 128 cols
[2022-05-19 00:20:43] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:20:43] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-19 00:20:43] [INFO ] Redundant transitions in 22 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2022-05-19 00:20:43] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:43] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/272 places, 123/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 128/272 places, 123/267 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s70 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 314 steps with 2 reset in 3 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-15 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(X(p0)))) U (!F(p1)&&G(p2)&&!p3)))'
Found a CL insensitive property : ShieldIIPs-PT-005B-LTLFireability-02
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) p3 p1), (NOT p0), (OR (NOT p2) p1), (NOT p0)]
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 271 transition count 242
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 247 transition count 242
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 247 transition count 216
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 221 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 216 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 110 place count 216 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 212 transition count 207
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 276 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 131 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 130 transition count 126
Applied a total of 279 rules in 15 ms. Remains 130 /272 variables (removed 142) and now considering 126/267 (removed 141) transitions.
// Phase 1: matrix 126 rows 130 cols
[2022-05-19 00:20:44] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:44] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 126 rows 130 cols
[2022-05-19 00:20:44] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-19 00:20:44] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 130 cols
[2022-05-19 00:20:44] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:20:44] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 130/272 places, 126/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/272 places, 126/267 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2) p3), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s11 1), p2:(AND (EQ s8 1) (EQ s25 1)), p3:(AND (EQ s65 1) (EQ s70 1) (EQ s82 1)), p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 315 steps with 1 reset in 0 ms.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-02 finished in 465 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(!(X(X(F(G(p0)))) U p1))))))'
Found a CL insensitive property : ShieldIIPs-PT-005B-LTLFireability-04
Stuttering acceptance computed with spot in 210 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 271 transition count 240
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 245 transition count 240
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 245 transition count 216
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 221 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 217 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 217 transition count 212
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 108 place count 217 transition count 208
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 213 transition count 208
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 284 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 126 transition count 122
Applied a total of 287 rules in 18 ms. Remains 126 /272 variables (removed 146) and now considering 122/267 (removed 145) transitions.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:20:44] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:44] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:20:44] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:44] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:20:44] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:20:44] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 126/272 places, 122/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/272 places, 122/267 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 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=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s67 1), p0:(AND (EQ s104 1) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 582 reset in 218 ms.
Product exploration explored 100000 steps with 565 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 195 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 368 steps, including 1 resets, run visited all 3 properties in 14 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 199 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:20:46] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:46] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:20:46] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:20:46] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:20:46] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-19 00:20:46] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 122/122 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 : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 48 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 268 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 176 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 574 reset in 231 ms.
Product exploration explored 100000 steps with 599 reset in 236 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 197 ms :[p1, p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2022-05-19 00:20:48] [INFO ] Redundant transitions in 22 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2022-05-19 00:20:48] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 121/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 126/126 places, 121/122 transitions.
Product exploration explored 100000 steps with 570 reset in 221 ms.
Product exploration explored 100000 steps with 569 reset in 253 ms.
Built C files in :
/tmp/ltsmin13687986684731892003
[2022-05-19 00:20:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13687986684731892003
Running compilation step : cd /tmp/ltsmin13687986684731892003;'/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 213 ms.
Running link step : cd /tmp/ltsmin13687986684731892003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13687986684731892003;'/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/stateBased10862710798531054351.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:21:03] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:21:04] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:21:04] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:21:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 126 cols
[2022-05-19 00:21:04] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin15948303128218255557
[2022-05-19 00:21:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15948303128218255557
Running compilation step : cd /tmp/ltsmin15948303128218255557;'/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 206 ms.
Running link step : cd /tmp/ltsmin15948303128218255557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15948303128218255557;'/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/stateBased12232320514411582389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 00:21:19] [INFO ] Flatten gal took : 5 ms
[2022-05-19 00:21:19] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:21:19] [INFO ] Time to serialize gal into /tmp/LTL6699435636381546917.gal : 2 ms
[2022-05-19 00:21:19] [INFO ] Time to serialize properties into /tmp/LTL1920902745259611712.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/LTL6699435636381546917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1920902745259611712.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/LTL6699435...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(!((X(X(F(G("((p254==1)&&(p281==1))")))))U("(p161==1)"))))))))
Formula 0 simplified : !XXFX!(XXFG"((p254==1)&&(p281==1))" U "(p161==1)")
Detected timeout of ITS tools.
[2022-05-19 00:21:34] [INFO ] Flatten gal took : 12 ms
[2022-05-19 00:21:34] [INFO ] Applying decomposition
[2022-05-19 00:21:34] [INFO ] Flatten gal took : 4 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/graph17011571336182407840.txt' '-o' '/tmp/graph17011571336182407840.bin' '-w' '/tmp/graph17011571336182407840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17011571336182407840.bin' '-l' '-1' '-v' '-w' '/tmp/graph17011571336182407840.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:21:34] [INFO ] Decomposing Gal with order
[2022-05-19 00:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:21:34] [INFO ] Removed a total of 77 redundant transitions.
[2022-05-19 00:21:34] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2022-05-19 00:21:34] [INFO ] Time to serialize gal into /tmp/LTL5225354417704508953.gal : 1 ms
[2022-05-19 00:21:34] [INFO ] Time to serialize properties into /tmp/LTL3436388540414994719.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/LTL5225354417704508953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3436388540414994719.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/LTL5225354...245
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(!((X(X(F(G("((i6.u37.p254==1)&&(i6.u42.p281==1))")))))U("(i2.u25.p161==1)"))))))))
Formula 0 simplified : !XXFX!(XXFG"((i6.u37.p254==1)&&(i6.u42.p281==1))" U "(i2.u25.p161==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17007114263849800993
[2022-05-19 00:21:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17007114263849800993
Running compilation step : cd /tmp/ltsmin17007114263849800993;'/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 207 ms.
Running link step : cd /tmp/ltsmin17007114263849800993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17007114263849800993;'/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(<>(X(!(X(X(<>([]((LTLAPp0==true))))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 80124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U G(p1))||X(G(p2))||p3)))'
Found a SL insensitive property : ShieldIIPs-PT-005B-LTLFireability-11
Stuttering acceptance computed with spot in 186 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 272/272 places, 267/267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 271 transition count 241
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 246 transition count 241
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 246 transition count 216
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 221 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 216 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 110 place count 216 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 212 transition count 207
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 278 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 129 transition count 125
Applied a total of 281 rules in 18 ms. Remains 129 /272 variables (removed 143) and now considering 125/267 (removed 142) transitions.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:04] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:04] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:04] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:22:04] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:04] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:22:04] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 129/272 places, 125/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/272 places, 125/267 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p3 p1 p2) (AND p0 p1 p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p3 p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s40 1) (EQ s81 1)), p0:(AND (EQ s56 1) (EQ s67 1)), p1:(EQ s79 1), p2:(EQ s81 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5559 reset in 200 ms.
Product exploration explored 100000 steps with 5368 reset in 225 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/129 stabilizing places and 2/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2)))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 759 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 204 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:06] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:06] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-19 00:22:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:22:06] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-19 00:22:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2022-05-19 00:22:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2022-05-19 00:22:06] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2022-05-19 00:22:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2022-05-19 00:22:06] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 00:22:06] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 125/125 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 128 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 127 transition count 123
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 127 transition count 123
Applied a total of 32 rules in 7 ms. Remains 127 /129 variables (removed 2) and now considering 123/125 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/129 places, 123/125 transitions.
Incomplete random walk after 10000 steps, including 2 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1683926 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :{}
Probabilistic random walk after 1683926 steps, saw 329465 distinct states, run finished after 3001 ms. (steps per millisecond=561 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:22:09] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:09] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:22:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:22:09] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:22:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-05-19 00:22:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2022-05-19 00:22:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-05-19 00:22:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 98 ms
[2022-05-19 00:22:10] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-19 00:22:10] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:22:10] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:22:10] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:22:10] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-05-19 00:22:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:22:10] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:22:10] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:22:10] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:10] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:22:10] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:22:10] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:22:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-19 00:22:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2022-05-19 00:22:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2022-05-19 00:22:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2022-05-19 00:22:10] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 00:22:10] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 00:22:10] [INFO ] Flatten gal took : 6 ms
[2022-05-19 00:22:10] [INFO ] Flatten gal took : 6 ms
[2022-05-19 00:22:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4174665982278147093.gal : 1 ms
[2022-05-19 00:22:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12483010629467103298.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1682159668147459829;'/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/ReachabilityCardinality4174665982278147093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12483010629467103298.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/ReachabilityCardinality12483010629467103298.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 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 53
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53 after 115
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :115 after 2339
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2339 after 3485
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3485 after 21861
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :21861 after 93028
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :93028 after 1.01606e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.01606e+07 after 5.37244e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.37244e+08 after 4.09491e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.09491e+10 after 2.00618e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.2687e+14 after 1.53252e+15
Detected timeout of ITS tools.
[2022-05-19 00:22:25] [INFO ] Flatten gal took : 8 ms
[2022-05-19 00:22:25] [INFO ] Applying decomposition
[2022-05-19 00:22:25] [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/graph9936697809594140894.txt' '-o' '/tmp/graph9936697809594140894.bin' '-w' '/tmp/graph9936697809594140894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9936697809594140894.bin' '-l' '-1' '-v' '-w' '/tmp/graph9936697809594140894.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:22:25] [INFO ] Decomposing Gal with order
[2022-05-19 00:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:22:25] [INFO ] Removed a total of 101 redundant transitions.
[2022-05-19 00:22:25] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 3 ms.
[2022-05-19 00:22:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14645330136013850729.gal : 2 ms
[2022-05-19 00:22:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5021893958456869225.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1682159668147459829;'/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/ReachabilityCardinality14645330136013850729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5021893958456869225.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/ReachabilityCardinality5021893958456869225.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :356 after 2036
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2036 after 1.59468e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.59468e+06 after 1.76892e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12494501843954639162
[2022-05-19 00:22:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12494501843954639162
Running compilation step : cd /tmp/ltsmin12494501843954639162;'/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 224 ms.
Running link step : cd /tmp/ltsmin12494501843954639162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12494501843954639162;'/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' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 p2))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2)))), (X (X (NOT (AND p3 (NOT p0) p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p3 p1 p2) (AND p0 p1 p2))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 p2 p3 (NOT p0)))), (G (NOT (AND p2 p3 p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p3) (NOT p0))), (F (OR (AND p1 p2 p3) (AND p1 p2 p0))), (F (AND (NOT p3) p0)), (F p0), (F p1)]
Knowledge based reduction with 14 factoid took 939 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 181 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 195 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:57] [INFO ] Computed 45 place invariants in 7 ms
[2022-05-19 00:22:57] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:57] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:57] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:57] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 125/125 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/129 stabilizing places and 2/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) p1) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p3) p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 7 factoid took 492 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 5 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:22:58] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:22:58] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:22:58] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:22:58] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:22:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-05-19 00:22:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-19 00:22:58] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2022-05-19 00:22:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 90 ms
[2022-05-19 00:22:58] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 00:22:58] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 125/125 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 128 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 127 transition count 123
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 127 transition count 123
Applied a total of 32 rules in 6 ms. Remains 127 /129 variables (removed 2) and now considering 123/125 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/129 places, 123/125 transitions.
Incomplete random walk after 10000 steps, including 2 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1674957 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :{}
Probabilistic random walk after 1674957 steps, saw 328281 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:23:01] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:23:01] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:23:01] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:23:01] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:23:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-19 00:23:01] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2022-05-19 00:23:01] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2022-05-19 00:23:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2022-05-19 00:23:01] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 00:23:01] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:23:01] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:23:01] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:23:01] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:23:01] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-05-19 00:23:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:23:01] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:23:01] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 127 cols
[2022-05-19 00:23:01] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:23:01] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 00:23:01] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-19 00:23:01] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 00:23:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-19 00:23:01] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2022-05-19 00:23:01] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-05-19 00:23:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2022-05-19 00:23:01] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 00:23:02] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 00:23:02] [INFO ] Flatten gal took : 8 ms
[2022-05-19 00:23:02] [INFO ] Flatten gal took : 4 ms
[2022-05-19 00:23:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4178153700769043820.gal : 1 ms
[2022-05-19 00:23:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8895408584692012584.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13775593333623673846;'/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/ReachabilityCardinality4178153700769043820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8895408584692012584.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/ReachabilityCardinality8895408584692012584.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 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 53
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53 after 115
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :115 after 2339
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2339 after 3485
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3485 after 21861
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :21861 after 93028
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :93028 after 1.01606e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.01606e+07 after 5.37244e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.37244e+08 after 4.09491e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.09491e+10 after 2.00618e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.2687e+14 after 1.53252e+15
Detected timeout of ITS tools.
[2022-05-19 00:23:17] [INFO ] Flatten gal took : 13 ms
[2022-05-19 00:23:17] [INFO ] Applying decomposition
[2022-05-19 00:23:17] [INFO ] Flatten gal took : 4 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/graph4397639808187213938.txt' '-o' '/tmp/graph4397639808187213938.bin' '-w' '/tmp/graph4397639808187213938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4397639808187213938.bin' '-l' '-1' '-v' '-w' '/tmp/graph4397639808187213938.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:23:17] [INFO ] Decomposing Gal with order
[2022-05-19 00:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:23:17] [INFO ] Removed a total of 102 redundant transitions.
[2022-05-19 00:23:17] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 2 ms.
[2022-05-19 00:23:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7677214169697144617.gal : 2 ms
[2022-05-19 00:23:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6840202753823325693.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13775593333623673846;'/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/ReachabilityCardinality7677214169697144617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6840202753823325693.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/ReachabilityCardinality6840202753823325693.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 :356 after 1532
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1532 after 1.00742e+10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.00742e+10 after 1.05089e+13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.05089e+13 after 1.23957e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11158440267482302315
[2022-05-19 00:23:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11158440267482302315
Running compilation step : cd /tmp/ltsmin11158440267482302315;'/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 235 ms.
Running link step : cd /tmp/ltsmin11158440267482302315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11158440267482302315;'/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' 'apf4==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) p1) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p3) p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p1 (NOT p2))), (F p0), (F (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))), (F (AND p1 (NOT p3) (NOT p0))), (F (AND p1 p2 p0)), (F (AND (NOT p3) p0))]
Knowledge based reduction with 7 factoid took 505 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 5 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 224 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 210 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 201 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 5407 reset in 190 ms.
Product exploration explored 100000 steps with 5369 reset in 213 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2022-05-19 00:23:49] [INFO ] Redundant transitions in 20 ms returned [124]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 124 rows 129 cols
[2022-05-19 00:23:49] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:23:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/129 places, 124/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 129/129 places, 124/125 transitions.
Product exploration explored 100000 steps with 5541 reset in 276 ms.
Product exploration explored 100000 steps with 5378 reset in 300 ms.
Built C files in :
/tmp/ltsmin11756945245823468187
[2022-05-19 00:23:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11756945245823468187
Running compilation step : cd /tmp/ltsmin11756945245823468187;'/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 212 ms.
Running link step : cd /tmp/ltsmin11756945245823468187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11756945245823468187;'/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/stateBased17536686116688676848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:24:04] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:24:04] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:24:04] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-19 00:24:05] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 129 cols
[2022-05-19 00:24:05] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-19 00:24:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin15168691707606407463
[2022-05-19 00:24:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15168691707606407463
Running compilation step : cd /tmp/ltsmin15168691707606407463;'/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 214 ms.
Running link step : cd /tmp/ltsmin15168691707606407463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15168691707606407463;'/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/stateBased17504318149657850324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 00:24:20] [INFO ] Flatten gal took : 5 ms
[2022-05-19 00:24:20] [INFO ] Flatten gal took : 4 ms
[2022-05-19 00:24:20] [INFO ] Time to serialize gal into /tmp/LTL6138923863546787917.gal : 1 ms
[2022-05-19 00:24:20] [INFO ] Time to serialize properties into /tmp/LTL16604039506517241305.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/LTL6138923863546787917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16604039506517241305.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/LTL6138923...267
Read 1 LTL properties
Checking formula 0 : !((G(((!(("((p140==1)&&(p156==1))")U(G("(p183==1)"))))||(X(G("(p189==0)"))))||("((p95==1)&&(p189==1))"))))
Formula 0 simplified : !G("((p95==1)&&(p189==1))" | !("((p140==1)&&(p156==1))" U G"(p183==1)") | XG"(p189==0)")
Detected timeout of ITS tools.
[2022-05-19 00:24:35] [INFO ] Flatten gal took : 10 ms
[2022-05-19 00:24:35] [INFO ] Applying decomposition
[2022-05-19 00:24:35] [INFO ] Flatten gal took : 5 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/graph14976033529647328148.txt' '-o' '/tmp/graph14976033529647328148.bin' '-w' '/tmp/graph14976033529647328148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14976033529647328148.bin' '-l' '-1' '-v' '-w' '/tmp/graph14976033529647328148.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:24:35] [INFO ] Decomposing Gal with order
[2022-05-19 00:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:24:35] [INFO ] Removed a total of 82 redundant transitions.
[2022-05-19 00:24:35] [INFO ] Flatten gal took : 9 ms
[2022-05-19 00:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 2 ms.
[2022-05-19 00:24:35] [INFO ] Time to serialize gal into /tmp/LTL17389136376205433598.gal : 1 ms
[2022-05-19 00:24:35] [INFO ] Time to serialize properties into /tmp/LTL11346656952703204466.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/LTL17389136376205433598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11346656952703204466.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/LTL1738913...247
Read 1 LTL properties
Checking formula 0 : !((G(((!(("((i2.i1.u20.p140==1)&&(i2.i3.u24.p156==1))")U(G("(i2.i3.u28.p183==1)"))))||(X(G("(i3.i0.u29.p189==0)"))))||("((i1.i2.u15.p9...187
Formula 0 simplified : !G("((i1.i2.u15.p95==1)&&(i3.i0.u29.p189==1))" | !("((i2.i1.u20.p140==1)&&(i2.i3.u24.p156==1))" U G"(i2.i3.u28.p183==1)") | XG"(i3.i...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15310468607470178842
[2022-05-19 00:24:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15310468607470178842
Running compilation step : cd /tmp/ltsmin15310468607470178842;'/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 218 ms.
Running link step : cd /tmp/ltsmin15310468607470178842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15310468607470178842;'/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) U []((LTLAPp1==true)))||X([]((LTLAPp2==true)))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-11 finished in 180938 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(!(!F(p0) U (G(p1)&&p2)))))))'
[2022-05-19 00:25:05] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11833518090967728831
[2022-05-19 00:25:05] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2022-05-19 00:25:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:25:05] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2022-05-19 00:25:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:25:05] [INFO ] Applying decomposition
[2022-05-19 00:25:05] [INFO ] Flatten gal took : 7 ms
[2022-05-19 00:25:05] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2022-05-19 00:25:05] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 00:25:05] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11833518090967728831
Running compilation step : cd /tmp/ltsmin11833518090967728831;'/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/graph464362317083814583.txt' '-o' '/tmp/graph464362317083814583.bin' '-w' '/tmp/graph464362317083814583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph464362317083814583.bin' '-l' '-1' '-v' '-w' '/tmp/graph464362317083814583.weights' '-q' '0' '-e' '0.001'
[2022-05-19 00:25:05] [INFO ] Decomposing Gal with order
[2022-05-19 00:25:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:25:05] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-19 00:25:05] [INFO ] Flatten gal took : 13 ms
[2022-05-19 00:25:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-19 00:25:05] [INFO ] Time to serialize gal into /tmp/LTLFireability9511334102820246364.gal : 1 ms
[2022-05-19 00:25:05] [INFO ] Time to serialize properties into /tmp/LTLFireability1681485329585544242.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/LTLFireability9511334102820246364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1681485329585544242.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...267
Read 4 LTL properties
Checking formula 0 : !(((F(X(F(X("(i3.u24.p70==1)")))))U(((!(F("(i1.u11.p27==1)")))&&(G("((i0.u10.p24==1)&&(i0.u19.p53==1))")))&&(!("(((i5.u49.p146==1)&&(i...195
Formula 0 simplified : !(FXFX"(i3.u24.p70==1)" U (!"(((i5.u49.p146==1)&&(i5.u52.p154==1))&&(i6.u60.p182==1))" & !F"(i1.u11.p27==1)" & G"((i0.u10.p24==1)&&(...173
Compilation finished in 462 ms.
Running link step : cd /tmp/ltsmin11833518090967728831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11833518090967728831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(<>(X((LTLAPp0==true))))) U (!<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&!(LTLAPp3==true)))' '--buchi-type=spotba'
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: (<>(X(<>(X((LTLAPp0==true))))) U (!<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&!(LTLAPp3==true)))
pins2lts-mc-linux64( 1/ 8), 0.003: "(<>(X(<>(X((LTLAPp0==true))))) U (!<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&!(LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: There are 281 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.029: State length is 273, there are 283 groups
pins2lts-mc-linux64( 0/ 8), 0.029: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.029: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.029: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.029: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.069: [Blue] ~100 levels ~960 states ~6144 transitions
pins2lts-mc-linux64( 1/ 8), 0.107: [Blue] ~179 levels ~1920 states ~11352 transitions
pins2lts-mc-linux64( 1/ 8), 0.135: [Blue] ~297 levels ~3840 states ~16016 transitions
pins2lts-mc-linux64( 3/ 8), 0.169: [Blue] ~252 levels ~7680 states ~26016 transitions
pins2lts-mc-linux64( 3/ 8), 0.241: [Blue] ~252 levels ~15360 states ~44888 transitions
pins2lts-mc-linux64( 3/ 8), 0.400: [Blue] ~252 levels ~30720 states ~80872 transitions
pins2lts-mc-linux64( 3/ 8), 0.677: [Blue] ~252 levels ~61440 states ~163848 transitions
pins2lts-mc-linux64( 3/ 8), 1.261: [Blue] ~252 levels ~122880 states ~348280 transitions
pins2lts-mc-linux64( 3/ 8), 2.276: [Blue] ~252 levels ~245760 states ~728280 transitions
pins2lts-mc-linux64( 3/ 8), 4.077: [Blue] ~252 levels ~491520 states ~1493032 transitions
pins2lts-mc-linux64( 3/ 8), 7.148: [Blue] ~254 levels ~983040 states ~3026032 transitions
pins2lts-mc-linux64( 2/ 8), 12.670: [Blue] ~252 levels ~1966080 states ~6362992 transitions
pins2lts-mc-linux64( 2/ 8), 23.927: [Blue] ~278 levels ~3932160 states ~12614752 transitions
pins2lts-mc-linux64( 2/ 8), 46.151: [Blue] ~297 levels ~7864320 states ~25893296 transitions
pins2lts-mc-linux64( 2/ 8), 91.442: [Blue] ~297 levels ~15728640 states ~55211960 transitions
pins2lts-mc-linux64( 2/ 8), 183.111: [Blue] ~297 levels ~31457280 states ~118432120 transitions
pins2lts-mc-linux64( 2/ 8), 367.933: [Blue] ~297 levels ~62914560 states ~251445664 transitions
pins2lts-mc-linux64( 4/ 8), 744.275: [Blue] ~310 levels ~125829120 states ~513467832 transitions
pins2lts-mc-linux64( 5/ 8), 815.210: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 815.248:
pins2lts-mc-linux64( 0/ 8), 815.248: Explored 134207838 states 558899093 transitions, fanout: 4.164
pins2lts-mc-linux64( 0/ 8), 815.248: Total exploration time 815.210 sec (815.160 sec minimum, 815.178 sec on average)
pins2lts-mc-linux64( 0/ 8), 815.248: States per second: 164630, Transitions per second: 685589
pins2lts-mc-linux64( 0/ 8), 815.248:
pins2lts-mc-linux64( 0/ 8), 815.248: State space has 134217143 states, 134205475 are accepting
pins2lts-mc-linux64( 0/ 8), 815.248: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 815.248: blue states: 134207838 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 815.248: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 815.248: all-red states: 134205475 (99.99%), bogus 384 (0.00%)
pins2lts-mc-linux64( 0/ 8), 815.248:
pins2lts-mc-linux64( 0/ 8), 815.248: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 815.248:
pins2lts-mc-linux64( 0/ 8), 815.248: Queue width: 8B, total height: 2357, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 815.248: Tree memory: 1025.8MB, 8.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 815.248: Tree fill ratio (roots/leafs): 99.0%/0.0%
pins2lts-mc-linux64( 0/ 8), 815.248: Stored 271 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 815.248: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 815.248: Est. total memory use: 1025.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11833518090967728831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(<>(X((LTLAPp0==true))))) U (!<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&!(LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11833518090967728831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(<>(X((LTLAPp0==true))))) U (!<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&!(LTLAPp3==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-19 00:49:17] [INFO ] Applying decomposition
[2022-05-19 00:49:17] [INFO ] Flatten gal took : 7 ms
[2022-05-19 00:49:17] [INFO ] Decomposing Gal with order
[2022-05-19 00:49:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:49:17] [INFO ] Removed a total of 80 redundant transitions.
[2022-05-19 00:49:17] [INFO ] Flatten gal took : 12 ms
[2022-05-19 00:49:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 3 ms.
[2022-05-19 00:49:18] [INFO ] Time to serialize gal into /tmp/LTLFireability12901614264605308632.gal : 3 ms
[2022-05-19 00:49:18] [INFO ] Time to serialize properties into /tmp/LTLFireability4934248474527837946.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/LTLFireability12901614264605308632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4934248474527837946.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 : !(((F(X(F(X("(i0.i0.i0.i1.i0.i0.u132.p70==1)")))))U(((!(F("(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u17.p27==1)")))&&(G("((i0.i0.i0.i0.i1.i0.i0....328
Formula 0 simplified : !(FXFX"(i0.i0.i0.i1.i0.i0.u132.p70==1)" U (!"(((i0.i0.i1.i0.i0.i0.i0.i0.u51.p146==1)&&(i0.i0.i1.i0.i0.i0.u53.p154==1))&&(i0.i0.i1.u5...306
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="ShieldIIPs-PT-005B"
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 ShieldIIPs-PT-005B, 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-165286024700076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-005B.tgz
mv ShieldIIPs-PT-005B 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 ;