About the Execution of ITS-Tools for ShieldPPPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3097.084 | 268571.00 | 351062.00 | 895.40 | FFTFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205700813.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205700813
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 569K May 5 16:52 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-030B-00
FORMULA_NAME ShieldPPPt-PT-030B-01
FORMULA_NAME ShieldPPPt-PT-030B-02
FORMULA_NAME ShieldPPPt-PT-030B-03
FORMULA_NAME ShieldPPPt-PT-030B-04
FORMULA_NAME ShieldPPPt-PT-030B-05
FORMULA_NAME ShieldPPPt-PT-030B-06
FORMULA_NAME ShieldPPPt-PT-030B-07
FORMULA_NAME ShieldPPPt-PT-030B-08
FORMULA_NAME ShieldPPPt-PT-030B-09
FORMULA_NAME ShieldPPPt-PT-030B-10
FORMULA_NAME ShieldPPPt-PT-030B-11
FORMULA_NAME ShieldPPPt-PT-030B-12
FORMULA_NAME ShieldPPPt-PT-030B-13
FORMULA_NAME ShieldPPPt-PT-030B-14
FORMULA_NAME ShieldPPPt-PT-030B-15
=== Now, execution of the tool begins
BK_START 1621181669111
Running Version 0
[2021-05-16 16:14:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 16:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:14:30] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2021-05-16 16:14:30] [INFO ] Transformed 2343 places.
[2021-05-16 16:14:30] [INFO ] Transformed 2133 transitions.
[2021-05-16 16:14:30] [INFO ] Found NUPN structural information;
[2021-05-16 16:14:30] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 2343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 325 places :
Symmetric choice reduction at 0 with 325 rule applications. Total rules 325 place count 2018 transition count 1808
Iterating global reduction 0 with 325 rules applied. Total rules applied 650 place count 2018 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 651 place count 2017 transition count 1807
Iterating global reduction 0 with 1 rules applied. Total rules applied 652 place count 2017 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 653 place count 2016 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 654 place count 2016 transition count 1806
Applied a total of 654 rules in 990 ms. Remains 2016 /2343 variables (removed 327) and now considering 1806/2133 (removed 327) transitions.
// Phase 1: matrix 1806 rows 2016 cols
[2021-05-16 16:14:32] [INFO ] Computed 331 place invariants in 35 ms
[2021-05-16 16:14:32] [INFO ] Implicit Places using invariants in 790 ms returned []
// Phase 1: matrix 1806 rows 2016 cols
[2021-05-16 16:14:32] [INFO ] Computed 331 place invariants in 10 ms
[2021-05-16 16:14:34] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
// Phase 1: matrix 1806 rows 2016 cols
[2021-05-16 16:14:34] [INFO ] Computed 331 place invariants in 8 ms
[2021-05-16 16:14:35] [INFO ] Dead Transitions using invariants and state equation in 1078 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2016/2343 places, 1806/2133 transitions.
[2021-05-16 16:14:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 16:14:35] [INFO ] Flatten gal took : 150 ms
FORMULA ShieldPPPt-PT-030B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 16:14:35] [INFO ] Flatten gal took : 88 ms
[2021-05-16 16:14:36] [INFO ] Input system was already deterministic with 1806 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 889 ms. (steps per millisecond=112 ) properties (out of 31) seen :28
Running SMT prover for 3 properties.
// Phase 1: matrix 1806 rows 2016 cols
[2021-05-16 16:14:37] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:14:37] [INFO ] [Real]Absence check using 331 positive place invariants in 94 ms returned sat
[2021-05-16 16:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:37] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2021-05-16 16:14:38] [INFO ] Deduced a trap composed of 22 places in 525 ms of which 5 ms to minimize.
[2021-05-16 16:14:39] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2021-05-16 16:14:39] [INFO ] Deduced a trap composed of 30 places in 418 ms of which 2 ms to minimize.
[2021-05-16 16:14:40] [INFO ] Deduced a trap composed of 19 places in 424 ms of which 2 ms to minimize.
[2021-05-16 16:14:40] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 2 ms to minimize.
[2021-05-16 16:14:41] [INFO ] Deduced a trap composed of 16 places in 433 ms of which 1 ms to minimize.
[2021-05-16 16:14:41] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 1 ms to minimize.
[2021-05-16 16:14:41] [INFO ] Deduced a trap composed of 27 places in 358 ms of which 1 ms to minimize.
[2021-05-16 16:14:42] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 1 ms to minimize.
[2021-05-16 16:14:42] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2021-05-16 16:14:43] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
[2021-05-16 16:14:43] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2021-05-16 16:14:43] [INFO ] Deduced a trap composed of 29 places in 314 ms of which 1 ms to minimize.
[2021-05-16 16:14:44] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 0 ms to minimize.
[2021-05-16 16:14:44] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 0 ms to minimize.
[2021-05-16 16:14:45] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 1 ms to minimize.
[2021-05-16 16:14:45] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 1 ms to minimize.
[2021-05-16 16:14:45] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 0 ms to minimize.
[2021-05-16 16:14:46] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 1 ms to minimize.
[2021-05-16 16:14:46] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 0 ms to minimize.
[2021-05-16 16:14:46] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2021-05-16 16:14:47] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 1 ms to minimize.
[2021-05-16 16:14:47] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 1 ms to minimize.
[2021-05-16 16:14:47] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 1 ms to minimize.
[2021-05-16 16:14:48] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 0 ms to minimize.
[2021-05-16 16:14:48] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 1 ms to minimize.
[2021-05-16 16:14:48] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 1 ms to minimize.
[2021-05-16 16:14:49] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2021-05-16 16:14:49] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 0 ms to minimize.
[2021-05-16 16:14:49] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 1 ms to minimize.
[2021-05-16 16:14:50] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2021-05-16 16:14:50] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 0 ms to minimize.
[2021-05-16 16:14:50] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 1 ms to minimize.
[2021-05-16 16:14:50] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 0 ms to minimize.
[2021-05-16 16:14:51] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 1 ms to minimize.
[2021-05-16 16:14:51] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 0 ms to minimize.
[2021-05-16 16:14:51] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 0 ms to minimize.
[2021-05-16 16:14:51] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 1 ms to minimize.
[2021-05-16 16:14:52] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 13966 ms
[2021-05-16 16:14:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:14:52] [INFO ] [Nat]Absence check using 331 positive place invariants in 98 ms returned sat
[2021-05-16 16:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:53] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2021-05-16 16:14:53] [INFO ] Deduced a trap composed of 22 places in 404 ms of which 1 ms to minimize.
[2021-05-16 16:14:53] [INFO ] Deduced a trap composed of 21 places in 392 ms of which 1 ms to minimize.
[2021-05-16 16:14:54] [INFO ] Deduced a trap composed of 30 places in 394 ms of which 8 ms to minimize.
[2021-05-16 16:14:54] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 0 ms to minimize.
[2021-05-16 16:14:55] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 1 ms to minimize.
[2021-05-16 16:14:55] [INFO ] Deduced a trap composed of 16 places in 373 ms of which 1 ms to minimize.
[2021-05-16 16:14:56] [INFO ] Deduced a trap composed of 19 places in 477 ms of which 2 ms to minimize.
[2021-05-16 16:14:56] [INFO ] Deduced a trap composed of 27 places in 338 ms of which 1 ms to minimize.
[2021-05-16 16:14:57] [INFO ] Deduced a trap composed of 29 places in 338 ms of which 1 ms to minimize.
[2021-05-16 16:14:57] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 1 ms to minimize.
[2021-05-16 16:14:57] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 1 ms to minimize.
[2021-05-16 16:14:58] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2021-05-16 16:14:58] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2021-05-16 16:14:59] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2021-05-16 16:14:59] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2021-05-16 16:14:59] [INFO ] Deduced a trap composed of 27 places in 356 ms of which 1 ms to minimize.
[2021-05-16 16:15:00] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 1 ms to minimize.
[2021-05-16 16:15:00] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 3 ms to minimize.
[2021-05-16 16:15:00] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 1 ms to minimize.
[2021-05-16 16:15:01] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 1 ms to minimize.
[2021-05-16 16:15:01] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 1 ms to minimize.
[2021-05-16 16:15:02] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 0 ms to minimize.
[2021-05-16 16:15:02] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 1 ms to minimize.
[2021-05-16 16:15:02] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2021-05-16 16:15:03] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 1 ms to minimize.
[2021-05-16 16:15:03] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 1 ms to minimize.
[2021-05-16 16:15:03] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 1 ms to minimize.
[2021-05-16 16:15:04] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 2 ms to minimize.
[2021-05-16 16:15:04] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 2 ms to minimize.
[2021-05-16 16:15:04] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 8 ms to minimize.
[2021-05-16 16:15:04] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 0 ms to minimize.
[2021-05-16 16:15:05] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 1 ms to minimize.
[2021-05-16 16:15:05] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 1 ms to minimize.
[2021-05-16 16:15:05] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 1 ms to minimize.
[2021-05-16 16:15:06] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 1 ms to minimize.
[2021-05-16 16:15:06] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 1 ms to minimize.
[2021-05-16 16:15:06] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 0 ms to minimize.
[2021-05-16 16:15:06] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 0 ms to minimize.
[2021-05-16 16:15:07] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14036 ms
[2021-05-16 16:15:07] [INFO ] Computed and/alt/rep : 1805/2679/1805 causal constraints (skipped 0 transitions) in 114 ms.
[2021-05-16 16:15:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-16 16:15:12] [INFO ] [Real]Absence check using 331 positive place invariants in 97 ms returned sat
[2021-05-16 16:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:13] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-16 16:15:13] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 1 ms to minimize.
[2021-05-16 16:15:14] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 1 ms to minimize.
[2021-05-16 16:15:14] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 1 ms to minimize.
[2021-05-16 16:15:14] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 1 ms to minimize.
[2021-05-16 16:15:15] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 1 ms to minimize.
[2021-05-16 16:15:15] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
[2021-05-16 16:15:16] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 1 ms to minimize.
[2021-05-16 16:15:16] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2021-05-16 16:15:17] [INFO ] Deduced a trap composed of 32 places in 345 ms of which 1 ms to minimize.
[2021-05-16 16:15:17] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 1 ms to minimize.
[2021-05-16 16:15:17] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 1 ms to minimize.
[2021-05-16 16:15:18] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 1 ms to minimize.
[2021-05-16 16:15:18] [INFO ] Deduced a trap composed of 22 places in 342 ms of which 1 ms to minimize.
[2021-05-16 16:15:19] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 1 ms to minimize.
[2021-05-16 16:15:19] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 1 ms to minimize.
[2021-05-16 16:15:19] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 0 ms to minimize.
[2021-05-16 16:15:20] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 1 ms to minimize.
[2021-05-16 16:15:20] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 1 ms to minimize.
[2021-05-16 16:15:20] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2021-05-16 16:15:21] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 0 ms to minimize.
[2021-05-16 16:15:21] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 0 ms to minimize.
[2021-05-16 16:15:22] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 0 ms to minimize.
[2021-05-16 16:15:22] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 0 ms to minimize.
[2021-05-16 16:15:22] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 1 ms to minimize.
[2021-05-16 16:15:22] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 1 ms to minimize.
[2021-05-16 16:15:23] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 1 ms to minimize.
[2021-05-16 16:15:23] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 0 ms to minimize.
[2021-05-16 16:15:23] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 1 ms to minimize.
[2021-05-16 16:15:24] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 1 ms to minimize.
[2021-05-16 16:15:24] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 0 ms to minimize.
[2021-05-16 16:15:24] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 0 ms to minimize.
[2021-05-16 16:15:25] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 1 ms to minimize.
[2021-05-16 16:15:25] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 1 ms to minimize.
[2021-05-16 16:15:25] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 1 ms to minimize.
[2021-05-16 16:15:25] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 1 ms to minimize.
[2021-05-16 16:15:26] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 1 ms to minimize.
[2021-05-16 16:15:26] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2021-05-16 16:15:26] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 1 ms to minimize.
[2021-05-16 16:15:27] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 1 ms to minimize.
[2021-05-16 16:15:27] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 1 ms to minimize.
[2021-05-16 16:15:27] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2021-05-16 16:15:27] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 1 ms to minimize.
[2021-05-16 16:15:28] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 1 ms to minimize.
[2021-05-16 16:15:28] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 1 ms to minimize.
[2021-05-16 16:15:28] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 1 ms to minimize.
[2021-05-16 16:15:28] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 1 ms to minimize.
[2021-05-16 16:15:28] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 15702 ms
[2021-05-16 16:15:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:15:29] [INFO ] [Nat]Absence check using 331 positive place invariants in 93 ms returned sat
[2021-05-16 16:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:29] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2021-05-16 16:15:30] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2021-05-16 16:15:30] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 1 ms to minimize.
[2021-05-16 16:15:31] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 1 ms to minimize.
[2021-05-16 16:15:31] [INFO ] Deduced a trap composed of 26 places in 388 ms of which 1 ms to minimize.
[2021-05-16 16:15:32] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 1 ms to minimize.
[2021-05-16 16:15:32] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 1 ms to minimize.
[2021-05-16 16:15:32] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 1 ms to minimize.
[2021-05-16 16:15:33] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 1 ms to minimize.
[2021-05-16 16:15:33] [INFO ] Deduced a trap composed of 28 places in 366 ms of which 1 ms to minimize.
[2021-05-16 16:15:34] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 1 ms to minimize.
[2021-05-16 16:15:34] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 1 ms to minimize.
[2021-05-16 16:15:34] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 1 ms to minimize.
[2021-05-16 16:15:35] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 1 ms to minimize.
[2021-05-16 16:15:35] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2021-05-16 16:15:36] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2021-05-16 16:15:36] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 1 ms to minimize.
[2021-05-16 16:15:36] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 0 ms to minimize.
[2021-05-16 16:15:37] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 1 ms to minimize.
[2021-05-16 16:15:37] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 0 ms to minimize.
[2021-05-16 16:15:37] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 1 ms to minimize.
[2021-05-16 16:15:38] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2021-05-16 16:15:38] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 1 ms to minimize.
[2021-05-16 16:15:38] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 1 ms to minimize.
[2021-05-16 16:15:39] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 1 ms to minimize.
[2021-05-16 16:15:39] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2021-05-16 16:15:39] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 1 ms to minimize.
[2021-05-16 16:15:40] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 1 ms to minimize.
[2021-05-16 16:15:40] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 1 ms to minimize.
[2021-05-16 16:15:40] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2021-05-16 16:15:40] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 0 ms to minimize.
[2021-05-16 16:15:41] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2021-05-16 16:15:41] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2021-05-16 16:15:41] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 0 ms to minimize.
[2021-05-16 16:15:42] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 1 ms to minimize.
[2021-05-16 16:15:42] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 0 ms to minimize.
[2021-05-16 16:15:42] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 0 ms to minimize.
[2021-05-16 16:15:42] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 0 ms to minimize.
[2021-05-16 16:15:43] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 0 ms to minimize.
[2021-05-16 16:15:43] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 0 ms to minimize.
[2021-05-16 16:15:43] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 1 ms to minimize.
[2021-05-16 16:15:43] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 1 ms to minimize.
[2021-05-16 16:15:44] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 1 ms to minimize.
[2021-05-16 16:15:44] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2021-05-16 16:15:44] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 0 ms to minimize.
[2021-05-16 16:15:44] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 1 ms to minimize.
[2021-05-16 16:15:45] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 1 ms to minimize.
[2021-05-16 16:15:45] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 15393 ms
[2021-05-16 16:15:45] [INFO ] Computed and/alt/rep : 1805/2679/1805 causal constraints (skipped 0 transitions) in 94 ms.
[2021-05-16 16:15:49] [INFO ] Deduced a trap composed of 16 places in 824 ms of which 2 ms to minimize.
[2021-05-16 16:15:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-16 16:15:50] [INFO ] [Real]Absence check using 331 positive place invariants in 91 ms returned sat
[2021-05-16 16:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:50] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2021-05-16 16:15:51] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 1 ms to minimize.
[2021-05-16 16:15:51] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 1 ms to minimize.
[2021-05-16 16:15:51] [INFO ] Deduced a trap composed of 32 places in 352 ms of which 1 ms to minimize.
[2021-05-16 16:15:52] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 1 ms to minimize.
[2021-05-16 16:15:52] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 1 ms to minimize.
[2021-05-16 16:15:53] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 1 ms to minimize.
[2021-05-16 16:15:53] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 1 ms to minimize.
[2021-05-16 16:15:53] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 1 ms to minimize.
[2021-05-16 16:15:54] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 1 ms to minimize.
[2021-05-16 16:15:54] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 1 ms to minimize.
[2021-05-16 16:15:55] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 1 ms to minimize.
[2021-05-16 16:15:55] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2021-05-16 16:15:55] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 1 ms to minimize.
[2021-05-16 16:15:56] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2021-05-16 16:15:56] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 1 ms to minimize.
[2021-05-16 16:15:56] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 1 ms to minimize.
[2021-05-16 16:15:57] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 1 ms to minimize.
[2021-05-16 16:15:57] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 1 ms to minimize.
[2021-05-16 16:15:57] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 1 ms to minimize.
[2021-05-16 16:15:58] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 0 ms to minimize.
[2021-05-16 16:15:58] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 1 ms to minimize.
[2021-05-16 16:15:58] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2021-05-16 16:15:59] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 0 ms to minimize.
[2021-05-16 16:15:59] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2021-05-16 16:15:59] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
[2021-05-16 16:15:59] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 0 ms to minimize.
[2021-05-16 16:16:00] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 1 ms to minimize.
[2021-05-16 16:16:00] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 1 ms to minimize.
[2021-05-16 16:16:00] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 0 ms to minimize.
[2021-05-16 16:16:01] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2021-05-16 16:16:01] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2021-05-16 16:16:01] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 0 ms to minimize.
[2021-05-16 16:16:01] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 0 ms to minimize.
[2021-05-16 16:16:02] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 0 ms to minimize.
[2021-05-16 16:16:02] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 0 ms to minimize.
[2021-05-16 16:16:02] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 0 ms to minimize.
[2021-05-16 16:16:02] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2021-05-16 16:16:03] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 1 ms to minimize.
[2021-05-16 16:16:03] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 1 ms to minimize.
[2021-05-16 16:16:03] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 0 ms to minimize.
[2021-05-16 16:16:03] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 0 ms to minimize.
[2021-05-16 16:16:04] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2021-05-16 16:16:04] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2021-05-16 16:16:04] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 0 ms to minimize.
[2021-05-16 16:16:04] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2021-05-16 16:16:05] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2021-05-16 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 14375 ms
[2021-05-16 16:16:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:16:05] [INFO ] [Nat]Absence check using 331 positive place invariants in 92 ms returned sat
[2021-05-16 16:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:16:06] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2021-05-16 16:16:06] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 1 ms to minimize.
[2021-05-16 16:16:06] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 1 ms to minimize.
[2021-05-16 16:16:07] [INFO ] Deduced a trap composed of 32 places in 357 ms of which 1 ms to minimize.
[2021-05-16 16:16:07] [INFO ] Deduced a trap composed of 26 places in 350 ms of which 1 ms to minimize.
[2021-05-16 16:16:08] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 1 ms to minimize.
[2021-05-16 16:16:08] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 1 ms to minimize.
[2021-05-16 16:16:08] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 0 ms to minimize.
[2021-05-16 16:16:09] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2021-05-16 16:16:09] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 0 ms to minimize.
[2021-05-16 16:16:09] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 1 ms to minimize.
[2021-05-16 16:16:10] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 1 ms to minimize.
[2021-05-16 16:16:10] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 1 ms to minimize.
[2021-05-16 16:16:11] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2021-05-16 16:16:11] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 0 ms to minimize.
[2021-05-16 16:16:11] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 1 ms to minimize.
[2021-05-16 16:16:12] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 1 ms to minimize.
[2021-05-16 16:16:12] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 1 ms to minimize.
[2021-05-16 16:16:12] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 1 ms to minimize.
[2021-05-16 16:16:13] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 1 ms to minimize.
[2021-05-16 16:16:13] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 1 ms to minimize.
[2021-05-16 16:16:13] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 0 ms to minimize.
[2021-05-16 16:16:14] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 1 ms to minimize.
[2021-05-16 16:16:14] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 1 ms to minimize.
[2021-05-16 16:16:14] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2021-05-16 16:16:14] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 0 ms to minimize.
[2021-05-16 16:16:15] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 0 ms to minimize.
[2021-05-16 16:16:15] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 1 ms to minimize.
[2021-05-16 16:16:15] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 1 ms to minimize.
[2021-05-16 16:16:16] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 1 ms to minimize.
[2021-05-16 16:16:16] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2021-05-16 16:16:16] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2021-05-16 16:16:16] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 1 ms to minimize.
[2021-05-16 16:16:17] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2021-05-16 16:16:17] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 1 ms to minimize.
[2021-05-16 16:16:17] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2021-05-16 16:16:17] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 0 ms to minimize.
[2021-05-16 16:16:18] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2021-05-16 16:16:18] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2021-05-16 16:16:18] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 1 ms to minimize.
[2021-05-16 16:16:18] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 1 ms to minimize.
[2021-05-16 16:16:19] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2021-05-16 16:16:19] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 1 ms to minimize.
[2021-05-16 16:16:19] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2021-05-16 16:16:19] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2021-05-16 16:16:20] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 1 ms to minimize.
[2021-05-16 16:16:20] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2021-05-16 16:16:20] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 0 ms to minimize.
[2021-05-16 16:16:20] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 14523 ms
[2021-05-16 16:16:20] [INFO ] Computed and/alt/rep : 1805/2679/1805 causal constraints (skipped 0 transitions) in 93 ms.
[2021-05-16 16:16:25] [INFO ] Deduced a trap composed of 16 places in 841 ms of which 3 ms to minimize.
[2021-05-16 16:16:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p1)||p0) U (p2 U p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2011 transition count 1801
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2011 transition count 1801
Applied a total of 10 rules in 173 ms. Remains 2011 /2016 variables (removed 5) and now considering 1801/1806 (removed 5) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:16:26] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:16:26] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:16:26] [INFO ] Computed 331 place invariants in 6 ms
[2021-05-16 16:16:28] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:16:28] [INFO ] Computed 331 place invariants in 5 ms
[2021-05-16 16:16:29] [INFO ] Dead Transitions using invariants and state equation in 994 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2011/2016 places, 1801/1806 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p3), (NOT p3), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-030B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s1241 1), p0:(OR (EQ s1798 1) (EQ s1030 1)), p1:(NEQ s874 1), p2:(EQ s1798 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 254 steps with 0 reset in 5 ms.
FORMULA ShieldPPPt-PT-030B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-00 finished in 3822 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2015 transition count 1385
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1595 transition count 1385
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 840 place count 1595 transition count 1149
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1312 place count 1359 transition count 1149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1315 place count 1356 transition count 1146
Iterating global reduction 2 with 3 rules applied. Total rules applied 1318 place count 1356 transition count 1146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1318 place count 1356 transition count 1144
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1322 place count 1354 transition count 1144
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 2 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2342 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2343 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2345 place count 843 transition count 632
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2519 place count 756 transition count 632
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2520 place count 755 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2521 place count 754 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2521 place count 754 transition count 629
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2525 place count 752 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2526 place count 751 transition count 628
Applied a total of 2526 rules in 454 ms. Remains 751 /2016 variables (removed 1265) and now considering 628/1806 (removed 1178) transitions.
// Phase 1: matrix 628 rows 751 cols
[2021-05-16 16:16:30] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 16:16:30] [INFO ] Implicit Places using invariants in 384 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 386 ms to find 2 implicit places.
[2021-05-16 16:16:30] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 628 rows 749 cols
[2021-05-16 16:16:30] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:16:31] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Starting structural reductions, iteration 1 : 749/2016 places, 628/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 626
Applied a total of 4 rules in 39 ms. Remains 747 /749 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 747 cols
[2021-05-16 16:16:31] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:16:31] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 626 rows 747 cols
[2021-05-16 16:16:31] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:16:32] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 747/2016 places, 626/1806 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s472 1), p0:(NEQ s703 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 651 ms.
Product exploration explored 100000 steps with 4 reset in 795 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 577 ms.
Product exploration explored 100000 steps with 4 reset in 719 ms.
[2021-05-16 16:16:35] [INFO ] Flatten gal took : 29 ms
[2021-05-16 16:16:35] [INFO ] Flatten gal took : 27 ms
[2021-05-16 16:16:35] [INFO ] Time to serialize gal into /tmp/LTL18418937243582301136.gal : 29 ms
[2021-05-16 16:16:35] [INFO ] Time to serialize properties into /tmp/LTL8056365479562231675.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18418937243582301136.gal, -t, CGAL, -LTL, /tmp/LTL8056365479562231675.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18418937243582301136.gal -t CGAL -LTL /tmp/LTL8056365479562231675.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p2171!=1)")))||(G("(p1458!=1)")))))
Formula 0 simplified : !F(GF"(p2171!=1)" | G"(p1458!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.2367e+49 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1058 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6587,321692,1,0,198,1.94936e+06,34,196,18460,1.55884e+06,468
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-030B-01 finished in 17943 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2015 transition count 1387
Reduce places removed 418 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 421 rules applied. Total rules applied 839 place count 1597 transition count 1384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 842 place count 1594 transition count 1384
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 842 place count 1594 transition count 1147
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1316 place count 1357 transition count 1147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1319 place count 1354 transition count 1144
Iterating global reduction 3 with 3 rules applied. Total rules applied 1322 place count 1354 transition count 1144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1322 place count 1354 transition count 1142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1326 place count 1352 transition count 1142
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2340 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2341 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2343 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2519 place count 756 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2520 place count 755 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2521 place count 754 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2521 place count 754 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2525 place count 752 transition count 630
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2526 place count 751 transition count 629
Applied a total of 2526 rules in 295 ms. Remains 751 /2016 variables (removed 1265) and now considering 629/1806 (removed 1177) transitions.
// Phase 1: matrix 629 rows 751 cols
[2021-05-16 16:16:48] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 16:16:48] [INFO ] Implicit Places using invariants in 649 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 650 ms to find 2 implicit places.
[2021-05-16 16:16:48] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 629 rows 749 cols
[2021-05-16 16:16:48] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:16:49] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Starting structural reductions, iteration 1 : 749/2016 places, 629/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 627
Applied a total of 4 rules in 26 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2021-05-16 16:16:49] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:16:49] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 627 rows 747 cols
[2021-05-16 16:16:49] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:16:49] [INFO ] State equation strengthened by 84 read => feed constraints.
[2021-05-16 16:16:50] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 747/2016 places, 627/1806 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s653 0), p1:(OR (NEQ s278 0) (NEQ s132 1) (NEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 756 reset in 615 ms.
Product exploration explored 100000 steps with 753 reset in 722 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 736 reset in 600 ms.
Product exploration explored 100000 steps with 778 reset in 719 ms.
[2021-05-16 16:16:53] [INFO ] Flatten gal took : 29 ms
[2021-05-16 16:16:53] [INFO ] Flatten gal took : 29 ms
[2021-05-16 16:16:53] [INFO ] Time to serialize gal into /tmp/LTL17997458080655096674.gal : 4 ms
[2021-05-16 16:16:53] [INFO ] Time to serialize properties into /tmp/LTL3640617162327503419.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17997458080655096674.gal, -t, CGAL, -LTL, /tmp/LTL3640617162327503419.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17997458080655096674.gal -t CGAL -LTL /tmp/LTL3640617162327503419.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p2018!=0)"))||(G("(((p880!=0)||(p433!=1))||(p435!=1))"))))
Formula 0 simplified : !(F"(p2018!=0)" | G"(((p880!=0)||(p433!=1))||(p435!=1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t36, t123, t482, t488, t493, t498, t503, t508, t513, t518, t523, t528, t533, t540, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/581/46/627
Computing Next relation with stutter on 1.2367e+49 deadlock states
Detected timeout of ITS tools.
[2021-05-16 16:17:08] [INFO ] Flatten gal took : 25 ms
[2021-05-16 16:17:08] [INFO ] Applying decomposition
[2021-05-16 16:17:08] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7537311304278357569.txt, -o, /tmp/graph7537311304278357569.bin, -w, /tmp/graph7537311304278357569.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7537311304278357569.bin, -l, -1, -v, -w, /tmp/graph7537311304278357569.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:17:08] [INFO ] Decomposing Gal with order
[2021-05-16 16:17:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:17:08] [INFO ] Removed a total of 185 redundant transitions.
[2021-05-16 16:17:08] [INFO ] Flatten gal took : 80 ms
[2021-05-16 16:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 14 ms.
[2021-05-16 16:17:08] [INFO ] Time to serialize gal into /tmp/LTL7445872048728859702.gal : 10 ms
[2021-05-16 16:17:08] [INFO ] Time to serialize properties into /tmp/LTL17301706607461294864.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7445872048728859702.gal, -t, CGAL, -LTL, /tmp/LTL17301706607461294864.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7445872048728859702.gal -t CGAL -LTL /tmp/LTL17301706607461294864.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i25.u208.p2018!=0)"))||(G("(((i11.u90.p880!=0)||(i5.u43.p433!=1))||(i5.u44.p435!=1))"))))
Formula 0 simplified : !(F"(i25.u208.p2018!=0)" | G"(((i11.u90.p880!=0)||(i5.u43.p433!=1))||(i5.u44.p435!=1))")
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.t1, i0.t0, i0.u1.t482, i1.t5, i1.t4, i1.t3, i1.u10.t488, i2.t8, i2.t7, i2.t6, i2.u18.t493, i3.t11, i3.t10, i3.t9, i3.u26.t498, i4.t14, i4.t13, i4.t12, i4.u34.t503, i5.t123, i5.t16, i5.t15, i5.u42.t508, i6.t19, i6.t18, i6.t17, i6.u50.t513, i7.t22, i7.t21, i7.t20, i7.u58.t518, i8.t25, i8.t24, i8.t23, i8.u66.t523, i9.t28, i9.t27, i9.t26, i9.u74.t528, i10.t31, i10.t30, i10.t29, i10.u82.t533, i11.t540, i12.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/461/46/507
Computing Next relation with stutter on 1.2367e+49 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
105 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.13428,46636,1,0,64473,899,5443,121475,584,4014,49491
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-030B-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-030B-02 finished in 22293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2015 transition count 1384
Reduce places removed 421 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 422 rules applied. Total rules applied 843 place count 1594 transition count 1383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 844 place count 1593 transition count 1383
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 236 Pre rules applied. Total rules applied 844 place count 1593 transition count 1147
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 1316 place count 1357 transition count 1147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1319 place count 1354 transition count 1144
Iterating global reduction 3 with 3 rules applied. Total rules applied 1322 place count 1354 transition count 1144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1322 place count 1354 transition count 1142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1326 place count 1352 transition count 1142
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2342 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2343 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2345 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2523 place count 754 transition count 632
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2524 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2525 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2525 place count 752 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2529 place count 750 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2530 place count 749 transition count 628
Applied a total of 2530 rules in 261 ms. Remains 749 /2016 variables (removed 1267) and now considering 628/1806 (removed 1178) transitions.
// Phase 1: matrix 628 rows 749 cols
[2021-05-16 16:17:10] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:17:10] [INFO ] Implicit Places using invariants in 421 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 422 ms to find 2 implicit places.
[2021-05-16 16:17:10] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 628 rows 747 cols
[2021-05-16 16:17:10] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:17:11] [INFO ] Dead Transitions using invariants and state equation in 381 ms returned []
Starting structural reductions, iteration 1 : 747/2016 places, 628/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 21 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2021-05-16 16:17:11] [INFO ] Computed 328 place invariants in 6 ms
[2021-05-16 16:17:11] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 626 rows 745 cols
[2021-05-16 16:17:11] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:12] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 745/2016 places, 626/1806 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-03 automaton TGBA [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:(EQ s423 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 9 reset in 580 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 1 ms.
FORMULA ShieldPPPt-PT-030B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-03 finished in 2808 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2011 transition count 1801
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2011 transition count 1801
Applied a total of 10 rules in 175 ms. Remains 2011 /2016 variables (removed 5) and now considering 1801/1806 (removed 5) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:17:13] [INFO ] Computed 331 place invariants in 12 ms
[2021-05-16 16:17:13] [INFO ] Implicit Places using invariants in 582 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:17:13] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:15] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:17:15] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:16] [INFO ] Dead Transitions using invariants and state equation in 1001 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2011/2016 places, 1801/1806 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (NEQ s755 1) (NEQ s928 1)), p2:(AND (EQ s1447 1) (EQ s1484 1)), p0:(EQ s702 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 602 ms.
Product exploration explored 100000 steps with 0 reset in 770 ms.
Knowledge obtained : [p1, (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 604 ms.
Stack based approach found an accepted trace after 1833 steps with 0 reset with depth 1834 and stack size 1834 in 14 ms.
FORMULA ShieldPPPt-PT-030B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-04 finished in 5659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((p1 U ((p1&&G(p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2015 transition count 1388
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1598 transition count 1388
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 834 place count 1598 transition count 1152
Deduced a syphon composed of 236 places in 2 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1306 place count 1362 transition count 1152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1308 place count 1360 transition count 1150
Iterating global reduction 2 with 2 rules applied. Total rules applied 1310 place count 1360 transition count 1150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1310 place count 1360 transition count 1148
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1314 place count 1358 transition count 1148
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2334 place count 848 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2335 place count 848 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2337 place count 847 transition count 636
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2513 place count 759 transition count 636
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2514 place count 758 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2515 place count 757 transition count 635
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2515 place count 757 transition count 633
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2519 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2520 place count 754 transition count 632
Applied a total of 2520 rules in 270 ms. Remains 754 /2016 variables (removed 1262) and now considering 632/1806 (removed 1174) transitions.
// Phase 1: matrix 632 rows 754 cols
[2021-05-16 16:17:18] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 16:17:19] [INFO ] Implicit Places using invariants in 416 ms returned [737, 741]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 417 ms to find 2 implicit places.
[2021-05-16 16:17:19] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 632 rows 752 cols
[2021-05-16 16:17:19] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:19] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Starting structural reductions, iteration 1 : 752/2016 places, 632/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 750 transition count 630
Applied a total of 4 rules in 21 ms. Remains 750 /752 variables (removed 2) and now considering 630/632 (removed 2) transitions.
// Phase 1: matrix 630 rows 750 cols
[2021-05-16 16:17:19] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:19] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 630 rows 750 cols
[2021-05-16 16:17:19] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 16:17:20] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 750/2016 places, 630/1806 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (NEQ s709 1) (NEQ s729 1)), p1:(OR (NEQ s624 1) (NEQ s640 1)), p0:(AND (EQ s176 1) (EQ s26 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA ShieldPPPt-PT-030B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-05 finished in 2741 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2015 transition count 1383
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1593 transition count 1383
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 844 place count 1593 transition count 1146
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1318 place count 1356 transition count 1146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1320 place count 1354 transition count 1144
Iterating global reduction 2 with 2 rules applied. Total rules applied 1322 place count 1354 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1322 place count 1354 transition count 1143
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1324 place count 1353 transition count 1143
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2344 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2525 place count 753 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2526 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2527 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2527 place count 751 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2531 place count 749 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2532 place count 748 transition count 627
Applied a total of 2532 rules in 234 ms. Remains 748 /2016 variables (removed 1268) and now considering 627/1806 (removed 1179) transitions.
// Phase 1: matrix 627 rows 748 cols
[2021-05-16 16:17:21] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:17:21] [INFO ] Implicit Places using invariants in 366 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 369 ms to find 2 implicit places.
[2021-05-16 16:17:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 627 rows 746 cols
[2021-05-16 16:17:21] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:22] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Starting structural reductions, iteration 1 : 746/2016 places, 627/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 21 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2021-05-16 16:17:22] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:22] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 625 rows 744 cols
[2021-05-16 16:17:22] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:17:23] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 744/2016 places, 625/1806 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s150 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 587 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-030B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-07 finished in 2560 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0||((p1 U p2)&&F(p3))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2012 transition count 1802
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2012 transition count 1802
Applied a total of 8 rules in 166 ms. Remains 2012 /2016 variables (removed 4) and now considering 1802/1806 (removed 4) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:17:24] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:24] [INFO ] Implicit Places using invariants in 575 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:17:24] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:26] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:17:26] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:27] [INFO ] Dead Transitions using invariants and state equation in 1004 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2012/2016 places, 1802/1806 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-030B-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s886 0), p2:(OR (AND (EQ s841 1) (EQ s881 1)) (AND (EQ s1384 1) (EQ s1410 1))), p1:(AND (EQ s1384 1) (EQ s1410 1)), p3:(EQ s886 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 0 reset in 624 ms.
Entered a terminal (fully accepting) state of product in 46877 steps with 0 reset in 358 ms.
FORMULA ShieldPPPt-PT-030B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-08 finished in 4445 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2012 transition count 1802
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2012 transition count 1802
Applied a total of 8 rules in 161 ms. Remains 2012 /2016 variables (removed 4) and now considering 1802/1806 (removed 4) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:17:28] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:29] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:17:29] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:30] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2021-05-16 16:17:30] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:31] [INFO ] Dead Transitions using invariants and state equation in 987 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2012/2016 places, 1802/1806 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1384 1) (EQ s1410 1)), p0:(OR (EQ s1607 1) (AND (EQ s1465 0) (EQ s93 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17 reset in 574 ms.
Stack based approach found an accepted trace after 5808 steps with 1 reset with depth 2558 and stack size 2558 in 42 ms.
FORMULA ShieldPPPt-PT-030B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-09 finished in 3940 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&(F(G(p1)) U (p2||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2011 transition count 1801
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2011 transition count 1801
Applied a total of 10 rules in 162 ms. Remains 2011 /2016 variables (removed 5) and now considering 1801/1806 (removed 5) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:17:32] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:32] [INFO ] Implicit Places using invariants in 576 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:17:32] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:17:34] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:17:34] [INFO ] Computed 331 place invariants in 3 ms
[2021-05-16 16:17:35] [INFO ] Dead Transitions using invariants and state equation in 980 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2011/2016 places, 1801/1806 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s712 1), p0:(AND (EQ s1433 1) (EQ s1458 1)), p1:(NEQ s828 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 589 ms.
Product exploration explored 100000 steps with 0 reset in 756 ms.
Knowledge obtained : [(NOT p2), (NOT p0), p1]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 605 ms.
Product exploration explored 100000 steps with 0 reset in 803 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 2011 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2011 transition count 1801
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 149 Pre rules applied. Total rules applied 419 place count 2011 transition count 1920
Deduced a syphon composed of 568 places in 2 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 568 place count 2011 transition count 1920
Performed 567 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1135 places in 2 ms
Iterating global reduction 1 with 567 rules applied. Total rules applied 1135 place count 2011 transition count 1920
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1136 place count 2011 transition count 1919
Renaming transitions due to excessive name length > 1024 char.
Discarding 212 places :
Symmetric choice reduction at 2 with 212 rule applications. Total rules 1348 place count 1799 transition count 1707
Deduced a syphon composed of 923 places in 2 ms
Iterating global reduction 2 with 212 rules applied. Total rules applied 1560 place count 1799 transition count 1707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 924 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1561 place count 1799 transition count 1707
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1563 place count 1797 transition count 1705
Deduced a syphon composed of 922 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1565 place count 1797 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1023 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1666 place count 1797 transition count 2133
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1767 place count 1696 transition count 1931
Deduced a syphon composed of 922 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1868 place count 1696 transition count 1931
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 940 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1886 place count 1696 transition count 2006
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1904 place count 1678 transition count 1970
Deduced a syphon composed of 922 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1922 place count 1678 transition count 1970
Deduced a syphon composed of 922 places in 1 ms
Applied a total of 1922 rules in 1419 ms. Remains 1678 /2011 variables (removed 333) and now considering 1970/1801 (removed -169) transitions.
[2021-05-16 16:17:40] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1970 rows 1678 cols
[2021-05-16 16:17:40] [INFO ] Computed 331 place invariants in 10 ms
[2021-05-16 16:17:41] [INFO ] Dead Transitions using invariants and state equation in 1044 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1678/2011 places, 1970/1801 transitions.
Product exploration explored 100000 steps with 0 reset in 753 ms.
Product exploration explored 100000 steps with 0 reset in 855 ms.
[2021-05-16 16:17:42] [INFO ] Flatten gal took : 52 ms
[2021-05-16 16:17:43] [INFO ] Flatten gal took : 51 ms
[2021-05-16 16:17:43] [INFO ] Time to serialize gal into /tmp/LTL8431741871445071504.gal : 7 ms
[2021-05-16 16:17:43] [INFO ] Time to serialize properties into /tmp/LTL16517978835448441105.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8431741871445071504.gal, -t, CGAL, -LTL, /tmp/LTL16517978835448441105.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8431741871445071504.gal -t CGAL -LTL /tmp/LTL16517978835448441105.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("((p1664==1)&&(p1691==1))")))&&((F(G("(p960!=1)")))U(("(p822==1)")||(G("((p1664==1)&&(p1691==1))"))))))
Formula 0 simplified : !(XF"((p1664==1)&&(p1691==1))" & (FG"(p960!=1)" U ("(p822==1)" | G"((p1664==1)&&(p1691==1))")))
Detected timeout of ITS tools.
[2021-05-16 16:17:58] [INFO ] Flatten gal took : 49 ms
[2021-05-16 16:17:58] [INFO ] Applying decomposition
[2021-05-16 16:17:58] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph554024303464922945.txt, -o, /tmp/graph554024303464922945.bin, -w, /tmp/graph554024303464922945.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph554024303464922945.bin, -l, -1, -v, -w, /tmp/graph554024303464922945.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:17:58] [INFO ] Decomposing Gal with order
[2021-05-16 16:17:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:17:58] [INFO ] Removed a total of 300 redundant transitions.
[2021-05-16 16:17:58] [INFO ] Flatten gal took : 103 ms
[2021-05-16 16:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-16 16:17:58] [INFO ] Time to serialize gal into /tmp/LTL9369796587958877041.gal : 14 ms
[2021-05-16 16:17:58] [INFO ] Time to serialize properties into /tmp/LTL3348061138583101692.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9369796587958877041.gal, -t, CGAL, -LTL, /tmp/LTL3348061138583101692.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9369796587958877041.gal -t CGAL -LTL /tmp/LTL3348061138583101692.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i21.u511.p1664==1)&&(i21.u517.p1691==1))")))&&((F(G("(i12.i0.i0.u295.p960!=1)")))U(("(i10.u254.p822==1)")||(G("((i21.u511.p1664==1)&&(i21.u517.p1691==1))"))))))
Formula 0 simplified : !(XF"((i21.u511.p1664==1)&&(i21.u517.p1691==1))" & (FG"(i12.i0.i0.u295.p960!=1)" U ("(i10.u254.p822==1)" | G"((i21.u511.p1664==1)&&(i21.u517.p1691==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13697000462560722445
[2021-05-16 16:18:13] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13697000462560722445
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13697000462560722445]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13697000462560722445] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13697000462560722445] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-030B-10 finished in 42499 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2015 transition count 1384
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1594 transition count 1384
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 842 place count 1594 transition count 1147
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1316 place count 1357 transition count 1147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1319 place count 1354 transition count 1144
Iterating global reduction 2 with 3 rules applied. Total rules applied 1322 place count 1354 transition count 1144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1322 place count 1354 transition count 1142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1326 place count 1352 transition count 1142
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2344 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 842 transition count 631
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2523 place count 754 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2524 place count 753 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2525 place count 752 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2525 place count 752 transition count 628
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2529 place count 750 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2530 place count 749 transition count 627
Applied a total of 2530 rules in 276 ms. Remains 749 /2016 variables (removed 1267) and now considering 627/1806 (removed 1179) transitions.
// Phase 1: matrix 627 rows 749 cols
[2021-05-16 16:18:15] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:18:15] [INFO ] Implicit Places using invariants in 424 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 426 ms to find 2 implicit places.
[2021-05-16 16:18:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 627 rows 747 cols
[2021-05-16 16:18:15] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:15] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Starting structural reductions, iteration 1 : 747/2016 places, 627/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 625
Applied a total of 4 rules in 47 ms. Remains 745 /747 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 745 cols
[2021-05-16 16:18:15] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:16] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 625 rows 745 cols
[2021-05-16 16:18:16] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:16] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 745/2016 places, 625/1806 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s545 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24 reset in 581 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-030B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-11 finished in 2724 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2015 transition count 1384
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1594 transition count 1384
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 842 place count 1594 transition count 1147
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1316 place count 1357 transition count 1147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1319 place count 1354 transition count 1144
Iterating global reduction 2 with 3 rules applied. Total rules applied 1322 place count 1354 transition count 1144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1322 place count 1354 transition count 1142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1326 place count 1352 transition count 1142
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2344 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 842 transition count 631
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2523 place count 754 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2524 place count 753 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2525 place count 752 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2525 place count 752 transition count 628
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2529 place count 750 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2530 place count 749 transition count 627
Applied a total of 2530 rules in 264 ms. Remains 749 /2016 variables (removed 1267) and now considering 627/1806 (removed 1179) transitions.
// Phase 1: matrix 627 rows 749 cols
[2021-05-16 16:18:17] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:18:18] [INFO ] Implicit Places using invariants in 363 ms returned [730, 734]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 365 ms to find 2 implicit places.
[2021-05-16 16:18:18] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 627 rows 747 cols
[2021-05-16 16:18:18] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:18] [INFO ] Dead Transitions using invariants and state equation in 323 ms returned []
Starting structural reductions, iteration 1 : 747/2016 places, 627/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 625
Applied a total of 4 rules in 34 ms. Remains 745 /747 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 745 cols
[2021-05-16 16:18:18] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:18] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 625 rows 745 cols
[2021-05-16 16:18:18] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:19] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 745/2016 places, 625/1806 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s742 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10493 reset in 584 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-030B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-12 finished in 2743 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2011 transition count 1801
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2011 transition count 1801
Applied a total of 10 rules in 164 ms. Remains 2011 /2016 variables (removed 5) and now considering 1801/1806 (removed 5) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:18:20] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:18:21] [INFO ] Implicit Places using invariants in 666 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:18:21] [INFO ] Computed 331 place invariants in 4 ms
[2021-05-16 16:18:22] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2021-05-16 16:18:22] [INFO ] Computed 331 place invariants in 5 ms
[2021-05-16 16:18:23] [INFO ] Dead Transitions using invariants and state equation in 1021 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2011/2016 places, 1801/1806 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-13 automaton TGBA [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 s584 1) (EQ s626 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-030B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-13 finished in 3534 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2015 transition count 1383
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1593 transition count 1383
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 844 place count 1593 transition count 1146
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1318 place count 1356 transition count 1146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1321 place count 1353 transition count 1143
Iterating global reduction 2 with 3 rules applied. Total rules applied 1324 place count 1353 transition count 1143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1324 place count 1353 transition count 1141
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1328 place count 1351 transition count 1141
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2344 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2525 place count 753 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2526 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2527 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2527 place count 751 transition count 628
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2531 place count 749 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2532 place count 748 transition count 627
Applied a total of 2532 rules in 302 ms. Remains 748 /2016 variables (removed 1268) and now considering 627/1806 (removed 1179) transitions.
// Phase 1: matrix 627 rows 748 cols
[2021-05-16 16:18:24] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:18:24] [INFO ] Implicit Places using invariants in 424 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 426 ms to find 2 implicit places.
[2021-05-16 16:18:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 627 rows 746 cols
[2021-05-16 16:18:24] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:24] [INFO ] Dead Transitions using invariants and state equation in 359 ms returned []
Starting structural reductions, iteration 1 : 746/2016 places, 627/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 23 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2021-05-16 16:18:24] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:18:25] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 625 rows 744 cols
[2021-05-16 16:18:25] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:25] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 744/2016 places, 625/1806 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s535 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 590 ms.
Stack based approach found an accepted trace after 1747 steps with 0 reset with depth 1748 and stack size 1709 in 14 ms.
FORMULA ShieldPPPt-PT-030B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-14 finished in 2884 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||G(F(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2016/2016 places, 1806/1806 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2015 transition count 1383
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1593 transition count 1383
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 844 place count 1593 transition count 1148
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1314 place count 1358 transition count 1148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1317 place count 1355 transition count 1145
Iterating global reduction 2 with 3 rules applied. Total rules applied 1320 place count 1355 transition count 1145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1320 place count 1355 transition count 1143
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1324 place count 1353 transition count 1143
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2338 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2339 place count 846 transition count 635
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2341 place count 845 transition count 634
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2519 place count 756 transition count 634
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2520 place count 755 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2521 place count 754 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2521 place count 754 transition count 631
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2525 place count 752 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2526 place count 751 transition count 630
Applied a total of 2526 rules in 318 ms. Remains 751 /2016 variables (removed 1265) and now considering 630/1806 (removed 1176) transitions.
// Phase 1: matrix 630 rows 751 cols
[2021-05-16 16:18:26] [INFO ] Computed 330 place invariants in 1 ms
[2021-05-16 16:18:27] [INFO ] Implicit Places using invariants in 410 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 411 ms to find 2 implicit places.
[2021-05-16 16:18:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 630 rows 749 cols
[2021-05-16 16:18:27] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:27] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Starting structural reductions, iteration 1 : 749/2016 places, 630/1806 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 21 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2021-05-16 16:18:27] [INFO ] Computed 328 place invariants in 1 ms
[2021-05-16 16:18:28] [INFO ] Implicit Places using invariants in 417 ms returned []
// Phase 1: matrix 628 rows 747 cols
[2021-05-16 16:18:28] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:18:28] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 747/2016 places, 628/1806 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s588 1) (EQ s599 1)), p0:(EQ s406 1), p2:(NEQ s73 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 584 ms.
Product exploration explored 100000 steps with 0 reset in 801 ms.
Knowledge obtained : [(NOT p1), (NOT p0), p2]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 619 ms.
Product exploration explored 100000 steps with 0 reset in 775 ms.
[2021-05-16 16:18:31] [INFO ] Flatten gal took : 18 ms
[2021-05-16 16:18:31] [INFO ] Flatten gal took : 20 ms
[2021-05-16 16:18:31] [INFO ] Time to serialize gal into /tmp/LTL9578346341098332227.gal : 3 ms
[2021-05-16 16:18:31] [INFO ] Time to serialize properties into /tmp/LTL3822946687859240416.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9578346341098332227.gal, -t, CGAL, -LTL, /tmp/LTL3822946687859240416.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9578346341098332227.gal -t CGAL -LTL /tmp/LTL3822946687859240416.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(p1278==1)")U("((p1825==1)&&(p1845==1))"))||(G(F("(p237!=1)")))))
Formula 0 simplified : !(("(p1278==1)" U "((p1825==1)&&(p1845==1))") | GF"(p237!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.2367e+49 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
653 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.59174,186512,1,0,9,1.18365e+06,43,6,18494,279912,32
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-030B-15 finished in 12647 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9402640538326649736
[2021-05-16 16:18:39] [INFO ] Too many transitions (1806) to apply POR reductions. Disabling POR matrices.
[2021-05-16 16:18:39] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9402640538326649736
[2021-05-16 16:18:39] [INFO ] Applying decomposition
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9402640538326649736]
[2021-05-16 16:18:39] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12104113454633571063.txt, -o, /tmp/graph12104113454633571063.bin, -w, /tmp/graph12104113454633571063.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12104113454633571063.bin, -l, -1, -v, -w, /tmp/graph12104113454633571063.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:18:39] [INFO ] Decomposing Gal with order
[2021-05-16 16:18:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:18:39] [INFO ] Removed a total of 292 redundant transitions.
[2021-05-16 16:18:39] [INFO ] Flatten gal took : 150 ms
[2021-05-16 16:18:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-16 16:18:40] [INFO ] Time to serialize gal into /tmp/LTLFireability1357474237475114767.gal : 32 ms
[2021-05-16 16:18:40] [INFO ] Time to serialize properties into /tmp/LTLFireability7791905399444850836.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability1357474237475114767.gal, -t, CGAL, -LTL, /tmp/LTLFireability7791905399444850836.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability1357474237475114767.gal -t CGAL -LTL /tmp/LTLFireability7791905399444850836.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i22.u509.p1664==1)&&(i22.u516.p1691==1))")))&&((F(G("(i15.u297.p960!=1)")))U(("(i13.u257.p822==1)")||(G("((i22.u509.p1664==1)&&(i22.u516.p1691==1))"))))))
Formula 0 simplified : !(XF"((i22.u509.p1664==1)&&(i22.u516.p1691==1))" & (FG"(i15.u297.p960!=1)" U ("(i13.u257.p822==1)" | G"((i22.u509.p1664==1)&&(i22.u516.p1691==1))")))
Compilation finished in 15796 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9402640538326649736]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true)))&&(<>([]((LTLAPp1==true))) U ((LTLAPp2==true)||[]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9402640538326649736]
LTSmin run took 1475 ms.
FORMULA ShieldPPPt-PT-030B-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1621181937682
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205700813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;