About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.703 | 3600000.00 | 8614299.00 | 382503.20 | FFFFFFFF?F?TF??T | 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-165286025600699.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600699
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.9M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653037962745
Running Version 202205111006
[2022-05-20 09:12:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 09:12:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:12:44] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2022-05-20 09:12:44] [INFO ] Transformed 7803 places.
[2022-05-20 09:12:44] [INFO ] Transformed 7103 transitions.
[2022-05-20 09:12:44] [INFO ] Found NUPN structural information;
[2022-05-20 09:12:44] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 689 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1092 places :
Symmetric choice reduction at 0 with 1092 rule applications. Total rules 1092 place count 6711 transition count 6011
Iterating global reduction 0 with 1092 rules applied. Total rules applied 2184 place count 6711 transition count 6011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2185 place count 6710 transition count 6010
Iterating global reduction 0 with 1 rules applied. Total rules applied 2186 place count 6710 transition count 6010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2187 place count 6709 transition count 6009
Iterating global reduction 0 with 1 rules applied. Total rules applied 2188 place count 6709 transition count 6009
Applied a total of 2188 rules in 4613 ms. Remains 6709 /7803 variables (removed 1094) and now considering 6009/7103 (removed 1094) transitions.
// Phase 1: matrix 6009 rows 6709 cols
[2022-05-20 09:12:49] [INFO ] Computed 1101 place invariants in 63 ms
[2022-05-20 09:12:50] [INFO ] Implicit Places using invariants in 892 ms returned []
// Phase 1: matrix 6009 rows 6709 cols
[2022-05-20 09:12:50] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 09:12:52] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 3218 ms to find 0 implicit places.
// Phase 1: matrix 6009 rows 6709 cols
[2022-05-20 09:12:52] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 09:12:57] [INFO ] Dead Transitions using invariants and state equation in 4312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6709/7803 places, 6009/7103 transitions.
Finished structural reductions, in 1 iterations. Remains : 6709/7803 places, 6009/7103 transitions.
Support contains 44 out of 6709 places after structural reductions.
[2022-05-20 09:12:57] [INFO ] Flatten gal took : 337 ms
[2022-05-20 09:12:57] [INFO ] Flatten gal took : 208 ms
[2022-05-20 09:12:58] [INFO ] Input system was already deterministic with 6009 transitions.
Support contains 41 out of 6709 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 6009 rows 6709 cols
[2022-05-20 09:12:59] [INFO ] Computed 1101 place invariants in 42 ms
[2022-05-20 09:13:01] [INFO ] After 1765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-20 09:13:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 696 ms returned sat
[2022-05-20 09:13:12] [INFO ] After 7464ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-05-20 09:13:14] [INFO ] Deduced a trap composed of 21 places in 2390 ms of which 10 ms to minimize.
[2022-05-20 09:13:17] [INFO ] Deduced a trap composed of 27 places in 2325 ms of which 12 ms to minimize.
[2022-05-20 09:13:19] [INFO ] Deduced a trap composed of 17 places in 2309 ms of which 6 ms to minimize.
[2022-05-20 09:13:22] [INFO ] Deduced a trap composed of 24 places in 2362 ms of which 4 ms to minimize.
[2022-05-20 09:13:24] [INFO ] Deduced a trap composed of 26 places in 2246 ms of which 3 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 26 places in 2251 ms of which 4 ms to minimize.
[2022-05-20 09:13:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:13:27] [INFO ] After 26020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 3133 ms.
Support contains 23 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Drop transitions removed 1382 transitions
Trivial Post-agglo rules discarded 1382 transitions
Performed 1382 trivial Post agglomeration. Transition count delta: 1382
Iterating post reduction 0 with 1382 rules applied. Total rules applied 1382 place count 6709 transition count 4627
Reduce places removed 1382 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 1389 rules applied. Total rules applied 2771 place count 5327 transition count 4620
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 2778 place count 5320 transition count 4620
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2778 place count 5320 transition count 3825
Deduced a syphon composed of 795 places in 12 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 4368 place count 4525 transition count 3825
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4372 place count 4521 transition count 3821
Iterating global reduction 3 with 4 rules applied. Total rules applied 4376 place count 4521 transition count 3821
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4376 place count 4521 transition count 3817
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4384 place count 4517 transition count 3817
Performed 1690 Post agglomeration using F-continuation condition.Transition count delta: 1690
Deduced a syphon composed of 1690 places in 5 ms
Reduce places removed 1690 places and 0 transitions.
Iterating global reduction 3 with 3380 rules applied. Total rules applied 7764 place count 2827 transition count 2127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7765 place count 2827 transition count 2126
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7767 place count 2826 transition count 2125
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7969 place count 2725 transition count 2125
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8171 place count 2624 transition count 2125
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 6 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 8359 place count 2530 transition count 2125
Partial Free-agglomeration rule applied 293 times.
Drop transitions removed 293 transitions
Iterating global reduction 4 with 293 rules applied. Total rules applied 8652 place count 2530 transition count 2125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8653 place count 2529 transition count 2124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8654 place count 2528 transition count 2124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8654 place count 2528 transition count 2122
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8658 place count 2526 transition count 2122
Applied a total of 8658 rules in 2390 ms. Remains 2526 /6709 variables (removed 4183) and now considering 2122/6009 (removed 3887) transitions.
Finished structural reductions, in 1 iterations. Remains : 2526/6709 places, 2122/6009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 112320 steps, run timeout after 6001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 112320 steps, saw 94259 distinct states, run finished after 6002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2122 rows 2526 cols
[2022-05-20 09:13:40] [INFO ] Computed 1100 place invariants in 10 ms
[2022-05-20 09:13:41] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 09:13:42] [INFO ] [Nat]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 09:13:44] [INFO ] After 2020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 09:13:44] [INFO ] State equation strengthened by 624 read => feed constraints.
[2022-05-20 09:13:49] [INFO ] After 4181ms SMT Verify possible using 624 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2022-05-20 09:13:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2022-05-20 09:13:50] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2022-05-20 09:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:13:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2022-05-20 09:13:53] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 778 ms
[2022-05-20 09:13:55] [INFO ] After 10201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1909 ms.
[2022-05-20 09:13:56] [INFO ] After 15393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 2172 ms.
Support contains 23 out of 2526 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2526/2526 places, 2122/2122 transitions.
Applied a total of 0 rules in 103 ms. Remains 2526 /2526 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2526/2526 places, 2122/2122 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2526/2526 places, 2122/2122 transitions.
Applied a total of 0 rules in 87 ms. Remains 2526 /2526 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
// Phase 1: matrix 2122 rows 2526 cols
[2022-05-20 09:13:59] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 09:14:00] [INFO ] Implicit Places using invariants in 1550 ms returned [2509, 2513]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1556 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2524/2526 places, 2122/2122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2522 transition count 2120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2522 transition count 2120
Applied a total of 4 rules in 172 ms. Remains 2522 /2524 variables (removed 2) and now considering 2120/2122 (removed 2) transitions.
// Phase 1: matrix 2120 rows 2522 cols
[2022-05-20 09:14:01] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:14:02] [INFO ] Implicit Places using invariants in 1676 ms returned []
// Phase 1: matrix 2120 rows 2522 cols
[2022-05-20 09:14:02] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:14:04] [INFO ] State equation strengthened by 622 read => feed constraints.
[2022-05-20 09:14:20] [INFO ] Implicit Places using invariants and state equation in 18076 ms returned []
Implicit Place search using SMT with State Equation took 19756 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2522/2526 places, 2120/2122 transitions.
Finished structural reductions, in 2 iterations. Remains : 2522/2526 places, 2120/2122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2120 rows 2522 cols
[2022-05-20 09:14:22] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:14:23] [INFO ] After 611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 09:14:23] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:14:26] [INFO ] After 2077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-20 09:14:26] [INFO ] State equation strengthened by 622 read => feed constraints.
[2022-05-20 09:14:33] [INFO ] After 6813ms SMT Verify possible using 622 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-20 09:14:33] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2022-05-20 09:14:34] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-20 09:14:34] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2022-05-20 09:14:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2022-05-20 09:14:36] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-20 09:14:36] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-05-20 09:14:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2022-05-20 09:14:37] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-20 09:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2022-05-20 09:14:38] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 09:14:38] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2022-05-20 09:14:39] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2022-05-20 09:14:39] [INFO ] Deduced a trap composed of 140 places in 122 ms of which 0 ms to minimize.
[2022-05-20 09:14:39] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-05-20 09:14:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1267 ms
[2022-05-20 09:14:39] [INFO ] After 13371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 8382 ms.
[2022-05-20 09:14:48] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 1786 ms.
Support contains 19 out of 2522 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2522/2522 places, 2120/2120 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2522 transition count 2118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2520 transition count 2118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 2520 transition count 2117
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2519 transition count 2117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 2517 transition count 2115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 2516 transition count 2115
Applied a total of 12 rules in 260 ms. Remains 2516 /2522 variables (removed 6) and now considering 2115/2120 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 2516/2522 places, 2115/2120 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 1603 stabilizing places and 1603 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U !(G(p2)&&p3))))'
Support contains 7 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6708 transition count 4610
Reduce places removed 1398 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2799 place count 5310 transition count 4607
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2802 place count 5307 transition count 4607
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2802 place count 5307 transition count 3810
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4396 place count 4510 transition count 3810
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 4403 place count 4503 transition count 3803
Iterating global reduction 3 with 7 rules applied. Total rules applied 4410 place count 4503 transition count 3803
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4410 place count 4503 transition count 3799
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4418 place count 4499 transition count 3799
Performed 1689 Post agglomeration using F-continuation condition.Transition count delta: 1689
Deduced a syphon composed of 1689 places in 4 ms
Reduce places removed 1689 places and 0 transitions.
Iterating global reduction 3 with 3378 rules applied. Total rules applied 7796 place count 2810 transition count 2110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2810 transition count 2109
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2809 transition count 2108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2708 transition count 2108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2607 transition count 2108
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2510 transition count 2108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8399 place count 2508 transition count 2106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8400 place count 2507 transition count 2106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8400 place count 2507 transition count 2104
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8404 place count 2505 transition count 2104
Applied a total of 8404 rules in 1850 ms. Remains 2505 /6709 variables (removed 4204) and now considering 2104/6009 (removed 3905) transitions.
// Phase 1: matrix 2104 rows 2505 cols
[2022-05-20 09:14:52] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:14:53] [INFO ] Implicit Places using invariants in 1452 ms returned [2488, 2492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1455 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/6709 places, 2104/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2102
Applied a total of 4 rules in 149 ms. Remains 2501 /2503 variables (removed 2) and now considering 2102/2104 (removed 2) transitions.
// Phase 1: matrix 2102 rows 2501 cols
[2022-05-20 09:14:54] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:14:55] [INFO ] Implicit Places using invariants in 1554 ms returned []
// Phase 1: matrix 2102 rows 2501 cols
[2022-05-20 09:14:55] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:14:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:14:59] [INFO ] Implicit Places using invariants and state equation in 3367 ms returned []
Implicit Place search using SMT with State Equation took 4923 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2501/6709 places, 2102/6009 transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/6709 places, 2102/6009 transitions.
Stuttering acceptance computed with spot in 365 ms :[(AND p2 p3), p2, (AND p2 (NOT p0)), (AND p2 p3)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p3 p2 p1 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s2028 0) (EQ s877 1)), p2:(OR (EQ s180 0) (EQ s594 1)), p0:(EQ s2330 1), p1:(AND (EQ s2330 1) (OR (EQ s931 0) (EQ s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1490 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-00 finished in 10356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X((p0 U p1)))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 1840 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:15:02] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 09:15:05] [INFO ] Implicit Places using invariants in 2401 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:15:05] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:15:07] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 4482 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:15:07] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:15:11] [INFO ] Dead Transitions using invariants and state equation in 4191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s455 1), p1:(NEQ s3210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33351 reset in 2639 ms.
Product exploration explored 100000 steps with 33315 reset in 2622 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:15:17] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:15:18] [INFO ] [Real]Absence check using 1101 positive place invariants in 679 ms returned sat
[2022-05-20 09:15:23] [INFO ] After 4724ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 09:15:26] [INFO ] Deduced a trap composed of 19 places in 2176 ms of which 4 ms to minimize.
[2022-05-20 09:15:28] [INFO ] Deduced a trap composed of 24 places in 2188 ms of which 4 ms to minimize.
[2022-05-20 09:15:30] [INFO ] Deduced a trap composed of 22 places in 2178 ms of which 3 ms to minimize.
[2022-05-20 09:15:33] [INFO ] Deduced a trap composed of 21 places in 2076 ms of which 3 ms to minimize.
[2022-05-20 09:15:35] [INFO ] Deduced a trap composed of 20 places in 2278 ms of which 4 ms to minimize.
[2022-05-20 09:15:38] [INFO ] Deduced a trap composed of 18 places in 2238 ms of which 3 ms to minimize.
[2022-05-20 09:15:40] [INFO ] Deduced a trap composed of 21 places in 2216 ms of which 4 ms to minimize.
[2022-05-20 09:15:42] [INFO ] Deduced a trap composed of 31 places in 2123 ms of which 4 ms to minimize.
[2022-05-20 09:15:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:15:42] [INFO ] After 25272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 4602
Reduce places removed 1399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2799 place count 5302 transition count 4601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7796 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2600 transition count 2101
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2503 transition count 2101
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 4 with 298 rules applied. Total rules applied 8695 place count 2503 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8696 place count 2502 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8697 place count 2501 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8697 place count 2501 transition count 2098
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8701 place count 2499 transition count 2098
Applied a total of 8701 rules in 1596 ms. Remains 2499 /6701 variables (removed 4202) and now considering 2098/6001 (removed 3903) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/6701 places, 2098/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93945 steps, run timeout after 3125 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 93945 steps, saw 77642 distinct states, run finished after 3125 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2499 cols
[2022-05-20 09:15:47] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 09:15:48] [INFO ] [Real]Absence check using 1100 positive place invariants in 163 ms returned sat
[2022-05-20 09:15:49] [INFO ] After 1003ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 09:15:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:15:49] [INFO ] After 75ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:15:49] [INFO ] After 1526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:15:49] [INFO ] [Nat]Absence check using 1100 positive place invariants in 183 ms returned sat
[2022-05-20 09:15:50] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:15:51] [INFO ] After 72ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:15:51] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 09:15:51] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2022-05-20 09:15:51] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2022-05-20 09:15:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 719 ms
[2022-05-20 09:15:51] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-20 09:15:51] [INFO ] After 2372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2098/2098 transitions.
Applied a total of 0 rules in 96 ms. Remains 2499 /2499 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2098/2098 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2098/2098 transitions.
Applied a total of 0 rules in 79 ms. Remains 2499 /2499 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2499 cols
[2022-05-20 09:15:52] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:15:53] [INFO ] Implicit Places using invariants in 1573 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1575 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2497/2499 places, 2098/2098 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2096
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 149 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:15:53] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:15:55] [INFO ] Implicit Places using invariants in 1532 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:15:55] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:15:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:15:58] [INFO ] Implicit Places using invariants and state equation in 3348 ms returned []
Implicit Place search using SMT with State Equation took 4891 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2495/2499 places, 2096/2098 transitions.
Finished structural reductions, in 2 iterations. Remains : 2495/2499 places, 2096/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 90917 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90917 steps, saw 75426 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:16:01] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:16:02] [INFO ] [Real]Absence check using 1098 positive place invariants in 173 ms returned sat
[2022-05-20 09:16:03] [INFO ] After 968ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 09:16:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:16:03] [INFO ] After 76ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-20 09:16:03] [INFO ] After 205ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-20 09:16:03] [INFO ] After 1718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 75 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2495 places, 2096/2096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 85 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:16:03] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:16:05] [INFO ] Implicit Places using invariants in 1552 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:16:05] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:16:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:16:08] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 4880 ms to find 0 implicit places.
[2022-05-20 09:16:08] [INFO ] Redundant transitions in 169 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:16:08] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:16:10] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2495 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2495 transition count 2096
Applied a total of 596 rules in 180 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:16:10] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:16:10] [INFO ] [Real]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:16:11] [INFO ] After 1500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:16:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 184 ms returned sat
[2022-05-20 09:16:13] [INFO ] After 1113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:16:13] [INFO ] State equation strengthened by 593 read => feed constraints.
[2022-05-20 09:16:13] [INFO ] After 354ms SMT Verify possible using 593 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:16:14] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-20 09:16:14] [INFO ] After 2271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-02 finished in 73412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(p0)))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6708 transition count 4608
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3810
Deduced a syphon composed of 798 places in 11 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4396 place count 4510 transition count 3810
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 4403 place count 4503 transition count 3803
Iterating global reduction 2 with 7 rules applied. Total rules applied 4410 place count 4503 transition count 3803
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4410 place count 4503 transition count 3799
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4418 place count 4499 transition count 3799
Performed 1694 Post agglomeration using F-continuation condition.Transition count delta: 1694
Deduced a syphon composed of 1694 places in 4 ms
Reduce places removed 1694 places and 0 transitions.
Iterating global reduction 2 with 3388 rules applied. Total rules applied 7806 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7807 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7809 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8011 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8213 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8407 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8409 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8410 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8410 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8414 place count 2500 transition count 2099
Applied a total of 8414 rules in 1777 ms. Remains 2500 /6709 variables (removed 4209) and now considering 2099/6009 (removed 3910) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2022-05-20 09:16:16] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 09:16:17] [INFO ] Implicit Places using invariants in 1458 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1461 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6709 places, 2099/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 143 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:16:17] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:16:19] [INFO ] Implicit Places using invariants in 1548 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:16:19] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:16:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:16:22] [INFO ] Implicit Places using invariants and state equation in 3349 ms returned []
Implicit Place search using SMT with State Equation took 4898 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6709 places, 2097/6009 transitions.
Finished structural reductions, in 2 iterations. Remains : 2496/6709 places, 2097/6009 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s601 0) (EQ s1362 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]]
Product exploration explored 100000 steps with 5 reset in 1315 ms.
Product exploration explored 100000 steps with 6 reset in 1726 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 78 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:16:26] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:16:27] [INFO ] Implicit Places using invariants in 1582 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:16:27] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:16:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:16:31] [INFO ] Implicit Places using invariants and state equation in 3367 ms returned []
Implicit Place search using SMT with State Equation took 4950 ms to find 0 implicit places.
[2022-05-20 09:16:31] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 2097 rows 2496 cols
[2022-05-20 09:16:31] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:16:32] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1332 ms.
Stack based approach found an accepted trace after 81 steps with 4 reset with depth 18 and stack size 18 in 2 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-03 finished in 20176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(p0))))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6708 transition count 4608
Reduce places removed 1400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2801 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2802 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2802 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 11 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4398 place count 4509 transition count 3809
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 4406 place count 4501 transition count 3801
Iterating global reduction 3 with 8 rules applied. Total rules applied 4414 place count 4501 transition count 3801
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4414 place count 4501 transition count 3796
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4424 place count 4496 transition count 3796
Performed 1691 Post agglomeration using F-continuation condition.Transition count delta: 1691
Deduced a syphon composed of 1691 places in 4 ms
Reduce places removed 1691 places and 0 transitions.
Iterating global reduction 3 with 3382 rules applied. Total rules applied 7806 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7807 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7809 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8011 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8213 place count 2602 transition count 2103
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8405 place count 2506 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8407 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8408 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8408 place count 2503 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Applied a total of 8412 rules in 1812 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2099/6009 (removed 3910) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2022-05-20 09:16:36] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 09:16:37] [INFO ] Implicit Places using invariants in 1457 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1458 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2099/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2097
Applied a total of 4 rules in 164 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:16:37] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:16:39] [INFO ] Implicit Places using invariants in 1555 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:16:39] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:16:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 09:16:42] [INFO ] Implicit Places using invariants and state equation in 3425 ms returned []
Implicit Place search using SMT with State Equation took 4982 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6709 places, 2097/6009 transitions.
Finished structural reductions, in 2 iterations. Remains : 2497/6709 places, 2097/6009 transitions.
Stuttering acceptance computed with spot in 520 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s126 0) (EQ s1553 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 0 reset in 1320 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-04 finished in 10281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U G(p0))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 1829 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:16:46] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:16:48] [INFO ] Implicit Places using invariants in 2191 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:16:48] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 09:16:51] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 4355 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:16:51] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:16:55] [INFO ] Dead Transitions using invariants and state equation in 4188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2892 0) (EQ s1987 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 0 reset in 1374 ms.
Stack based approach found an accepted trace after 3870 steps with 0 reset with depth 3871 and stack size 3871 in 54 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-05 finished in 11980 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 1819 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:16:58] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 09:17:00] [INFO ] Implicit Places using invariants in 2270 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:17:00] [INFO ] Computed 1101 place invariants in 25 ms
[2022-05-20 09:17:03] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 4589 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:17:03] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:17:07] [INFO ] Dead Transitions using invariants and state equation in 4214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s3606 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-07 finished in 10808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(G(p1)))))'
Support contains 4 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6703 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6703 transition count 6003
Applied a total of 12 rules in 1821 ms. Remains 6703 /6709 variables (removed 6) and now considering 6003/6009 (removed 6) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:17:09] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:17:11] [INFO ] Implicit Places using invariants in 2195 ms returned []
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:17:11] [INFO ] Computed 1101 place invariants in 19 ms
[2022-05-20 09:17:12] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 2854 ms to find 0 implicit places.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:17:12] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:17:16] [INFO ] Dead Transitions using invariants and state equation in 4126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6709 places, 6003/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6703/6709 places, 6003/6009 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s816 0) (EQ s3320 1)), p0:(OR (EQ s1480 0) (EQ s1293 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1375 ms.
Product exploration explored 100000 steps with 0 reset in 1788 ms.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Computed a total of 1600 stabilizing places and 1600 stable transitions
Detected a total of 1600/6703 stabilizing places and 1600/6003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 1817 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215792 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215792 steps, saw 208658 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:17:25] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:17:25] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:17:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 677 ms returned sat
[2022-05-20 09:17:32] [INFO ] After 5076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:17:35] [INFO ] Deduced a trap composed of 24 places in 2685 ms of which 5 ms to minimize.
[2022-05-20 09:17:38] [INFO ] Deduced a trap composed of 16 places in 2705 ms of which 3 ms to minimize.
[2022-05-20 09:17:41] [INFO ] Deduced a trap composed of 17 places in 2703 ms of which 4 ms to minimize.
[2022-05-20 09:17:43] [INFO ] Deduced a trap composed of 20 places in 2709 ms of which 3 ms to minimize.
[2022-05-20 09:17:46] [INFO ] Deduced a trap composed of 21 places in 2716 ms of which 4 ms to minimize.
[2022-05-20 09:17:49] [INFO ] Deduced a trap composed of 20 places in 2605 ms of which 4 ms to minimize.
[2022-05-20 09:17:52] [INFO ] Deduced a trap composed of 23 places in 2704 ms of which 4 ms to minimize.
[2022-05-20 09:17:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:17:52] [INFO ] After 26754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 122 ms.
Support contains 2 out of 6703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6703 transition count 4604
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5304 transition count 4604
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2798 place count 5304 transition count 3805
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4396 place count 4505 transition count 3805
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4397 place count 4504 transition count 3804
Iterating global reduction 2 with 1 rules applied. Total rules applied 4398 place count 4504 transition count 3804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4398 place count 4504 transition count 3803
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4400 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7798 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8397 place count 2505 transition count 2102
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8696 place count 2505 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8697 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8698 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8698 place count 2503 transition count 2099
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8702 place count 2501 transition count 2099
Applied a total of 8702 rules in 2034 ms. Remains 2501 /6703 variables (removed 4202) and now considering 2099/6003 (removed 3904) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/6703 places, 2099/6003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76659 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76659 steps, saw 56165 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2099 rows 2501 cols
[2022-05-20 09:17:58] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:17:58] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:17:58] [INFO ] [Nat]Absence check using 1100 positive place invariants in 190 ms returned sat
[2022-05-20 09:17:59] [INFO ] After 1026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:17:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 09:17:59] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:00] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-20 09:18:00] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2099/2099 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2099/2099 transitions.
Applied a total of 0 rules in 82 ms. Remains 2501 /2501 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2022-05-20 09:18:00] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:18:01] [INFO ] Implicit Places using invariants in 1574 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1576 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2499/2501 places, 2099/2099 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2497 transition count 2097
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2497 transition count 2097
Applied a total of 4 rules in 142 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:02] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:18:03] [INFO ] Implicit Places using invariants in 1598 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:03] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:18:06] [INFO ] Implicit Places using invariants and state equation in 3253 ms returned []
Implicit Place search using SMT with State Equation took 4863 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2497/2501 places, 2097/2099 transitions.
Finished structural reductions, in 2 iterations. Remains : 2497/2501 places, 2097/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77672 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77672 steps, saw 56916 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:10] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:18:10] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:18:10] [INFO ] [Nat]Absence check using 1098 positive place invariants in 199 ms returned sat
[2022-05-20 09:18:11] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:18:11] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:12] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 4 ms to minimize.
[2022-05-20 09:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2022-05-20 09:18:12] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-20 09:18:12] [INFO ] After 1969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 76 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:12] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:18:14] [INFO ] Implicit Places using invariants in 1602 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:14] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:18:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:18:17] [INFO ] Implicit Places using invariants and state equation in 3411 ms returned []
Implicit Place search using SMT with State Equation took 5014 ms to find 0 implicit places.
[2022-05-20 09:18:17] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:17] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:18:19] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2497 transition count 2097
Applied a total of 594 rules in 175 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:19] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:18:19] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:18:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:18:20] [INFO ] After 1008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:20] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:18:21] [INFO ] After 267ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:21] [INFO ] Deduced a trap composed of 5 places in 622 ms of which 1 ms to minimize.
[2022-05-20 09:18:22] [INFO ] Deduced a trap composed of 5 places in 596 ms of which 1 ms to minimize.
[2022-05-20 09:18:23] [INFO ] Deduced a trap composed of 5 places in 604 ms of which 1 ms to minimize.
[2022-05-20 09:18:24] [INFO ] Deduced a trap composed of 7 places in 653 ms of which 2 ms to minimize.
[2022-05-20 09:18:24] [INFO ] Deduced a trap composed of 5 places in 653 ms of which 1 ms to minimize.
[2022-05-20 09:18:25] [INFO ] Deduced a trap composed of 7 places in 596 ms of which 1 ms to minimize.
[2022-05-20 09:18:26] [INFO ] Deduced a trap composed of 6 places in 597 ms of which 2 ms to minimize.
[2022-05-20 09:18:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5199 ms
[2022-05-20 09:18:26] [INFO ] After 5554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-05-20 09:18:26] [INFO ] After 7137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Support contains 2 out of 6703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6702 transition count 4606
Reduce places removed 1396 places and 0 transitions.
Iterating post reduction 1 with 1396 rules applied. Total rules applied 2792 place count 5306 transition count 4606
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2792 place count 5306 transition count 3805
Deduced a syphon composed of 801 places in 12 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 4394 place count 4505 transition count 3805
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7786 place count 2809 transition count 2109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7787 place count 2809 transition count 2108
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7789 place count 2808 transition count 2107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7991 place count 2707 transition count 2107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8193 place count 2606 transition count 2107
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8385 place count 2510 transition count 2107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8387 place count 2508 transition count 2105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8388 place count 2507 transition count 2105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8388 place count 2507 transition count 2103
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8392 place count 2505 transition count 2103
Applied a total of 8392 rules in 1443 ms. Remains 2505 /6703 variables (removed 4198) and now considering 2103/6003 (removed 3900) transitions.
// Phase 1: matrix 2103 rows 2505 cols
[2022-05-20 09:18:28] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 09:18:30] [INFO ] Implicit Places using invariants in 1582 ms returned [2488, 2492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1584 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/6703 places, 2103/6003 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2101
Applied a total of 4 rules in 151 ms. Remains 2501 /2503 variables (removed 2) and now considering 2101/2103 (removed 2) transitions.
// Phase 1: matrix 2101 rows 2501 cols
[2022-05-20 09:18:30] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:18:31] [INFO ] Implicit Places using invariants in 1569 ms returned []
// Phase 1: matrix 2101 rows 2501 cols
[2022-05-20 09:18:31] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:18:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 09:18:35] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2501/6703 places, 2101/6003 transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/6703 places, 2101/6003 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99206 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99206 steps, saw 69546 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2101 rows 2501 cols
[2022-05-20 09:18:38] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:18:38] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:18:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 185 ms returned sat
[2022-05-20 09:18:40] [INFO ] After 988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 09:18:40] [INFO ] After 74ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:40] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-20 09:18:40] [INFO ] After 1723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2101/2101 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 2501 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2500 transition count 2100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2499 transition count 2099
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 2499 transition count 2099
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 2497 transition count 2097
Applied a total of 9 rules in 291 ms. Remains 2497 /2501 variables (removed 4) and now considering 2097/2101 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2501 places, 2097/2101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101000 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101000 steps, saw 71613 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:44] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:18:44] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:18:44] [INFO ] [Nat]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:18:45] [INFO ] After 982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:18:45] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:46] [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 76 ms.
[2022-05-20 09:18:46] [INFO ] After 1702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 74 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 75 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:46] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:18:47] [INFO ] Implicit Places using invariants in 1544 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:47] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:18:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:18:51] [INFO ] Implicit Places using invariants and state equation in 3404 ms returned []
Implicit Place search using SMT with State Equation took 4952 ms to find 0 implicit places.
[2022-05-20 09:18:51] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:51] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:18:52] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2497 transition count 2097
Applied a total of 594 rules in 173 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:18:52] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:18:52] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:18:53] [INFO ] [Nat]Absence check using 1098 positive place invariants in 193 ms returned sat
[2022-05-20 09:18:54] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 09:18:54] [INFO ] After 76ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:18:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-20 09:18:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-20 09:18:54] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-20 09:18:54] [INFO ] After 1865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1374 ms.
Product exploration explored 100000 steps with 0 reset in 1761 ms.
Built C files in :
/tmp/ltsmin2577100008128006610
[2022-05-20 09:18:58] [INFO ] Too many transitions (2101) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:18:58] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2577100008128006610
Running compilation step : cd /tmp/ltsmin2577100008128006610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2577100008128006610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2577100008128006610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2497 transition count 2097
Applied a total of 2 rules in 162 ms. Remains 2497 /2501 variables (removed 4) and now considering 2097/2101 (removed 4) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:19:01] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:19:03] [INFO ] Implicit Places using invariants in 1514 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:19:03] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:19:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:19:06] [INFO ] Implicit Places using invariants and state equation in 3232 ms returned []
Implicit Place search using SMT with State Equation took 4750 ms to find 0 implicit places.
[2022-05-20 09:19:06] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 2097 rows 2497 cols
[2022-05-20 09:19:06] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:19:07] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/2501 places, 2097/2101 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2501 places, 2097/2101 transitions.
Built C files in :
/tmp/ltsmin9855346386467690421
[2022-05-20 09:19:07] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:19:07] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9855346386467690421
Running compilation step : cd /tmp/ltsmin9855346386467690421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9855346386467690421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9855346386467690421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:19:11] [INFO ] Flatten gal took : 68 ms
[2022-05-20 09:19:11] [INFO ] Flatten gal took : 69 ms
[2022-05-20 09:19:11] [INFO ] Time to serialize gal into /tmp/LTL3290305190121638089.gal : 14 ms
[2022-05-20 09:19:11] [INFO ] Time to serialize properties into /tmp/LTL18221976056941947965.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/LTL3290305190121638089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18221976056941947965.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/LTL3290305...267
Read 1 LTL properties
Checking formula 0 : !((X((("((p1707==0)||(p1491==1))")U("((p932==0)||(p3851==1))"))&&(F(G("((p932==0)||(p3851==1))"))))))
Formula 0 simplified : !X(("((p1707==0)||(p1491==1))" U "((p932==0)||(p3851==1))") & FG"((p932==0)||(p3851==1))")
Detected timeout of ITS tools.
[2022-05-20 09:19:26] [INFO ] Flatten gal took : 65 ms
[2022-05-20 09:19:26] [INFO ] Applying decomposition
[2022-05-20 09:19:26] [INFO ] Flatten gal took : 63 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/graph12460532575405733306.txt' '-o' '/tmp/graph12460532575405733306.bin' '-w' '/tmp/graph12460532575405733306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12460532575405733306.bin' '-l' '-1' '-v' '-w' '/tmp/graph12460532575405733306.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:19:26] [INFO ] Decomposing Gal with order
[2022-05-20 09:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:19:27] [INFO ] Removed a total of 609 redundant transitions.
[2022-05-20 09:19:27] [INFO ] Flatten gal took : 185 ms
[2022-05-20 09:19:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 29 ms.
[2022-05-20 09:19:27] [INFO ] Time to serialize gal into /tmp/LTL9824434562836614364.gal : 25 ms
[2022-05-20 09:19:27] [INFO ] Time to serialize properties into /tmp/LTL15776484037993753153.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/LTL9824434562836614364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15776484037993753153.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/LTL9824434...246
Read 1 LTL properties
Checking formula 0 : !((X((("((i8.i1.i2.u172.p1707==0)||(i7.i1.i2.u148.p1491==1))")U("((i4.i1.i2.u90.p932==0)||(i20.i1.i0.u397.p3851==1))"))&&(F(G("((i4.i1...206
Formula 0 simplified : !X(("((i8.i1.i2.u172.p1707==0)||(i7.i1.i2.u148.p1491==1))" U "((i4.i1.i2.u90.p932==0)||(i20.i1.i0.u397.p3851==1))") & FG"((i4.i1.i2....197
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1606, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t...1423
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15712999553927594739
[2022-05-20 09:19:42] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15712999553927594739
Running compilation step : cd /tmp/ltsmin15712999553927594739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15712999553927594739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15712999553927594739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-08 finished in 157741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 1940 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:19:47] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:19:49] [INFO ] Implicit Places using invariants in 2280 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:19:49] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 09:19:51] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 4521 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:19:51] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:19:56] [INFO ] Dead Transitions using invariants and state equation in 4211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s4322 0) (EQ s5445 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 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-09 finished in 10864 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((X((X(p0)||X(p1)))&&(X(p3)||p2))))))'
Support contains 6 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6703 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6703 transition count 6003
Applied a total of 12 rules in 1866 ms. Remains 6703 /6709 variables (removed 6) and now considering 6003/6009 (removed 6) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:19:58] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:20:00] [INFO ] Implicit Places using invariants in 2182 ms returned []
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:20:00] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 09:20:02] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 4393 ms to find 0 implicit places.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:20:02] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:20:06] [INFO ] Dead Transitions using invariants and state equation in 4453 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6709 places, 6003/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6703/6709 places, 6003/6009 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p2:(OR (EQ s6630 0) (EQ s1093 1)), p3:(OR (EQ s4744 0) (EQ s5979 1)), p0:(AND (EQ s1093 0) (EQ s6630 1)), p1:(OR (EQ s2657 0) (EQ s3183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16658 reset in 1463 ms.
Product exploration explored 100000 steps with 16719 reset in 1483 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Detected a total of 1599/6703 stabilizing places and 1599/6003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 523 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:20:11] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:20:12] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:20:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 727 ms returned sat
[2022-05-20 09:20:20] [INFO ] After 6271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:20:22] [INFO ] Deduced a trap composed of 33 places in 2579 ms of which 3 ms to minimize.
[2022-05-20 09:20:25] [INFO ] Deduced a trap composed of 18 places in 2516 ms of which 3 ms to minimize.
[2022-05-20 09:20:28] [INFO ] Deduced a trap composed of 20 places in 2415 ms of which 3 ms to minimize.
[2022-05-20 09:20:31] [INFO ] Deduced a trap composed of 18 places in 2564 ms of which 3 ms to minimize.
[2022-05-20 09:20:33] [INFO ] Deduced a trap composed of 16 places in 2513 ms of which 4 ms to minimize.
[2022-05-20 09:20:36] [INFO ] Deduced a trap composed of 19 places in 2400 ms of which 3 ms to minimize.
[2022-05-20 09:20:38] [INFO ] Deduced a trap composed of 24 places in 2368 ms of which 4 ms to minimize.
[2022-05-20 09:20:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:20:38] [INFO ] After 26726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 339 ms.
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6703 transition count 4607
Reduce places removed 1396 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2794 place count 5307 transition count 4605
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2796 place count 5305 transition count 4605
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2796 place count 5305 transition count 3808
Deduced a syphon composed of 797 places in 38 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4390 place count 4508 transition count 3808
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7784 place count 2811 transition count 2111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7785 place count 2811 transition count 2110
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7787 place count 2810 transition count 2109
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7989 place count 2709 transition count 2109
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8191 place count 2608 transition count 2109
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8385 place count 2511 transition count 2109
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 4 with 298 rules applied. Total rules applied 8683 place count 2511 transition count 2109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8684 place count 2510 transition count 2108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8685 place count 2509 transition count 2108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8685 place count 2509 transition count 2106
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8689 place count 2507 transition count 2106
Applied a total of 8689 rules in 1465 ms. Remains 2507 /6703 variables (removed 4196) and now considering 2106/6003 (removed 3897) transitions.
Finished structural reductions, in 1 iterations. Remains : 2507/6703 places, 2106/6003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68320 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68320 steps, saw 48330 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2106 rows 2507 cols
[2022-05-20 09:20:44] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 09:20:44] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:20:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 192 ms returned sat
[2022-05-20 09:20:46] [INFO ] After 1762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:20:46] [INFO ] State equation strengthened by 633 read => feed constraints.
[2022-05-20 09:20:48] [INFO ] After 1939ms SMT Verify possible using 633 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:20:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-20 09:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2022-05-20 09:20:50] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2022-05-20 09:20:50] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2022-05-20 09:20:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2022-05-20 09:20:50] [INFO ] After 3601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 583 ms.
[2022-05-20 09:20:50] [INFO ] After 6488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 231 ms.
Support contains 6 out of 2507 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2507/2507 places, 2106/2106 transitions.
Applied a total of 0 rules in 78 ms. Remains 2507 /2507 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2507/2507 places, 2106/2106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2507/2507 places, 2106/2106 transitions.
Applied a total of 0 rules in 78 ms. Remains 2507 /2507 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
// Phase 1: matrix 2106 rows 2507 cols
[2022-05-20 09:20:51] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:20:52] [INFO ] Implicit Places using invariants in 1600 ms returned [2490, 2494]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1606 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2505/2507 places, 2106/2106 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2503 transition count 2104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2503 transition count 2104
Applied a total of 4 rules in 158 ms. Remains 2503 /2505 variables (removed 2) and now considering 2104/2106 (removed 2) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:20:53] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:20:54] [INFO ] Implicit Places using invariants in 1514 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:20:54] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:20:55] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:21:12] [INFO ] Implicit Places using invariants and state equation in 17875 ms returned []
Implicit Place search using SMT with State Equation took 19391 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2503/2507 places, 2104/2106 transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/2507 places, 2104/2106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68702 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68702 steps, saw 48432 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:21:15] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:21:16] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:21:16] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:21:18] [INFO ] After 1420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:21:18] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:21:33] [INFO ] After 15077ms SMT Verify possible using 631 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:21:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
[2022-05-20 09:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2022-05-20 09:21:36] [INFO ] After 18549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-05-20 09:21:36] [INFO ] After 20653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 238 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:21:37] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:21:38] [INFO ] Implicit Places using invariants in 1596 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:21:38] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:21:40] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:21:55] [INFO ] Implicit Places using invariants and state equation in 16403 ms returned []
Implicit Place search using SMT with State Equation took 18001 ms to find 0 implicit places.
[2022-05-20 09:21:55] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:21:55] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:21:56] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Applied a total of 0 rules in 907 ms. Remains 6703 /6703 variables (removed 0) and now considering 6003/6003 (removed 0) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:21:58] [INFO ] Computed 1101 place invariants in 24 ms
[2022-05-20 09:22:00] [INFO ] Implicit Places using invariants in 2233 ms returned []
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:22:00] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:22:02] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 4466 ms to find 0 implicit places.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:22:02] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 09:22:06] [INFO ] Dead Transitions using invariants and state equation in 4270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6703/6703 places, 6003/6003 transitions.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Detected a total of 1599/6703 stabilizing places and 1599/6003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :1
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 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:22:07] [INFO ] Computed 1101 place invariants in 15 ms
[2022-05-20 09:22:08] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:22:10] [INFO ] [Nat]Absence check using 1101 positive place invariants in 699 ms returned sat
[2022-05-20 09:22:15] [INFO ] After 5587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:18] [INFO ] Deduced a trap composed of 33 places in 2560 ms of which 4 ms to minimize.
[2022-05-20 09:22:21] [INFO ] Deduced a trap composed of 18 places in 2525 ms of which 4 ms to minimize.
[2022-05-20 09:22:24] [INFO ] Deduced a trap composed of 20 places in 2547 ms of which 20 ms to minimize.
[2022-05-20 09:22:26] [INFO ] Deduced a trap composed of 18 places in 2434 ms of which 4 ms to minimize.
[2022-05-20 09:22:29] [INFO ] Deduced a trap composed of 16 places in 2496 ms of which 4 ms to minimize.
[2022-05-20 09:22:32] [INFO ] Deduced a trap composed of 19 places in 2517 ms of which 3 ms to minimize.
[2022-05-20 09:22:34] [INFO ] Deduced a trap composed of 24 places in 2471 ms of which 4 ms to minimize.
[2022-05-20 09:22:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:22:34] [INFO ] After 26121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 333 ms.
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6703 transition count 4607
Reduce places removed 1396 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2794 place count 5307 transition count 4605
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2796 place count 5305 transition count 4605
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2796 place count 5305 transition count 3808
Deduced a syphon composed of 797 places in 10 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4390 place count 4508 transition count 3808
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7784 place count 2811 transition count 2111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7785 place count 2811 transition count 2110
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7787 place count 2810 transition count 2109
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7989 place count 2709 transition count 2109
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8191 place count 2608 transition count 2109
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8385 place count 2511 transition count 2109
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 4 with 298 rules applied. Total rules applied 8683 place count 2511 transition count 2109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8684 place count 2510 transition count 2108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8685 place count 2509 transition count 2108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8685 place count 2509 transition count 2106
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8689 place count 2507 transition count 2106
Applied a total of 8689 rules in 1486 ms. Remains 2507 /6703 variables (removed 4196) and now considering 2106/6003 (removed 3897) transitions.
Finished structural reductions, in 1 iterations. Remains : 2507/6703 places, 2106/6003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69480 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69480 steps, saw 49189 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2106 rows 2507 cols
[2022-05-20 09:22:39] [INFO ] Computed 1100 place invariants in 10 ms
[2022-05-20 09:22:40] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:22:40] [INFO ] [Nat]Absence check using 1100 positive place invariants in 191 ms returned sat
[2022-05-20 09:22:42] [INFO ] After 1805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:42] [INFO ] State equation strengthened by 633 read => feed constraints.
[2022-05-20 09:22:44] [INFO ] After 2004ms SMT Verify possible using 633 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:22:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-20 09:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 533 ms
[2022-05-20 09:22:46] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2022-05-20 09:22:46] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2022-05-20 09:22:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2022-05-20 09:22:46] [INFO ] After 3671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 571 ms.
[2022-05-20 09:22:46] [INFO ] After 6611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 259 ms.
Support contains 6 out of 2507 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2507/2507 places, 2106/2106 transitions.
Applied a total of 0 rules in 77 ms. Remains 2507 /2507 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2507/2507 places, 2106/2106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2507/2507 places, 2106/2106 transitions.
Applied a total of 0 rules in 77 ms. Remains 2507 /2507 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
// Phase 1: matrix 2106 rows 2507 cols
[2022-05-20 09:22:47] [INFO ] Computed 1100 place invariants in 9 ms
[2022-05-20 09:22:48] [INFO ] Implicit Places using invariants in 1571 ms returned [2490, 2494]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1573 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2505/2507 places, 2106/2106 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2503 transition count 2104
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2503 transition count 2104
Applied a total of 4 rules in 152 ms. Remains 2503 /2505 variables (removed 2) and now considering 2104/2106 (removed 2) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:22:49] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:22:50] [INFO ] Implicit Places using invariants in 1548 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:22:50] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:22:51] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:23:09] [INFO ] Implicit Places using invariants and state equation in 19330 ms returned []
Implicit Place search using SMT with State Equation took 20880 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2503/2507 places, 2104/2106 transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/2507 places, 2104/2106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 65690 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65690 steps, saw 46356 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:23:13] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:23:13] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:23:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 190 ms returned sat
[2022-05-20 09:23:15] [INFO ] After 1417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:23:15] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:23:30] [INFO ] After 14818ms SMT Verify possible using 631 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:23:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-20 09:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2022-05-20 09:23:33] [INFO ] After 18145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2022-05-20 09:23:33] [INFO ] After 20239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 1 properties in 247 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 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 2503 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2502 transition count 2103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2102
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 2501 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 2500 transition count 2101
Applied a total of 6 rules in 316 ms. Remains 2500 /2503 variables (removed 3) and now considering 2101/2104 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2503 places, 2101/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77373 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77373 steps, saw 53607 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2101 rows 2500 cols
[2022-05-20 09:23:37] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:23:37] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:23:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 184 ms returned sat
[2022-05-20 09:23:39] [INFO ] After 1021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:23:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:23:39] [INFO ] After 72ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:23:39] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2022-05-20 09:23:40] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2022-05-20 09:23:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2022-05-20 09:23:40] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-20 09:23:40] [INFO ] After 2327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2101/2101 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2101/2101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2101/2101 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
// Phase 1: matrix 2101 rows 2500 cols
[2022-05-20 09:23:40] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:23:41] [INFO ] Implicit Places using invariants in 1578 ms returned []
// Phase 1: matrix 2101 rows 2500 cols
[2022-05-20 09:23:41] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:23:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:23:45] [INFO ] Implicit Places using invariants and state equation in 3507 ms returned []
Implicit Place search using SMT with State Equation took 5092 ms to find 0 implicit places.
[2022-05-20 09:23:45] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 2101 rows 2500 cols
[2022-05-20 09:23:45] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:23:46] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2101/2101 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2500 transition count 2101
Applied a total of 596 rules in 185 ms. Remains 2500 /2500 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2101 rows 2500 cols
[2022-05-20 09:23:46] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:23:47] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:23:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:23:48] [INFO ] After 1041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:23:48] [INFO ] State equation strengthened by 594 read => feed constraints.
[2022-05-20 09:23:48] [INFO ] After 272ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:23:49] [INFO ] Deduced a trap composed of 5 places in 616 ms of which 1 ms to minimize.
[2022-05-20 09:23:50] [INFO ] Deduced a trap composed of 5 places in 599 ms of which 2 ms to minimize.
[2022-05-20 09:23:51] [INFO ] Deduced a trap composed of 7 places in 579 ms of which 1 ms to minimize.
[2022-05-20 09:23:51] [INFO ] Deduced a trap composed of 5 places in 592 ms of which 2 ms to minimize.
[2022-05-20 09:23:52] [INFO ] Deduced a trap composed of 8 places in 580 ms of which 2 ms to minimize.
[2022-05-20 09:23:53] [INFO ] Deduced a trap composed of 7 places in 583 ms of which 2 ms to minimize.
[2022-05-20 09:23:53] [INFO ] Deduced a trap composed of 7 places in 593 ms of which 2 ms to minimize.
[2022-05-20 09:23:54] [INFO ] Deduced a trap composed of 5 places in 584 ms of which 1 ms to minimize.
[2022-05-20 09:23:55] [INFO ] Deduced a trap composed of 9 places in 586 ms of which 1 ms to minimize.
[2022-05-20 09:23:55] [INFO ] Deduced a trap composed of 9 places in 575 ms of which 2 ms to minimize.
[2022-05-20 09:23:56] [INFO ] Deduced a trap composed of 5 places in 565 ms of which 1 ms to minimize.
[2022-05-20 09:23:57] [INFO ] Deduced a trap composed of 5 places in 582 ms of which 1 ms to minimize.
[2022-05-20 09:23:57] [INFO ] Deduced a trap composed of 6 places in 555 ms of which 2 ms to minimize.
[2022-05-20 09:23:58] [INFO ] Deduced a trap composed of 5 places in 544 ms of which 2 ms to minimize.
[2022-05-20 09:23:59] [INFO ] Deduced a trap composed of 6 places in 560 ms of which 1 ms to minimize.
[2022-05-20 09:23:59] [INFO ] Deduced a trap composed of 7 places in 550 ms of which 1 ms to minimize.
[2022-05-20 09:24:00] [INFO ] Deduced a trap composed of 6 places in 543 ms of which 2 ms to minimize.
[2022-05-20 09:24:00] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 11573 ms
[2022-05-20 09:24:00] [INFO ] After 11944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-05-20 09:24:00] [INFO ] After 13589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 5 factoid took 789 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16609 reset in 1377 ms.
Product exploration explored 100000 steps with 16647 reset in 1382 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 538 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Performed 1398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6703 transition count 6003
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 497 Pre rules applied. Total rules applied 1398 place count 6703 transition count 6401
Deduced a syphon composed of 1895 places in 17 ms
Iterating global reduction 1 with 497 rules applied. Total rules applied 1895 place count 6703 transition count 6401
Performed 1899 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3794 places in 23 ms
Iterating global reduction 1 with 1899 rules applied. Total rules applied 3794 place count 6703 transition count 6402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3795 place count 6703 transition count 6401
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 2 with 702 rule applications. Total rules 4497 place count 6001 transition count 5698
Deduced a syphon composed of 3092 places in 22 ms
Iterating global reduction 2 with 702 rules applied. Total rules applied 5199 place count 6001 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3093 places in 19 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5200 place count 6001 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5202 place count 5999 transition count 5696
Deduced a syphon composed of 3091 places in 19 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5204 place count 5999 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 3192 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5305 place count 5999 transition count 6124
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5406 place count 5898 transition count 5922
Deduced a syphon composed of 3091 places in 27 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5507 place count 5898 transition count 5922
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -433
Deduced a syphon composed of 3192 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5608 place count 5898 transition count 6355
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5709 place count 5797 transition count 6153
Deduced a syphon composed of 3091 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5810 place count 5797 transition count 6153
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3192 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5911 place count 5797 transition count 6583
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6012 place count 5696 transition count 6381
Deduced a syphon composed of 3091 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6113 place count 5696 transition count 6381
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -398
Deduced a syphon composed of 3185 places in 12 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6207 place count 5696 transition count 6779
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 6301 place count 5602 transition count 6591
Deduced a syphon composed of 3091 places in 12 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6395 place count 5602 transition count 6591
Deduced a syphon composed of 3091 places in 11 ms
Applied a total of 6395 rules in 7814 ms. Remains 5602 /6703 variables (removed 1101) and now considering 6591/6003 (removed -588) transitions.
[2022-05-20 09:24:14] [INFO ] Redundant transitions in 292 ms returned []
// Phase 1: matrix 6591 rows 5602 cols
[2022-05-20 09:24:14] [INFO ] Computed 1101 place invariants in 96 ms
[2022-05-20 09:24:18] [INFO ] Dead Transitions using invariants and state equation in 3875 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5602/6703 places, 6591/6003 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/6703 places, 6591/6003 transitions.
Product exploration explored 100000 steps with 16678 reset in 6950 ms.
Product exploration explored 100000 steps with 16644 reset in 7072 ms.
Built C files in :
/tmp/ltsmin6510525467821411247
[2022-05-20 09:24:32] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6510525467821411247
Running compilation step : cd /tmp/ltsmin6510525467821411247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6510525467821411247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6510525467821411247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Applied a total of 0 rules in 925 ms. Remains 6703 /6703 variables (removed 0) and now considering 6003/6003 (removed 0) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:24:36] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 09:24:38] [INFO ] Implicit Places using invariants in 2195 ms returned []
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:24:38] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:24:40] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 4383 ms to find 0 implicit places.
// Phase 1: matrix 6003 rows 6703 cols
[2022-05-20 09:24:40] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:24:44] [INFO ] Dead Transitions using invariants and state equation in 4052 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6703/6703 places, 6003/6003 transitions.
Built C files in :
/tmp/ltsmin13449677392661117585
[2022-05-20 09:24:44] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13449677392661117585
Running compilation step : cd /tmp/ltsmin13449677392661117585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13449677392661117585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13449677392661117585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:24:48] [INFO ] Flatten gal took : 180 ms
[2022-05-20 09:24:48] [INFO ] Flatten gal took : 265 ms
[2022-05-20 09:24:48] [INFO ] Time to serialize gal into /tmp/LTL9163163344633788198.gal : 50 ms
[2022-05-20 09:24:48] [INFO ] Time to serialize properties into /tmp/LTL8163762653118993579.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/LTL9163163344633788198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8163762653118993579.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/LTL9163163...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X((X((X("((p1257==0)&&(p7714==1))"))||(X("((p3078==0)||(p3691==1))"))))&&(((X("((p5512==0)||(p6956==1))"))||("(p7714==0)"))||("...173
Formula 0 simplified : !GXX(X(X"((p1257==0)&&(p7714==1))" | X"((p3078==0)||(p3691==1))") & ("(p1257==1)" | "(p7714==0)" | X"((p5512==0)||(p6956==1))"))
Detected timeout of ITS tools.
[2022-05-20 09:25:03] [INFO ] Flatten gal took : 137 ms
[2022-05-20 09:25:03] [INFO ] Applying decomposition
[2022-05-20 09:25:03] [INFO ] Flatten gal took : 142 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/graph9706431199589806681.txt' '-o' '/tmp/graph9706431199589806681.bin' '-w' '/tmp/graph9706431199589806681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9706431199589806681.bin' '-l' '-1' '-v' '-w' '/tmp/graph9706431199589806681.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:25:04] [INFO ] Decomposing Gal with order
[2022-05-20 09:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:25:06] [INFO ] Removed a total of 995 redundant transitions.
[2022-05-20 09:25:06] [INFO ] Flatten gal took : 260 ms
[2022-05-20 09:25:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-20 09:25:06] [INFO ] Time to serialize gal into /tmp/LTL8148191466176541999.gal : 73 ms
[2022-05-20 09:25:06] [INFO ] Time to serialize properties into /tmp/LTL8091864076123982873.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/LTL8148191466176541999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8091864076123982873.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/LTL8148191...245
Read 1 LTL properties
Checking formula 0 : !((G(X(X((X((X("((i14.u400.p1257==0)&&(i73.u2371.p7714==1))"))||(X("((i33.u957.p3078==0)||(i39.u1147.p3691==1))"))))&&(((X("((i54.u170...249
Formula 0 simplified : !GXX(X(X"((i14.u400.p1257==0)&&(i73.u2371.p7714==1))" | X"((i33.u957.p3078==0)||(i39.u1147.p3691==1))") & ("(i14.u400.p1257==1)" | "...227
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12992777433921274519
[2022-05-20 09:25:21] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12992777433921274519
Running compilation step : cd /tmp/ltsmin12992777433921274519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12992777433921274519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12992777433921274519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-10 finished in 328277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(G((G(p0) U X(p1)))) U p2)))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6708 transition count 4611
Reduce places removed 1397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2796 place count 5311 transition count 4609
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2798 place count 5309 transition count 4609
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2798 place count 5309 transition count 3811
Deduced a syphon composed of 798 places in 11 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4394 place count 4511 transition count 3811
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 4401 place count 4504 transition count 3804
Iterating global reduction 3 with 7 rules applied. Total rules applied 4408 place count 4504 transition count 3804
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4408 place count 4504 transition count 3799
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4418 place count 4499 transition count 3799
Performed 1691 Post agglomeration using F-continuation condition.Transition count delta: 1691
Deduced a syphon composed of 1691 places in 5 ms
Reduce places removed 1691 places and 0 transitions.
Iterating global reduction 3 with 3382 rules applied. Total rules applied 7800 place count 2808 transition count 2108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7801 place count 2808 transition count 2107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7803 place count 2807 transition count 2106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8005 place count 2706 transition count 2106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8207 place count 2605 transition count 2106
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8401 place count 2508 transition count 2106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2506 transition count 2104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2505 transition count 2104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2505 transition count 2102
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2503 transition count 2102
Applied a total of 8408 rules in 1928 ms. Remains 2503 /6709 variables (removed 4206) and now considering 2102/6009 (removed 3907) transitions.
// Phase 1: matrix 2102 rows 2503 cols
[2022-05-20 09:25:26] [INFO ] Computed 1100 place invariants in 2 ms
[2022-05-20 09:25:28] [INFO ] Implicit Places using invariants in 1685 ms returned [2486, 2490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1687 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/6709 places, 2102/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2499 transition count 2100
Applied a total of 4 rules in 154 ms. Remains 2499 /2501 variables (removed 2) and now considering 2100/2102 (removed 2) transitions.
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:25:28] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:25:29] [INFO ] Implicit Places using invariants in 1543 ms returned []
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:25:29] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:25:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 09:25:33] [INFO ] Implicit Places using invariants and state equation in 3255 ms returned []
Implicit Place search using SMT with State Equation took 4808 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2499/6709 places, 2100/6009 transitions.
Finished structural reductions, in 2 iterations. Remains : 2499/6709 places, 2100/6009 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s616 0) (EQ s749 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1391 ms.
Product exploration explored 100000 steps with 0 reset in 1830 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95762 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95762 steps, saw 69147 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:25:39] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:25:40] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:25:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 178 ms returned sat
[2022-05-20 09:25:41] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:25:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 09:25:41] [INFO ] After 70ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:25:41] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-20 09:25:41] [INFO ] After 1696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2100/2100 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 2499 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2498 transition count 2099
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2497 transition count 2098
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 2497 transition count 2098
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2495 transition count 2096
Applied a total of 7 rules in 309 ms. Remains 2495 /2499 variables (removed 4) and now considering 2096/2100 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2499 places, 2096/2100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95145 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95145 steps, saw 68692 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:25:45] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:25:45] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:25:46] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:25:47] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:25:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:25:47] [INFO ] After 89ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:25:47] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-20 09:25:47] [INFO ] After 1784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 84 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2495 places, 2096/2096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 75 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:25:47] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:25:49] [INFO ] Implicit Places using invariants in 1583 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:25:49] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:25:52] [INFO ] Implicit Places using invariants and state equation in 3291 ms returned []
Implicit Place search using SMT with State Equation took 4881 ms to find 0 implicit places.
[2022-05-20 09:25:52] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:25:52] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:25:53] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2495 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2495 transition count 2096
Applied a total of 595 rules in 176 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:25:54] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:25:54] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:25:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 182 ms returned sat
[2022-05-20 09:25:55] [INFO ] After 1022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:25:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:25:55] [INFO ] After 75ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:25:55] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-20 09:25:56] [INFO ] After 1766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 2499 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2100/2100 transitions.
Applied a total of 0 rules in 83 ms. Remains 2499 /2499 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:25:56] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:25:57] [INFO ] Implicit Places using invariants in 1551 ms returned []
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:25:57] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:25:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 09:26:01] [INFO ] Implicit Places using invariants and state equation in 3435 ms returned []
Implicit Place search using SMT with State Equation took 4988 ms to find 0 implicit places.
[2022-05-20 09:26:01] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:26:01] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:02] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2100/2100 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 910 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96037 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96037 steps, saw 69353 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2100 rows 2499 cols
[2022-05-20 09:26:06] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:26:07] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:26:07] [INFO ] [Nat]Absence check using 1098 positive place invariants in 194 ms returned sat
[2022-05-20 09:26:08] [INFO ] After 980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:26:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 09:26:08] [INFO ] After 75ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:26:08] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-20 09:26:08] [INFO ] After 1740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2100/2100 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 2499 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2498 transition count 2099
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2497 transition count 2098
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 2497 transition count 2098
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2495 transition count 2096
Applied a total of 7 rules in 297 ms. Remains 2495 /2499 variables (removed 4) and now considering 2096/2100 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2499 places, 2096/2100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95503 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95503 steps, saw 68969 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:12] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:26:12] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:26:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:26:14] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:26:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:26:14] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:26:14] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-20 09:26:14] [INFO ] After 1753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 74 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2495 places, 2096/2096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 74 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:14] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:26:16] [INFO ] Implicit Places using invariants in 1575 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:16] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:26:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:26:19] [INFO ] Implicit Places using invariants and state equation in 3316 ms returned []
Implicit Place search using SMT with State Equation took 4892 ms to find 0 implicit places.
[2022-05-20 09:26:19] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:19] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:26:20] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2495 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2495 transition count 2096
Applied a total of 595 rules in 176 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:21] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:26:21] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:26:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 186 ms returned sat
[2022-05-20 09:26:22] [INFO ] After 1014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:26:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:26:22] [INFO ] After 74ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 09:26:23] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-20 09:26:23] [INFO ] After 1754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 1384 ms.
Product exploration explored 100000 steps with 0 reset in 1789 ms.
Built C files in :
/tmp/ltsmin14049792437072264212
[2022-05-20 09:26:26] [INFO ] Too many transitions (2100) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:26:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14049792437072264212
Running compilation step : cd /tmp/ltsmin14049792437072264212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14049792437072264212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14049792437072264212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2100/2100 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2496 transition count 2097
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2495 transition count 2096
Applied a total of 3 rules in 225 ms. Remains 2495 /2499 variables (removed 4) and now considering 2096/2100 (removed 4) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:29] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:26:31] [INFO ] Implicit Places using invariants in 1565 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:31] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:26:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 09:26:34] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 5038 ms to find 0 implicit places.
[2022-05-20 09:26:34] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 2096 rows 2495 cols
[2022-05-20 09:26:34] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:26:36] [INFO ] Dead Transitions using invariants and state equation in 1320 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2499 places, 2096/2100 transitions.
Finished structural reductions, in 1 iterations. Remains : 2495/2499 places, 2096/2100 transitions.
Built C files in :
/tmp/ltsmin6173755864176927826
[2022-05-20 09:26:36] [INFO ] Too many transitions (2096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:26:36] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6173755864176927826
Running compilation step : cd /tmp/ltsmin6173755864176927826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6173755864176927826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6173755864176927826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:26:39] [INFO ] Flatten gal took : 54 ms
[2022-05-20 09:26:39] [INFO ] Flatten gal took : 56 ms
[2022-05-20 09:26:39] [INFO ] Time to serialize gal into /tmp/LTL710381726682280718.gal : 6 ms
[2022-05-20 09:26:39] [INFO ] Time to serialize properties into /tmp/LTL5581788297005988639.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/LTL710381726682280718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5581788297005988639.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/LTL7103817...265
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X(G((G("((p5889==0)||(p3051==1))"))U(X("((p4044==0)||(p6636==1))")))))U("((p1980==0)||(p2388==1))"))))))
Formula 0 simplified : !XGF(XG(G"((p5889==0)||(p3051==1))" U X"((p4044==0)||(p6636==1))") U "((p1980==0)||(p2388==1))")
Detected timeout of ITS tools.
[2022-05-20 09:26:54] [INFO ] Flatten gal took : 53 ms
[2022-05-20 09:26:54] [INFO ] Applying decomposition
[2022-05-20 09:26:54] [INFO ] Flatten gal took : 54 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/graph1815750610386173134.txt' '-o' '/tmp/graph1815750610386173134.bin' '-w' '/tmp/graph1815750610386173134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1815750610386173134.bin' '-l' '-1' '-v' '-w' '/tmp/graph1815750610386173134.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:26:54] [INFO ] Decomposing Gal with order
[2022-05-20 09:26:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:26:55] [INFO ] Removed a total of 609 redundant transitions.
[2022-05-20 09:26:55] [INFO ] Flatten gal took : 97 ms
[2022-05-20 09:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 19 ms.
[2022-05-20 09:26:55] [INFO ] Time to serialize gal into /tmp/LTL7865145502887948336.gal : 16 ms
[2022-05-20 09:26:55] [INFO ] Time to serialize properties into /tmp/LTL14665310434748731726.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/LTL7865145502887948336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14665310434748731726.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/LTL7865145...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F((X(G((G("((i33.i1.i1.u604.p5889==0)||(i16.i0.i0.u310.p3051==1))"))U(X("((i22.i1.i0.u412.p4044==0)||(i38.i0.i1.u682.p6636==1))...225
Formula 0 simplified : !XGF(XG(G"((i33.i1.i1.u604.p5889==0)||(i16.i0.i0.u310.p3051==1))" U X"((i22.i1.i0.u412.p4044==0)||(i38.i0.i1.u682.p6636==1))") U "((...209
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1609, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i1.u10.t...5246
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14479097536747380137
[2022-05-20 09:27:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14479097536747380137
Running compilation step : cd /tmp/ltsmin14479097536747380137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14479097536747380137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14479097536747380137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-13 finished in 108764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&X((!p1 U p2)))))'
Support contains 4 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 1881 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:27:15] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 09:27:17] [INFO ] Implicit Places using invariants in 2200 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:27:17] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:27:19] [INFO ] Implicit Places using invariants and state equation in 2207 ms returned []
Implicit Place search using SMT with State Equation took 4408 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:27:19] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:27:23] [INFO ] Dead Transitions using invariants and state equation in 4286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s4494 0) (EQ s5612 1)), p1:(OR (EQ s2682 0) (EQ s5554 1)), p0:(AND (EQ s5554 0) (EQ s2682 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 64 reset in 866 ms.
Product exploration explored 100000 steps with 65 reset in 973 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 351 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:27:27] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:27:27] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 09:27:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 698 ms returned sat
[2022-05-20 09:27:35] [INFO ] After 5850ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-20 09:27:38] [INFO ] Deduced a trap composed of 17 places in 2076 ms of which 4 ms to minimize.
[2022-05-20 09:27:40] [INFO ] Deduced a trap composed of 29 places in 2144 ms of which 3 ms to minimize.
[2022-05-20 09:27:42] [INFO ] Deduced a trap composed of 20 places in 2132 ms of which 3 ms to minimize.
[2022-05-20 09:27:45] [INFO ] Deduced a trap composed of 17 places in 2011 ms of which 3 ms to minimize.
[2022-05-20 09:27:47] [INFO ] Deduced a trap composed of 31 places in 2081 ms of which 3 ms to minimize.
[2022-05-20 09:27:49] [INFO ] Deduced a trap composed of 19 places in 2095 ms of which 3 ms to minimize.
[2022-05-20 09:27:51] [INFO ] Deduced a trap composed of 18 places in 1996 ms of which 3 ms to minimize.
[2022-05-20 09:27:54] [INFO ] Deduced a trap composed of 25 places in 2020 ms of which 3 ms to minimize.
[2022-05-20 09:27:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:27:54] [INFO ] After 26082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1200 ms.
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5304 transition count 4604
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2796 place count 5304 transition count 3804
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7792 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7793 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7795 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7997 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8199 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8393 place count 2506 transition count 2104
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8692 place count 2506 transition count 2104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8693 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8694 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8694 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8698 place count 2502 transition count 2101
Applied a total of 8698 rules in 1529 ms. Remains 2502 /6702 variables (removed 4200) and now considering 2101/6002 (removed 3901) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/6702 places, 2101/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59665 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59665 steps, saw 46910 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:28:00] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 09:28:01] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:28:01] [INFO ] [Nat]Absence check using 1100 positive place invariants in 192 ms returned sat
[2022-05-20 09:28:03] [INFO ] After 1281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:28:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:28:03] [INFO ] After 305ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 09:28:03] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2022-05-20 09:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2022-05-20 09:28:04] [INFO ] After 1078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 304 ms.
[2022-05-20 09:28:04] [INFO ] After 3354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 214 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2101/2101 transitions.
Applied a total of 0 rules in 76 ms. Remains 2502 /2502 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2101/2101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2101/2101 transitions.
Applied a total of 0 rules in 75 ms. Remains 2502 /2502 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:28:04] [INFO ] Computed 1100 place invariants in 9 ms
[2022-05-20 09:28:06] [INFO ] Implicit Places using invariants in 1615 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1617 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2502 places, 2101/2101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2498 transition count 2099
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 149 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:06] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:28:08] [INFO ] Implicit Places using invariants in 1621 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:08] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:28:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:28:11] [INFO ] Implicit Places using invariants and state equation in 3487 ms returned []
Implicit Place search using SMT with State Equation took 5110 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2498/2502 places, 2099/2101 transitions.
Finished structural reductions, in 2 iterations. Remains : 2498/2502 places, 2099/2101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63584 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63584 steps, saw 49899 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:15] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:28:15] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:28:16] [INFO ] [Nat]Absence check using 1098 positive place invariants in 202 ms returned sat
[2022-05-20 09:28:17] [INFO ] After 1348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:28:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:28:18] [INFO ] After 322ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 09:28:18] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 320 ms.
[2022-05-20 09:28:19] [INFO ] After 3286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 215 ms.
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 78 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2498/2498 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 78 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:19] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:28:21] [INFO ] Implicit Places using invariants in 1611 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:21] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:28:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:28:24] [INFO ] Implicit Places using invariants and state equation in 3483 ms returned []
Implicit Place search using SMT with State Equation took 5096 ms to find 0 implicit places.
[2022-05-20 09:28:24] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:24] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:28:25] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2498/2498 places, 2099/2099 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2498 transition count 2099
Applied a total of 595 rules in 194 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:28:26] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:28:26] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:28:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 187 ms returned sat
[2022-05-20 09:28:28] [INFO ] After 1260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:28:28] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:28:29] [INFO ] After 782ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 09:28:30] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 1 ms to minimize.
[2022-05-20 09:28:30] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 2 ms to minimize.
[2022-05-20 09:28:31] [INFO ] Deduced a trap composed of 5 places in 592 ms of which 1 ms to minimize.
[2022-05-20 09:28:32] [INFO ] Deduced a trap composed of 9 places in 585 ms of which 2 ms to minimize.
[2022-05-20 09:28:32] [INFO ] Deduced a trap composed of 7 places in 600 ms of which 1 ms to minimize.
[2022-05-20 09:28:33] [INFO ] Deduced a trap composed of 7 places in 559 ms of which 1 ms to minimize.
[2022-05-20 09:28:34] [INFO ] Deduced a trap composed of 5 places in 554 ms of which 1 ms to minimize.
[2022-05-20 09:28:34] [INFO ] Deduced a trap composed of 7 places in 568 ms of which 1 ms to minimize.
[2022-05-20 09:28:35] [INFO ] Deduced a trap composed of 6 places in 576 ms of which 1 ms to minimize.
[2022-05-20 09:28:36] [INFO ] Deduced a trap composed of 7 places in 565 ms of which 1 ms to minimize.
[2022-05-20 09:28:36] [INFO ] Deduced a trap composed of 9 places in 557 ms of which 1 ms to minimize.
[2022-05-20 09:28:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7684 ms
[2022-05-20 09:28:38] [INFO ] Deduced a trap composed of 9 places in 576 ms of which 1 ms to minimize.
[2022-05-20 09:28:38] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 2 ms to minimize.
[2022-05-20 09:28:39] [INFO ] Deduced a trap composed of 11 places in 568 ms of which 1 ms to minimize.
[2022-05-20 09:28:40] [INFO ] Deduced a trap composed of 5 places in 581 ms of which 1 ms to minimize.
[2022-05-20 09:28:40] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 1 ms to minimize.
[2022-05-20 09:28:41] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 1 ms to minimize.
[2022-05-20 09:28:42] [INFO ] Deduced a trap composed of 7 places in 598 ms of which 1 ms to minimize.
[2022-05-20 09:28:42] [INFO ] Deduced a trap composed of 5 places in 599 ms of which 1 ms to minimize.
[2022-05-20 09:28:43] [INFO ] Deduced a trap composed of 5 places in 589 ms of which 1 ms to minimize.
[2022-05-20 09:28:44] [INFO ] Deduced a trap composed of 5 places in 596 ms of which 1 ms to minimize.
[2022-05-20 09:28:45] [INFO ] Deduced a trap composed of 5 places in 600 ms of which 2 ms to minimize.
[2022-05-20 09:28:45] [INFO ] Deduced a trap composed of 7 places in 593 ms of which 2 ms to minimize.
[2022-05-20 09:28:46] [INFO ] Deduced a trap composed of 5 places in 586 ms of which 1 ms to minimize.
[2022-05-20 09:28:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 9243 ms
[2022-05-20 09:28:47] [INFO ] Deduced a trap composed of 6 places in 589 ms of which 1 ms to minimize.
[2022-05-20 09:28:48] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 2 ms to minimize.
[2022-05-20 09:28:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1492 ms
[2022-05-20 09:28:48] [INFO ] After 19805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 671 ms.
[2022-05-20 09:28:48] [INFO ] After 22436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 11 factoid took 518 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:28:49] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:29:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 6713 ms returned sat
[2022-05-20 09:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:29:04] [INFO ] [Real]Absence check using state equation in 1509 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 913 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:29:05] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 09:29:07] [INFO ] Implicit Places using invariants in 2084 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:29:07] [INFO ] Computed 1101 place invariants in 21 ms
[2022-05-20 09:29:10] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 4273 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:29:10] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:29:14] [INFO ] Dead Transitions using invariants and state equation in 3944 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6702 places, 6002/6002 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 370 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:29:15] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:29:16] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:29:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 688 ms returned sat
[2022-05-20 09:29:23] [INFO ] After 5749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:29:25] [INFO ] Deduced a trap composed of 23 places in 1910 ms of which 2 ms to minimize.
[2022-05-20 09:29:28] [INFO ] Deduced a trap composed of 22 places in 1978 ms of which 3 ms to minimize.
[2022-05-20 09:29:30] [INFO ] Deduced a trap composed of 25 places in 1940 ms of which 3 ms to minimize.
[2022-05-20 09:29:32] [INFO ] Deduced a trap composed of 21 places in 1930 ms of which 3 ms to minimize.
[2022-05-20 09:29:34] [INFO ] Deduced a trap composed of 16 places in 1918 ms of which 3 ms to minimize.
[2022-05-20 09:29:36] [INFO ] Deduced a trap composed of 22 places in 1854 ms of which 3 ms to minimize.
[2022-05-20 09:29:38] [INFO ] Deduced a trap composed of 27 places in 1892 ms of which 2 ms to minimize.
[2022-05-20 09:29:40] [INFO ] Deduced a trap composed of 20 places in 1843 ms of which 3 ms to minimize.
[2022-05-20 09:29:42] [INFO ] Deduced a trap composed of 28 places in 1796 ms of which 3 ms to minimize.
[2022-05-20 09:29:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:29:42] [INFO ] After 26529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 1042 ms.
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5304 transition count 4604
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2796 place count 5304 transition count 3804
Deduced a syphon composed of 800 places in 11 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 18 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7792 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7793 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7795 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7997 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8199 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8393 place count 2506 transition count 2104
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8692 place count 2506 transition count 2104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8693 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8694 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8694 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8698 place count 2502 transition count 2101
Applied a total of 8698 rules in 1449 ms. Remains 2502 /6702 variables (removed 4200) and now considering 2101/6002 (removed 3901) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/6702 places, 2101/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 62595 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62595 steps, saw 49087 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:29:48] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 09:29:49] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:29:49] [INFO ] [Nat]Absence check using 1100 positive place invariants in 186 ms returned sat
[2022-05-20 09:29:51] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:29:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 09:29:51] [INFO ] After 292ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 09:29:51] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 09:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2022-05-20 09:29:52] [INFO ] After 1029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 301 ms.
[2022-05-20 09:29:52] [INFO ] After 3238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 207 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2101/2101 transitions.
Applied a total of 0 rules in 74 ms. Remains 2502 /2502 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2101/2101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2101/2101 transitions.
Applied a total of 0 rules in 76 ms. Remains 2502 /2502 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:29:52] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 09:29:54] [INFO ] Implicit Places using invariants in 1597 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1599 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2502 places, 2101/2101 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2498 transition count 2099
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 149 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:29:54] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:29:56] [INFO ] Implicit Places using invariants in 1610 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:29:56] [INFO ] Computed 1098 place invariants in 6 ms
[2022-05-20 09:29:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:29:59] [INFO ] Implicit Places using invariants and state equation in 3243 ms returned []
Implicit Place search using SMT with State Equation took 4853 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2498/2502 places, 2099/2101 transitions.
Finished structural reductions, in 2 iterations. Remains : 2498/2502 places, 2099/2101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59872 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59872 steps, saw 47127 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:30:03] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:30:03] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:30:04] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:30:05] [INFO ] After 1205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:30:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:30:05] [INFO ] After 292ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 09:30:06] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2022-05-20 09:30:06] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-05-20 09:30:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
[2022-05-20 09:30:06] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2022-05-20 09:30:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2022-05-20 09:30:07] [INFO ] After 1486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 296 ms.
[2022-05-20 09:30:07] [INFO ] After 3666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 212 ms.
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 76 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2498/2498 places, 2099/2099 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 75 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:30:07] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:30:09] [INFO ] Implicit Places using invariants in 1588 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:30:09] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:30:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:30:12] [INFO ] Implicit Places using invariants and state equation in 3354 ms returned []
Implicit Place search using SMT with State Equation took 4942 ms to find 0 implicit places.
[2022-05-20 09:30:12] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:30:12] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:30:14] [INFO ] Dead Transitions using invariants and state equation in 1319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2498/2498 places, 2099/2099 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2498 transition count 2099
Applied a total of 595 rules in 179 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:30:14] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:30:14] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 09:30:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 180 ms returned sat
[2022-05-20 09:30:16] [INFO ] After 1235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 09:30:16] [INFO ] State equation strengthened by 592 read => feed constraints.
[2022-05-20 09:30:17] [INFO ] After 814ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 09:30:18] [INFO ] Deduced a trap composed of 5 places in 608 ms of which 1 ms to minimize.
[2022-05-20 09:30:18] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 2 ms to minimize.
[2022-05-20 09:30:19] [INFO ] Deduced a trap composed of 6 places in 596 ms of which 1 ms to minimize.
[2022-05-20 09:30:20] [INFO ] Deduced a trap composed of 5 places in 591 ms of which 2 ms to minimize.
[2022-05-20 09:30:20] [INFO ] Deduced a trap composed of 7 places in 581 ms of which 2 ms to minimize.
[2022-05-20 09:30:21] [INFO ] Deduced a trap composed of 6 places in 588 ms of which 1 ms to minimize.
[2022-05-20 09:30:22] [INFO ] Deduced a trap composed of 5 places in 619 ms of which 2 ms to minimize.
[2022-05-20 09:30:23] [INFO ] Deduced a trap composed of 9 places in 578 ms of which 1 ms to minimize.
[2022-05-20 09:30:23] [INFO ] Deduced a trap composed of 9 places in 575 ms of which 1 ms to minimize.
[2022-05-20 09:30:24] [INFO ] Deduced a trap composed of 7 places in 579 ms of which 1 ms to minimize.
[2022-05-20 09:30:25] [INFO ] Deduced a trap composed of 5 places in 580 ms of which 1 ms to minimize.
[2022-05-20 09:30:25] [INFO ] Deduced a trap composed of 5 places in 587 ms of which 2 ms to minimize.
[2022-05-20 09:30:26] [INFO ] Deduced a trap composed of 5 places in 577 ms of which 2 ms to minimize.
[2022-05-20 09:30:27] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 1 ms to minimize.
[2022-05-20 09:30:27] [INFO ] Deduced a trap composed of 5 places in 582 ms of which 2 ms to minimize.
[2022-05-20 09:30:28] [INFO ] Deduced a trap composed of 5 places in 590 ms of which 2 ms to minimize.
[2022-05-20 09:30:28] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 11267 ms
[2022-05-20 09:30:29] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2022-05-20 09:30:30] [INFO ] Deduced a trap composed of 6 places in 590 ms of which 1 ms to minimize.
[2022-05-20 09:30:30] [INFO ] Deduced a trap composed of 5 places in 600 ms of which 1 ms to minimize.
[2022-05-20 09:30:31] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2022-05-20 09:30:32] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2022-05-20 09:30:33] [INFO ] Deduced a trap composed of 13 places in 587 ms of which 1 ms to minimize.
[2022-05-20 09:30:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4342 ms
[2022-05-20 09:30:34] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 1 ms to minimize.
[2022-05-20 09:30:34] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 2 ms to minimize.
[2022-05-20 09:30:35] [INFO ] Deduced a trap composed of 6 places in 592 ms of which 1 ms to minimize.
[2022-05-20 09:30:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2263 ms
[2022-05-20 09:30:35] [INFO ] After 19309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 710 ms.
[2022-05-20 09:30:36] [INFO ] After 21933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 409 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:30:37] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 09:30:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 6584 ms returned sat
[2022-05-20 09:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:30:52] [INFO ] [Real]Absence check using state equation in 1781 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 66 reset in 840 ms.
Product exploration explored 100000 steps with 64 reset in 945 ms.
Built C files in :
/tmp/ltsmin13150628317451069700
[2022-05-20 09:30:54] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13150628317451069700
Running compilation step : cd /tmp/ltsmin13150628317451069700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13150628317451069700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13150628317451069700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 968 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:30:58] [INFO ] Computed 1101 place invariants in 26 ms
[2022-05-20 09:31:00] [INFO ] Implicit Places using invariants in 2122 ms returned []
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:31:00] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:31:02] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 4294 ms to find 0 implicit places.
// Phase 1: matrix 6002 rows 6702 cols
[2022-05-20 09:31:02] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 09:31:06] [INFO ] Dead Transitions using invariants and state equation in 4035 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6702/6702 places, 6002/6002 transitions.
Built C files in :
/tmp/ltsmin16694486629444390125
[2022-05-20 09:31:06] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16694486629444390125
Running compilation step : cd /tmp/ltsmin16694486629444390125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16694486629444390125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16694486629444390125;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:31:10] [INFO ] Flatten gal took : 171 ms
[2022-05-20 09:31:10] [INFO ] Flatten gal took : 308 ms
[2022-05-20 09:31:10] [INFO ] Time to serialize gal into /tmp/LTL16765871163504629715.gal : 39 ms
[2022-05-20 09:31:10] [INFO ] Time to serialize properties into /tmp/LTL1981411315400523194.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/LTL16765871163504629715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1981411315400523194.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/LTL1676587...267
Read 1 LTL properties
Checking formula 0 : !((F((X(X("((p6457==0)&&(p3111==1))")))&&(X((!("((p3111==0)||(p6457==1))"))U("((p5221==0)||(p6524==1))"))))))
Formula 0 simplified : !F(XX"((p6457==0)&&(p3111==1))" & X(!"((p3111==0)||(p6457==1))" U "((p5221==0)||(p6524==1))"))
Detected timeout of ITS tools.
[2022-05-20 09:31:25] [INFO ] Flatten gal took : 136 ms
[2022-05-20 09:31:25] [INFO ] Applying decomposition
[2022-05-20 09:31:25] [INFO ] Flatten gal took : 142 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/graph16752762073754864574.txt' '-o' '/tmp/graph16752762073754864574.bin' '-w' '/tmp/graph16752762073754864574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16752762073754864574.bin' '-l' '-1' '-v' '-w' '/tmp/graph16752762073754864574.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:31:26] [INFO ] Decomposing Gal with order
[2022-05-20 09:31:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:31:28] [INFO ] Removed a total of 988 redundant transitions.
[2022-05-20 09:31:28] [INFO ] Flatten gal took : 236 ms
[2022-05-20 09:31:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2022-05-20 09:31:28] [INFO ] Time to serialize gal into /tmp/LTL15618571901916691824.gal : 63 ms
[2022-05-20 09:31:28] [INFO ] Time to serialize properties into /tmp/LTL6000312125504461415.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/LTL15618571901916691824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6000312125504461415.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/LTL1561857...246
Read 1 LTL properties
Checking formula 0 : !((F((X(X("((i60.i1.i6.u1968.p6457==0)&&(i32.u955.p3111==1))")))&&(X((!("((i32.u955.p3111==0)||(i60.i1.i6.u1968.p6457==1))"))U("((i47....206
Formula 0 simplified : !F(XX"((i60.i1.i6.u1968.p6457==0)&&(i32.u955.p3111==1))" & X(!"((i32.u955.p3111==0)||(i60.i1.i6.u1968.p6457==1))" U "((i47.i1.i3.u15...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12685841665430817123
[2022-05-20 09:31:43] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12685841665430817123
Running compilation step : cd /tmp/ltsmin12685841665430817123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12685841665430817123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12685841665430817123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-14 finished in 273314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 1877 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:31:48] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 09:31:50] [INFO ] Implicit Places using invariants in 2120 ms returned []
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:31:50] [INFO ] Computed 1101 place invariants in 63 ms
[2022-05-20 09:31:52] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 4318 ms to find 0 implicit places.
// Phase 1: matrix 6001 rows 6701 cols
[2022-05-20 09:31:52] [INFO ] Computed 1101 place invariants in 18 ms
[2022-05-20 09:31:56] [INFO ] Dead Transitions using invariants and state equation in 3973 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions, in 1 iterations. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s3174 0) (EQ s5432 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2682 ms.
Product exploration explored 100000 steps with 33333 reset in 2682 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-15 finished in 15854 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(G(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((X((X(p0)||X(p1)))&&(X(p3)||p2))))))'
Found a SL insensitive property : ShieldPPPt-PT-100B-LTLCardinality-10
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 6 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6708 transition count 4610
Reduce places removed 1398 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2798 place count 5310 transition count 4608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3813
Deduced a syphon composed of 795 places in 11 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 4396 place count 4507 transition count 3807
Iterating global reduction 3 with 6 rules applied. Total rules applied 4402 place count 4507 transition count 3807
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4402 place count 4507 transition count 3803
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4410 place count 4503 transition count 3803
Performed 1691 Post agglomeration using F-continuation condition.Transition count delta: 1691
Deduced a syphon composed of 1691 places in 4 ms
Reduce places removed 1691 places and 0 transitions.
Iterating global reduction 3 with 3382 rules applied. Total rules applied 7792 place count 2812 transition count 2112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7793 place count 2812 transition count 2111
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7795 place count 2811 transition count 2110
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7997 place count 2710 transition count 2110
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8199 place count 2609 transition count 2110
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8393 place count 2512 transition count 2110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8395 place count 2510 transition count 2108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8396 place count 2509 transition count 2108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8396 place count 2509 transition count 2106
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8400 place count 2507 transition count 2106
Applied a total of 8400 rules in 2053 ms. Remains 2507 /6709 variables (removed 4202) and now considering 2106/6009 (removed 3903) transitions.
// Phase 1: matrix 2106 rows 2507 cols
[2022-05-20 09:32:04] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 09:32:06] [INFO ] Implicit Places using invariants in 1723 ms returned [2490, 2494]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1725 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2505/6709 places, 2106/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2503 transition count 2104
Applied a total of 4 rules in 168 ms. Remains 2503 /2505 variables (removed 2) and now considering 2104/2106 (removed 2) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:32:06] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:32:08] [INFO ] Implicit Places using invariants in 1570 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:32:08] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:32:09] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:32:25] [INFO ] Implicit Places using invariants and state equation in 16910 ms returned []
Implicit Place search using SMT with State Equation took 18483 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 2503/6709 places, 2104/6009 transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/6709 places, 2104/6009 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p2:(OR (EQ s2484 0) (EQ s379 1)), p3:(OR (EQ s1766 0) (EQ s2234 1)), p0:(AND (EQ s379 0) (EQ s2484 1)), p1:(OR (EQ s976 0) (EQ s1176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17724 reset in 2830 ms.
Product exploration explored 100000 steps with 17828 reset in 2967 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/2503 stabilizing places and 6/2104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:32:31] [INFO ] Computed 1098 place invariants in 10 ms
[2022-05-20 09:32:32] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:32:32] [INFO ] [Nat]Absence check using 1098 positive place invariants in 198 ms returned sat
[2022-05-20 09:32:34] [INFO ] After 1393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:32:34] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:32:35] [INFO ] After 1488ms SMT Verify possible using 631 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:32:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-20 09:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2022-05-20 09:32:36] [INFO ] After 2372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 422 ms.
[2022-05-20 09:32:36] [INFO ] After 4747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 261 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Partial Free-agglomeration rule applied 269 times.
Drop transitions removed 269 transitions
Iterating global reduction 0 with 269 rules applied. Total rules applied 269 place count 2503 transition count 2104
Applied a total of 269 rules in 153 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 85696 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85696 steps, saw 64622 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:32:40] [INFO ] Computed 1098 place invariants in 10 ms
[2022-05-20 09:32:41] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:32:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2022-05-20 09:32:43] [INFO ] After 1465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:32:43] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:32:45] [INFO ] After 2210ms SMT Verify possible using 631 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:32:47] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-20 09:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2022-05-20 09:32:47] [INFO ] After 4641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1001 ms.
[2022-05-20 09:32:48] [INFO ] After 7641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 256 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 78 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 78 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:32:49] [INFO ] Computed 1098 place invariants in 8 ms
[2022-05-20 09:32:50] [INFO ] Implicit Places using invariants in 1582 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:32:50] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:32:52] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:33:09] [INFO ] Implicit Places using invariants and state equation in 18537 ms returned []
Implicit Place search using SMT with State Equation took 20119 ms to find 0 implicit places.
[2022-05-20 09:33:09] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:33:09] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:33:10] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Partial Free-agglomeration rule applied 685 times.
Drop transitions removed 685 transitions
Iterating global reduction 0 with 685 rules applied. Total rules applied 685 place count 2503 transition count 2104
Applied a total of 685 rules in 188 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:33:10] [INFO ] Computed 1098 place invariants in 10 ms
[2022-05-20 09:33:11] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:33:11] [INFO ] [Nat]Absence check using 1098 positive place invariants in 193 ms returned sat
[2022-05-20 09:33:13] [INFO ] After 1742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:33:13] [INFO ] State equation strengthened by 627 read => feed constraints.
[2022-05-20 09:33:18] [INFO ] After 4965ms SMT Verify possible using 627 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:33:23] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-20 09:33:23] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:33:23] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2022-05-20 09:33:25] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2022-05-20 09:33:25] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:33:25] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:33:26] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2022-05-20 09:33:26] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2022-05-20 09:33:26] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:33:26] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2022-05-20 09:33:27] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-20 09:33:27] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2022-05-20 09:33:28] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2022-05-20 09:33:28] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2022-05-20 09:33:28] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-05-20 09:33:28] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2022-05-20 09:33:29] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2022-05-20 09:33:38] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 15247 ms
[2022-05-20 09:33:38] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2022-05-20 09:33:39] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2022-05-20 09:33:39] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2022-05-20 09:33:39] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 0 ms to minimize.
[2022-05-20 09:33:40] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2022-05-20 09:33:40] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2022-05-20 09:33:40] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2022-05-20 09:33:40] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2022-05-20 09:33:41] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2022-05-20 09:33:41] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2022-05-20 09:33:42] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2022-05-20 09:33:42] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2022-05-20 09:33:42] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 09:33:43] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2022-05-20 09:33:43] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2022-05-20 09:33:43] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2022-05-20 09:33:44] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2022-05-20 09:33:44] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2022-05-20 09:33:44] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2022-05-20 09:33:45] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2022-05-20 09:33:45] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2022-05-20 09:33:45] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2022-05-20 09:33:45] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 0 ms to minimize.
[2022-05-20 09:33:46] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 0 ms to minimize.
[2022-05-20 09:33:46] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 1 ms to minimize.
[2022-05-20 09:33:46] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2022-05-20 09:33:47] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2022-05-20 09:33:47] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2022-05-20 09:33:47] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2022-05-20 09:33:48] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2022-05-20 09:33:48] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2022-05-20 09:33:48] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2022-05-20 09:33:49] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 0 ms to minimize.
[2022-05-20 09:33:49] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2022-05-20 09:33:49] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 0 ms to minimize.
[2022-05-20 09:33:50] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2022-05-20 09:33:50] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2022-05-20 09:33:50] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2022-05-20 09:33:50] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2022-05-20 09:33:51] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 12496 ms
[2022-05-20 09:33:51] [INFO ] After 37793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-20 09:33:51] [INFO ] After 40182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:33:51] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:33:53] [INFO ] Implicit Places using invariants in 1518 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:33:53] [INFO ] Computed 1098 place invariants in 3 ms
[2022-05-20 09:33:54] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:34:11] [INFO ] Implicit Places using invariants and state equation in 18463 ms returned []
Implicit Place search using SMT with State Equation took 19981 ms to find 0 implicit places.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:11] [INFO ] Computed 1098 place invariants in 10 ms
[2022-05-20 09:34:13] [INFO ] Dead Transitions using invariants and state equation in 1304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/2503 stabilizing places and 6/2104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:14] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:34:14] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:34:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 195 ms returned sat
[2022-05-20 09:34:16] [INFO ] After 1374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:34:16] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:34:17] [INFO ] After 1407ms SMT Verify possible using 631 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:34:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-20 09:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2022-05-20 09:34:18] [INFO ] After 2311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 423 ms.
[2022-05-20 09:34:19] [INFO ] After 4685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 260 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Partial Free-agglomeration rule applied 269 times.
Drop transitions removed 269 transitions
Iterating global reduction 0 with 269 rules applied. Total rules applied 269 place count 2503 transition count 2104
Applied a total of 269 rules in 155 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 80231 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80231 steps, saw 60041 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:22] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 09:34:23] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:34:23] [INFO ] [Nat]Absence check using 1098 positive place invariants in 206 ms returned sat
[2022-05-20 09:34:25] [INFO ] After 1448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:34:25] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:34:27] [INFO ] After 2181ms SMT Verify possible using 631 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:34:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-20 09:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2022-05-20 09:34:29] [INFO ] After 4623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 968 ms.
[2022-05-20 09:34:30] [INFO ] After 7609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 222 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:31] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:34:32] [INFO ] Implicit Places using invariants in 1602 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:32] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:34:34] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:34:49] [INFO ] Implicit Places using invariants and state equation in 16925 ms returned []
Implicit Place search using SMT with State Equation took 18527 ms to find 0 implicit places.
[2022-05-20 09:34:49] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:49] [INFO ] Computed 1098 place invariants in 9 ms
[2022-05-20 09:34:51] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Partial Free-agglomeration rule applied 685 times.
Drop transitions removed 685 transitions
Iterating global reduction 0 with 685 rules applied. Total rules applied 685 place count 2503 transition count 2104
Applied a total of 685 rules in 189 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:34:51] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 09:34:51] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:34:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 197 ms returned sat
[2022-05-20 09:34:53] [INFO ] After 1723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:34:53] [INFO ] State equation strengthened by 627 read => feed constraints.
[2022-05-20 09:34:58] [INFO ] After 4937ms SMT Verify possible using 627 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 09:35:03] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-20 09:35:03] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2022-05-20 09:35:03] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:35:05] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:35:05] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-20 09:35:06] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:35:06] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:35:06] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2022-05-20 09:35:06] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2022-05-20 09:35:07] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:35:07] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2022-05-20 09:35:07] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2022-05-20 09:35:08] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2022-05-20 09:35:08] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2022-05-20 09:35:08] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2022-05-20 09:35:09] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2022-05-20 09:35:09] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2022-05-20 09:35:18] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 15234 ms
[2022-05-20 09:35:19] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2022-05-20 09:35:20] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 0 ms to minimize.
[2022-05-20 09:35:20] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 0 ms to minimize.
[2022-05-20 09:35:20] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2022-05-20 09:35:21] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2022-05-20 09:35:21] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2022-05-20 09:35:21] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2022-05-20 09:35:22] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2022-05-20 09:35:22] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2022-05-20 09:35:22] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 0 ms to minimize.
[2022-05-20 09:35:23] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 0 ms to minimize.
[2022-05-20 09:35:23] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 0 ms to minimize.
[2022-05-20 09:35:23] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-05-20 09:35:24] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2022-05-20 09:35:24] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2022-05-20 09:35:24] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2022-05-20 09:35:25] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2022-05-20 09:35:25] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2022-05-20 09:35:25] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2022-05-20 09:35:26] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2022-05-20 09:35:26] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2022-05-20 09:35:26] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2022-05-20 09:35:27] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2022-05-20 09:35:27] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2022-05-20 09:35:27] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2022-05-20 09:35:28] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2022-05-20 09:35:28] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 0 ms to minimize.
[2022-05-20 09:35:28] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2022-05-20 09:35:29] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2022-05-20 09:35:29] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2022-05-20 09:35:30] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2022-05-20 09:35:30] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2022-05-20 09:35:30] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2022-05-20 09:35:31] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2022-05-20 09:35:31] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2022-05-20 09:35:31] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 11808 ms
[2022-05-20 09:35:31] [INFO ] After 37793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-20 09:35:31] [INFO ] After 40142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p3 (NOT p0) p1), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 7 states, 9 edges and 4 AP to 7 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17759 reset in 2827 ms.
Product exploration explored 100000 steps with 17745 reset in 2943 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2022-05-20 09:35:39] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:35:39] [INFO ] Computed 1098 place invariants in 11 ms
[2022-05-20 09:35:40] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Product exploration explored 100000 steps with 17776 reset in 7361 ms.
Product exploration explored 100000 steps with 17743 reset in 7514 ms.
Built C files in :
/tmp/ltsmin11385603979121589227
[2022-05-20 09:35:55] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11385603979121589227
Running compilation step : cd /tmp/ltsmin11385603979121589227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11385603979121589227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11385603979121589227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:35:58] [INFO ] Computed 1098 place invariants in 11 ms
[2022-05-20 09:35:59] [INFO ] Implicit Places using invariants in 1540 ms returned []
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:35:59] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:36:01] [INFO ] State equation strengthened by 631 read => feed constraints.
[2022-05-20 09:36:18] [INFO ] Implicit Places using invariants and state equation in 18417 ms returned []
Implicit Place search using SMT with State Equation took 19957 ms to find 0 implicit places.
// Phase 1: matrix 2104 rows 2503 cols
[2022-05-20 09:36:18] [INFO ] Computed 1098 place invariants in 11 ms
[2022-05-20 09:36:19] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin14105422353120013718
[2022-05-20 09:36:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14105422353120013718
Running compilation step : cd /tmp/ltsmin14105422353120013718;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14105422353120013718;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14105422353120013718;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 09:36:22] [INFO ] Flatten gal took : 94 ms
[2022-05-20 09:36:22] [INFO ] Flatten gal took : 96 ms
[2022-05-20 09:36:22] [INFO ] Time to serialize gal into /tmp/LTL2818762094411097182.gal : 7 ms
[2022-05-20 09:36:22] [INFO ] Time to serialize properties into /tmp/LTL9301091314400872912.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/LTL2818762094411097182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9301091314400872912.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/LTL2818762...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X((X((X("((p1257==0)&&(p7714==1))"))||(X("((p3078==0)||(p3691==1))"))))&&(((X("((p5512==0)||(p6956==1))"))||("(p7714==0)"))||("...173
Formula 0 simplified : !GXX(X(X"((p1257==0)&&(p7714==1))" | X"((p3078==0)||(p3691==1))") & ("(p1257==1)" | "(p7714==0)" | X"((p5512==0)||(p6956==1))"))
Detected timeout of ITS tools.
[2022-05-20 09:36:37] [INFO ] Flatten gal took : 93 ms
[2022-05-20 09:36:37] [INFO ] Applying decomposition
[2022-05-20 09:36:38] [INFO ] Flatten gal took : 95 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/graph10177496694231391763.txt' '-o' '/tmp/graph10177496694231391763.bin' '-w' '/tmp/graph10177496694231391763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10177496694231391763.bin' '-l' '-1' '-v' '-w' '/tmp/graph10177496694231391763.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:36:38] [INFO ] Decomposing Gal with order
[2022-05-20 09:36:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:36:38] [INFO ] Removed a total of 609 redundant transitions.
[2022-05-20 09:36:38] [INFO ] Flatten gal took : 98 ms
[2022-05-20 09:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 66 ms.
[2022-05-20 09:36:38] [INFO ] Time to serialize gal into /tmp/LTL13144559501455988791.gal : 19 ms
[2022-05-20 09:36:38] [INFO ] Time to serialize properties into /tmp/LTL1366471673330728744.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/LTL13144559501455988791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1366471673330728744.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/LTL1314455...246
Read 1 LTL properties
Checking formula 0 : !((G(X(X((X((X("((i5.i1.i2.u121.p1257==0)&&(i43.i1.i1.u797.p7714==1))"))||(X("((i16.i0.i2.u313.p3078==0)||(i20.i0.i0.u378.p3691==1))")...291
Formula 0 simplified : !GXX(X(X"((i5.i1.i2.u121.p1257==0)&&(i43.i1.i1.u797.p7714==1))" | X"((i16.i0.i2.u313.p3078==0)||(i20.i0.i0.u378.p3691==1))") & ("(i5...269
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i1.u1.t1609, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i1.u10.t...6224
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13528430138400711355
[2022-05-20 09:36:53] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13528430138400711355
Running compilation step : cd /tmp/ltsmin13528430138400711355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13528430138400711355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13528430138400711355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-10 finished in 294136 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(G((G(p0) U X(p1)))) U p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&X((!p1 U p2)))))'
Found a CL insensitive property : ShieldPPPt-PT-100B-LTLCardinality-14
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Support contains 4 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1402 transitions
Trivial Post-agglo rules discarded 1402 transitions
Performed 1402 trivial Post agglomeration. Transition count delta: 1402
Iterating post reduction 0 with 1402 rules applied. Total rules applied 1402 place count 6708 transition count 4606
Reduce places removed 1402 places and 0 transitions.
Iterating post reduction 1 with 1402 rules applied. Total rules applied 2804 place count 5306 transition count 4606
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2804 place count 5306 transition count 3809
Deduced a syphon composed of 797 places in 11 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4398 place count 4509 transition count 3809
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 4405 place count 4502 transition count 3802
Iterating global reduction 2 with 7 rules applied. Total rules applied 4412 place count 4502 transition count 3802
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4412 place count 4502 transition count 3798
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4420 place count 4498 transition count 3798
Performed 1691 Post agglomeration using F-continuation condition.Transition count delta: 1691
Deduced a syphon composed of 1691 places in 4 ms
Reduce places removed 1691 places and 0 transitions.
Iterating global reduction 2 with 3382 rules applied. Total rules applied 7802 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2807 transition count 2106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2604 transition count 2105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8403 place count 2507 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8405 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8406 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8406 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8410 place count 2502 transition count 2101
Applied a total of 8410 rules in 2007 ms. Remains 2502 /6709 variables (removed 4207) and now considering 2101/6009 (removed 3908) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2022-05-20 09:36:58] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 09:37:00] [INFO ] Implicit Places using invariants in 1661 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1662 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2500/6709 places, 2101/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 161 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:37:00] [INFO ] Computed 1098 place invariants in 4 ms
[2022-05-20 09:37:02] [INFO ] Implicit Places using invariants in 1635 ms returned []
// Phase 1: matrix 2099 rows 2498 cols
[2022-05-20 09:37:02] [INFO ] Computed 1098 place invariants in 2 ms
[2022-05-20 09:37:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 09:37:05] [INFO ] Implicit Places using invariants and state equation in 3323 ms returned []
Implicit Place search using SMT with State Equation took 4962 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 2498/6709 places, 2099/6009 transitions.
Finished structural reductions, in 2 iterations. Remains : 2498/6709 places, 2099/6009 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s1672 0) (EQ s2097 1)), p1:(OR (EQ s978 0) (EQ s2074 1)), p0:(AND (EQ s2074 0) (EQ s978 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1438 ms.
Stack based approach found an accepted trace after 32 steps with 3 reset with depth 5 and stack size 5 in 1 ms.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-14 finished in 10482 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-20 09:37:07] [INFO ] Flatten gal took : 144 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6644005279259431604
[2022-05-20 09:37:07] [INFO ] Too many transitions (6009) to apply POR reductions. Disabling POR matrices.
[2022-05-20 09:37:07] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6644005279259431604
Running compilation step : cd /tmp/ltsmin6644005279259431604;'/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'
[2022-05-20 09:37:07] [INFO ] Applying decomposition
[2022-05-20 09:37:07] [INFO ] Flatten gal took : 140 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/graph14799696894764339764.txt' '-o' '/tmp/graph14799696894764339764.bin' '-w' '/tmp/graph14799696894764339764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14799696894764339764.bin' '-l' '-1' '-v' '-w' '/tmp/graph14799696894764339764.weights' '-q' '0' '-e' '0.001'
[2022-05-20 09:37:07] [INFO ] Decomposing Gal with order
[2022-05-20 09:37:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:37:09] [INFO ] Removed a total of 993 redundant transitions.
[2022-05-20 09:37:10] [INFO ] Flatten gal took : 315 ms
[2022-05-20 09:37:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-20 09:37:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality8928036927717112040.gal : 29 ms
[2022-05-20 09:37:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality4872388264566574148.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/LTLCardinality8928036927717112040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4872388264566574148.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 4 LTL properties
Checking formula 0 : !((X((("((i15.u533.p1707==0)||(i14.u468.p1491==1))")U("((i9.u297.p932==0)||(i35.i0.i1.i1.u1188.p3851==1))"))&&(F(G("((i9.u297.p932==0)...194
Formula 0 simplified : !X(("((i15.u533.p1707==0)||(i14.u468.p1491==1))" U "((i9.u297.p932==0)||(i35.i0.i1.i1.u1188.p3851==1))") & FG"((i9.u297.p932==0)||(i...185
Compilation finished in 23811 ms.
Running link step : cd /tmp/ltsmin6644005279259431604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin6644005279259431604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true) U (LTLAPp1==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6644005279259431604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true) U (LTLAPp1==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6644005279259431604;'/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((LTLAPp2==true))||X((LTLAPp3==true))))&&(X((LTLAPp5==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 10:05:27] [INFO ] Applying decomposition
[2022-05-20 10:05:28] [INFO ] Flatten gal took : 1123 ms
[2022-05-20 10:05:29] [INFO ] Decomposing Gal with order
[2022-05-20 10:05:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 10:05:56] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 10:05:56] [INFO ] Flatten gal took : 349 ms
[2022-05-20 10:06:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1194 labels/synchronizations in 846 ms.
[2022-05-20 10:06:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality13378272880881242503.gal : 161 ms
[2022-05-20 10:06:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality2896685609180262429.ltl : 20 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/LTLCardinality13378272880881242503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2896685609180262429.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 4 LTL properties
Checking formula 0 : !((X((("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...1517
Formula 0 simplified : !X(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1508
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6644005279259431604;'/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((LTLAPp2==true))||X((LTLAPp3==true))))&&(X((LTLAPp5==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6644005279259431604;'/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([](([]((LTLAPp6==true)) U X((LTLAPp7==true))))) U (LTLAPp8==true)))))' '--buchi-type=spotba'
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025600699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;