About the Execution of 2023-gold for ShieldRVs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16212.252 | 3600000.00 | 7414706.00 | 107636.50 | FFF??FFFF?TFT?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789500533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789500533
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 320K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717008089232
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 18:41:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:41:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:41:31] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-29 18:41:31] [INFO ] Transformed 703 places.
[2024-05-29 18:41:31] [INFO ] Transformed 953 transitions.
[2024-05-29 18:41:31] [INFO ] Found NUPN structural information;
[2024-05-29 18:41:31] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 68 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-29 18:41:31] [INFO ] Computed 201 invariants in 20 ms
[2024-05-29 18:41:32] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-29 18:41:32] [INFO ] Invariant cache hit.
[2024-05-29 18:41:33] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
[2024-05-29 18:41:33] [INFO ] Invariant cache hit.
[2024-05-29 18:41:33] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2014 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 71 out of 703 places after structural reductions.
[2024-05-29 18:41:33] [INFO ] Flatten gal took : 144 ms
[2024-05-29 18:41:33] [INFO ] Flatten gal took : 78 ms
[2024-05-29 18:41:34] [INFO ] Input system was already deterministic with 953 transitions.
Support contains 65 out of 703 places (down from 71) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 18:41:34] [INFO ] Invariant cache hit.
[2024-05-29 18:41:34] [INFO ] [Real]Absence check using 201 positive place invariants in 27 ms returned sat
[2024-05-29 18:41:35] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:41:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2024-05-29 18:41:36] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:41:36] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 7 ms to minimize.
[2024-05-29 18:41:36] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:41:36] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2024-05-29 18:41:36] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2024-05-29 18:41:36] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:41:37] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:41:37] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-05-29 18:41:37] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:41:37] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2024-05-29 18:41:37] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2024-05-29 18:41:38] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:41:38] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-29 18:41:38] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 18:41:38] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:41:38] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:41:38] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:41:39] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:41:39] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:41:39] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:41:39] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:41:39] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 18:41:39] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2024-05-29 18:41:40] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 4 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-29 18:41:41] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:41:43] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 5 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:41:44] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 3 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:41:45] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2024-05-29 18:41:46] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:41:46] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2024-05-29 18:41:46] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:41:46] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 10195 ms
[2024-05-29 18:41:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-29 18:41:46] [INFO ] After 10916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-29 18:41:46] [INFO ] After 11305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 85 ms.
Support contains 10 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 103 place count 702 transition count 952
Applied a total of 103 rules in 119 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :1
Finished Best-First random walk after 3223 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=247 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||(!p1 U X(p0)))))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-29 18:41:47] [INFO ] Invariant cache hit.
[2024-05-29 18:41:47] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-29 18:41:47] [INFO ] Invariant cache hit.
[2024-05-29 18:41:48] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2024-05-29 18:41:48] [INFO ] Invariant cache hit.
[2024-05-29 18:41:49] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1682 ms. Remains : 703/703 places, 953/953 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s115 1) (EQ s132 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 689 steps with 0 reset in 15 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-00 finished in 2056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-29 18:41:49] [INFO ] Invariant cache hit.
[2024-05-29 18:41:49] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-29 18:41:49] [INFO ] Invariant cache hit.
[2024-05-29 18:41:50] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2024-05-29 18:41:50] [INFO ] Invariant cache hit.
[2024-05-29 18:41:51] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1729 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s193 1), p1:(AND (EQ s341 1) (EQ s343 1) (EQ s348 1) (EQ s188 1) (EQ s189 1) (EQ s193 1) (EQ s332 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-02 finished in 1865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 55 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:41:51] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 18:41:51] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-29 18:41:51] [INFO ] Invariant cache hit.
[2024-05-29 18:41:52] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-29 18:41:52] [INFO ] Redundant transitions in 320 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:41:52] [INFO ] Computed 201 invariants in 4 ms
[2024-05-29 18:41:53] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2078 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s535 0) (EQ s550 0) (EQ s561 0)), p1:(OR (NEQ s608 1) (NEQ s609 1) (NEQ s613 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 153 reset in 598 ms.
Product exploration explored 100000 steps with 152 reset in 609 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 4115 steps, including 6 resets, run visited all 2 properties in 47 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 25 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:41:55] [INFO ] Invariant cache hit.
[2024-05-29 18:41:55] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-29 18:41:55] [INFO ] Invariant cache hit.
[2024-05-29 18:41:56] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2024-05-29 18:41:56] [INFO ] Redundant transitions in 175 ms returned []
[2024-05-29 18:41:56] [INFO ] Invariant cache hit.
[2024-05-29 18:41:57] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1843 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 4136 steps, including 6 resets, run visited all 2 properties in 54 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 155 reset in 508 ms.
Product exploration explored 100000 steps with 156 reset in 594 ms.
Built C files in :
/tmp/ltsmin1713721835867806393
[2024-05-29 18:41:58] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:41:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:41:58] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:41:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:41:59] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:41:59] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:41:59] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1713721835867806393
Running compilation step : cd /tmp/ltsmin1713721835867806393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2880 ms.
Running link step : cd /tmp/ltsmin1713721835867806393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin1713721835867806393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased436488126002264592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:42:13] [INFO ] Invariant cache hit.
[2024-05-29 18:42:14] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-29 18:42:14] [INFO ] Invariant cache hit.
[2024-05-29 18:42:15] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2024-05-29 18:42:15] [INFO ] Redundant transitions in 225 ms returned []
[2024-05-29 18:42:15] [INFO ] Invariant cache hit.
[2024-05-29 18:42:15] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1992 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin10404559131451408575
[2024-05-29 18:42:15] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:42:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:42:15] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:42:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:42:16] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:42:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:42:16] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10404559131451408575
Running compilation step : cd /tmp/ltsmin10404559131451408575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2768 ms.
Running link step : cd /tmp/ltsmin10404559131451408575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10404559131451408575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3741523619069646046.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:42:31] [INFO ] Flatten gal took : 54 ms
[2024-05-29 18:42:31] [INFO ] Flatten gal took : 54 ms
[2024-05-29 18:42:31] [INFO ] Time to serialize gal into /tmp/LTL9873958984274312862.gal : 9 ms
[2024-05-29 18:42:31] [INFO ] Time to serialize properties into /tmp/LTL15394214619474629518.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9873958984274312862.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2877484340518409795.hoa' '-atoms' '/tmp/LTL15394214619474629518.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15394214619474629518.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2877484340518409795.hoa
Detected timeout of ITS tools.
[2024-05-29 18:42:46] [INFO ] Flatten gal took : 50 ms
[2024-05-29 18:42:46] [INFO ] Flatten gal took : 48 ms
[2024-05-29 18:42:46] [INFO ] Time to serialize gal into /tmp/LTL6908159884069934412.gal : 7 ms
[2024-05-29 18:42:46] [INFO ] Time to serialize properties into /tmp/LTL13464747615622959073.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6908159884069934412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13464747615622959073.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(((p535==0)||(p550==0))||(p561==0))"))&&(F(G("(((p608==0)||(p609==0))||(p613==0))"))))))
Formula 0 simplified : F(G!"(((p535==0)||(p550==0))||(p561==0))" | GF!"(((p608==0)||(p609==0))||(p613==0))")
Detected timeout of ITS tools.
[2024-05-29 18:43:01] [INFO ] Flatten gal took : 46 ms
[2024-05-29 18:43:01] [INFO ] Applying decomposition
[2024-05-29 18:43:01] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14562423201101672758.txt' '-o' '/tmp/graph14562423201101672758.bin' '-w' '/tmp/graph14562423201101672758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14562423201101672758.bin' '-l' '-1' '-v' '-w' '/tmp/graph14562423201101672758.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:43:01] [INFO ] Decomposing Gal with order
[2024-05-29 18:43:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:43:01] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-29 18:43:01] [INFO ] Flatten gal took : 121 ms
[2024-05-29 18:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 996 labels/synchronizations in 82 ms.
[2024-05-29 18:43:02] [INFO ] Time to serialize gal into /tmp/LTL15447984477771577750.gal : 13 ms
[2024-05-29 18:43:02] [INFO ] Time to serialize properties into /tmp/LTL5407513534428688174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15447984477771577750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5407513534428688174.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("(((i12.i1.i1.u153.p535==0)||(i13.u157.p550==0))||(i13.u160.p561==0))"))&&(F(G("(((i14.i0.i1.u173.p608==0)||(i14.i0.i1.u174.p6...196
Formula 0 simplified : F(G!"(((i12.i1.i1.u153.p535==0)||(i13.u157.p550==0))||(i13.u160.p561==0))" | GF!"(((i14.i0.i1.u173.p608==0)||(i14.i0.i1.u174.p609==0...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13397342842813244922
[2024-05-29 18:43:17] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13397342842813244922
Running compilation step : cd /tmp/ltsmin13397342842813244922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1699 ms.
Running link step : cd /tmp/ltsmin13397342842813244922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13397342842813244922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-03 finished in 100993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||((p1 U p2)&&X(G(p3)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-29 18:43:32] [INFO ] Computed 201 invariants in 8 ms
[2024-05-29 18:43:32] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 18:43:32] [INFO ] Invariant cache hit.
[2024-05-29 18:43:33] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2024-05-29 18:43:33] [INFO ] Invariant cache hit.
[2024-05-29 18:43:33] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1796 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(OR p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s341 0) (EQ s343 0) (EQ s348 0)), p2:(AND (EQ s397 1) (EQ s399 1) (EQ s404 1)), p1:(AND (EQ s341 1) (EQ s343 1) (EQ s348 1)), p3:(EQ s603 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 156 reset in 489 ms.
Product exploration explored 100000 steps with 156 reset in 587 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 101 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1749 steps, including 2 resets, run visited all 1 properties in 20 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 16 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 43 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:43:35] [INFO ] Computed 201 invariants in 11 ms
[2024-05-29 18:43:36] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-29 18:43:36] [INFO ] Invariant cache hit.
[2024-05-29 18:43:37] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2024-05-29 18:43:37] [INFO ] Redundant transitions in 181 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:43:37] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 18:43:37] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2026 ms. Remains : 702/703 places, 951/953 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9104 steps, including 13 resets, run visited all 1 properties in 71 ms. (steps per millisecond=128 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 157 reset in 485 ms.
Product exploration explored 100000 steps with 155 reset in 592 ms.
Built C files in :
/tmp/ltsmin6450696900705009371
[2024-05-29 18:43:39] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:43:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:43:39] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:43:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:43:39] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:43:39] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:43:39] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6450696900705009371
Running compilation step : cd /tmp/ltsmin6450696900705009371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2828 ms.
Running link step : cd /tmp/ltsmin6450696900705009371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6450696900705009371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9947235744269559575.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:43:54] [INFO ] Invariant cache hit.
[2024-05-29 18:43:54] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-29 18:43:54] [INFO ] Invariant cache hit.
[2024-05-29 18:43:55] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-05-29 18:43:55] [INFO ] Redundant transitions in 176 ms returned []
[2024-05-29 18:43:55] [INFO ] Invariant cache hit.
[2024-05-29 18:43:56] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1830 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin15919298824056242528
[2024-05-29 18:43:56] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:43:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:43:56] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:43:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:43:56] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:43:56] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:43:56] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15919298824056242528
Running compilation step : cd /tmp/ltsmin15919298824056242528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2733 ms.
Running link step : cd /tmp/ltsmin15919298824056242528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15919298824056242528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased465890300665851925.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:44:11] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:44:11] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:44:12] [INFO ] Time to serialize gal into /tmp/LTL16052018497123927793.gal : 1203 ms
[2024-05-29 18:44:12] [INFO ] Time to serialize properties into /tmp/LTL3965303110197127418.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16052018497123927793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3347982552493070883.hoa' '-atoms' '/tmp/LTL3965303110197127418.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3965303110197127418.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3347982552493070883.hoa
Detected timeout of ITS tools.
[2024-05-29 18:44:27] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:44:28] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:44:28] [INFO ] Time to serialize gal into /tmp/LTL12866637428034693608.gal : 6 ms
[2024-05-29 18:44:28] [INFO ] Time to serialize properties into /tmp/LTL5111905131397986987.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12866637428034693608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5111905131397986987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((p341==0)||(p343==0))||(p348==0))")))||((("(((p341==1)&&(p343==1))&&(p348==1))")U("(((p397==1)&&(p399==1))&&(p404==1))"))&&...177
Formula 0 simplified : FG!"(((p341==0)||(p343==0))||(p348==0))" & ((!"(((p341==1)&&(p343==1))&&(p348==1))" R !"(((p397==1)&&(p399==1))&&(p404==1))") | XF!"...166
Detected timeout of ITS tools.
[2024-05-29 18:44:43] [INFO ] Flatten gal took : 44 ms
[2024-05-29 18:44:43] [INFO ] Applying decomposition
[2024-05-29 18:44:43] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10353534474194934272.txt' '-o' '/tmp/graph10353534474194934272.bin' '-w' '/tmp/graph10353534474194934272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10353534474194934272.bin' '-l' '-1' '-v' '-w' '/tmp/graph10353534474194934272.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:44:43] [INFO ] Decomposing Gal with order
[2024-05-29 18:44:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:44:43] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-29 18:44:43] [INFO ] Flatten gal took : 93 ms
[2024-05-29 18:44:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 868 labels/synchronizations in 28 ms.
[2024-05-29 18:44:43] [INFO ] Time to serialize gal into /tmp/LTL14972564662511924358.gal : 8 ms
[2024-05-29 18:44:43] [INFO ] Time to serialize properties into /tmp/LTL9922921400390589477.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14972564662511924358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9922921400390589477.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((i8.u97.p341==0)||(i8.u98.p343==0))||(i8.u99.p348==0))")))||((("(((i8.u97.p341==1)&&(i8.u98.p343==1))&&(i8.u99.p348==1))")U...252
Formula 0 simplified : FG!"(((i8.u97.p341==0)||(i8.u98.p343==0))||(i8.u99.p348==0))" & ((!"(((i8.u97.p341==1)&&(i8.u98.p343==1))&&(i8.u99.p348==1))" R !"((...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9830028027772789284
[2024-05-29 18:44:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9830028027772789284
Running compilation step : cd /tmp/ltsmin9830028027772789284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin9830028027772789284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9830028027772789284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(((LTLAPp1==true) U (LTLAPp2==true))&&X([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-04 finished in 101441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 33 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:45:13] [INFO ] Computed 201 invariants in 9 ms
[2024-05-29 18:45:14] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-29 18:45:14] [INFO ] Invariant cache hit.
[2024-05-29 18:45:14] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2024-05-29 18:45:15] [INFO ] Redundant transitions in 191 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:45:15] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 18:45:15] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 20 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1890 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s129 1) (EQ s144 1) (EQ s156 1)), p0:(AND (EQ s656 1) (EQ s658 1) (EQ s667 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 667 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-05 finished in 1993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1)&&F(p2))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-29 18:45:15] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 18:45:15] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 18:45:15] [INFO ] Invariant cache hit.
[2024-05-29 18:45:16] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2024-05-29 18:45:16] [INFO ] Invariant cache hit.
[2024-05-29 18:45:17] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1698 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 1577 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (EQ s556 0) (EQ s562 0) (EQ s569 0)), p0:(EQ s29 1), p2:(OR (EQ s418 0) (EQ s420 0) (EQ s429 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-06 finished in 3305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p1)))||p0)))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-29 18:45:18] [INFO ] Invariant cache hit.
[2024-05-29 18:45:19] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 18:45:19] [INFO ] Invariant cache hit.
[2024-05-29 18:45:20] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-29 18:45:20] [INFO ] Invariant cache hit.
[2024-05-29 18:45:20] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1677 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s136 1) (AND (EQ s220 1) (EQ s224 1) (EQ s233 1))), p1:(AND (EQ s220 1) (EQ s224 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-07 finished in 1810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U X(p2)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-29 18:45:20] [INFO ] Invariant cache hit.
[2024-05-29 18:45:21] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-29 18:45:21] [INFO ] Invariant cache hit.
[2024-05-29 18:45:21] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2024-05-29 18:45:21] [INFO ] Invariant cache hit.
[2024-05-29 18:45:22] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1680 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s631 1), p1:(AND (EQ s138 1) (EQ s142 1) (EQ s149 1)), p2:(AND (EQ s479 1) (EQ s494 1) (EQ s506 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 667 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-08 finished in 1889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 34 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:45:22] [INFO ] Computed 201 invariants in 6 ms
[2024-05-29 18:45:23] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-29 18:45:23] [INFO ] Invariant cache hit.
[2024-05-29 18:45:23] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-05-29 18:45:23] [INFO ] Redundant transitions in 183 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:45:24] [INFO ] Computed 201 invariants in 2 ms
[2024-05-29 18:45:24] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1875 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s20 1) (NEQ s29 1)), p1:(NEQ s696 1)], nbAcceptance=2, 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 149 reset in 520 ms.
Product exploration explored 100000 steps with 150 reset in 613 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 18:45:26] [INFO ] Invariant cache hit.
[2024-05-29 18:45:26] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2024-05-29 18:45:26] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:45:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2024-05-29 18:45:27] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:45:27] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:45:27] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:45:27] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:45:27] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:45:28] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:45:28] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:45:28] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:45:28] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:45:28] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2024-05-29 18:45:29] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2024-05-29 18:45:29] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 0 ms to minimize.
[2024-05-29 18:45:29] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:45:29] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:45:29] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:45:30] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:45:30] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:45:30] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:45:30] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:45:30] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2024-05-29 18:45:32] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:45:35] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:45:35] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:45:35] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:45:35] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:45:36] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:45:37] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:45:38] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2024-05-29 18:45:41] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:45:42] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:45:42] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:45:42] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:45:42] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:45:42] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:45:43] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:45:43] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:45:43] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:45:43] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:45:43] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2024-05-29 18:45:44] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-05-29 18:45:44] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:45:44] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:45:44] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:45:44] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:45:44] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:45:45] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:45:45] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:45:45] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:45:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 18347 ms
[2024-05-29 18:45:45] [INFO ] Trap strengthening (SAT) tested/added 102/101 trap constraints in 18347 ms
[2024-05-29 18:45:45] [INFO ] After 18895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-29 18:45:45] [INFO ] After 19111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 43 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204641 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204641 steps, saw 66293 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:45:48] [INFO ] Computed 201 invariants in 9 ms
[2024-05-29 18:45:48] [INFO ] [Real]Absence check using 201 positive place invariants in 34 ms returned sat
[2024-05-29 18:45:49] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:45:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2024-05-29 18:45:49] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2024-05-29 18:45:52] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2024-05-29 18:45:52] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2024-05-29 18:45:52] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:45:52] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2024-05-29 18:45:52] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:45:53] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2024-05-29 18:45:53] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:45:53] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2024-05-29 18:45:53] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2024-05-29 18:45:54] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2024-05-29 18:45:54] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2024-05-29 18:45:54] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2024-05-29 18:45:54] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2024-05-29 18:45:55] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2024-05-29 18:45:55] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2024-05-29 18:45:55] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2024-05-29 18:45:55] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2024-05-29 18:45:55] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2024-05-29 18:45:56] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2024-05-29 18:45:56] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2024-05-29 18:45:56] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2024-05-29 18:45:56] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2024-05-29 18:45:57] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2024-05-29 18:45:57] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:45:57] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2024-05-29 18:45:57] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:45:58] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2024-05-29 18:45:58] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2024-05-29 18:45:58] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2024-05-29 18:45:58] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 2 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 0 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2024-05-29 18:46:03] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:46:04] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2024-05-29 18:46:05] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 18:46:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 18:46:14] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:46:14] [INFO ] Invariant cache hit.
[2024-05-29 18:46:14] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-29 18:46:14] [INFO ] Invariant cache hit.
[2024-05-29 18:46:15] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2024-05-29 18:46:15] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 18:46:15] [INFO ] Invariant cache hit.
[2024-05-29 18:46:16] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1906 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 18:46:16] [INFO ] Invariant cache hit.
[2024-05-29 18:46:16] [INFO ] [Real]Absence check using 201 positive place invariants in 35 ms returned sat
[2024-05-29 18:46:16] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:46:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2024-05-29 18:46:17] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:46:19] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2024-05-29 18:46:19] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:46:19] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:46:19] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:46:19] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:46:19] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:46:20] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2024-05-29 18:46:20] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:46:20] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2024-05-29 18:46:20] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:46:20] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2024-05-29 18:46:21] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:21] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:46:21] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:46:21] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:46:21] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:46:22] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:46:22] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2024-05-29 18:46:22] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2024-05-29 18:46:22] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2024-05-29 18:46:22] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2024-05-29 18:46:23] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2024-05-29 18:46:23] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 18:46:23] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:46:23] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2024-05-29 18:46:23] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2024-05-29 18:46:24] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:46:24] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:46:24] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2024-05-29 18:46:24] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:24] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:25] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:46:25] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:46:25] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:46:25] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:46:25] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:46:25] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:46:26] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:46:26] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:46:26] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:26] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:26] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 11 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2024-05-29 18:46:27] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:46:28] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-05-29 18:46:28] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:46:28] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:46:28] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:46:28] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:28] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:46:29] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:46:29] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:29] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:46:29] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:46:29] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:46:29] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:46:30] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:46:31] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2024-05-29 18:46:31] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:46:31] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:46:31] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:46:31] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 18:46:31] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:46:39] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:46:39] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:46:39] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:39] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:39] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:39] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:46:41] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:41] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:46:41] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:46:41] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2024-05-29 18:46:41] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:46:41] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 0 ms to minimize.
[2024-05-29 18:46:43] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:46:44] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2024-05-29 18:46:44] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2024-05-29 18:46:44] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:46:44] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:46:45] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2024-05-29 18:46:45] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2024-05-29 18:46:45] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2024-05-29 18:46:45] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:46:45] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2024-05-29 18:46:46] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:46:46] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:46:46] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:46:46] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:46:46] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2024-05-29 18:46:47] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:46:47] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:46:47] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:46:47] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:46:47] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Trap strengthening (SAT) tested/added 203/202 trap constraints in 34813 ms
[2024-05-29 18:46:52] [INFO ] After 35276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 18:46:52] [INFO ] After 35507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 183 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:46:52] [INFO ] Computed 201 invariants in 6 ms
[2024-05-29 18:46:53] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-29 18:46:53] [INFO ] Invariant cache hit.
[2024-05-29 18:46:53] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2024-05-29 18:46:54] [INFO ] Redundant transitions in 162 ms returned []
[2024-05-29 18:46:54] [INFO ] Invariant cache hit.
[2024-05-29 18:46:54] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1851 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1047 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 18:46:55] [INFO ] Invariant cache hit.
[2024-05-29 18:46:55] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2024-05-29 18:46:56] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:46:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 36 ms returned sat
[2024-05-29 18:46:56] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:46:57] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:46:57] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:46:57] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:46:57] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:46:57] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2024-05-29 18:46:58] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2024-05-29 18:46:58] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:46:58] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:46:58] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:46:58] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:46:59] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 4 ms to minimize.
[2024-05-29 18:46:59] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:46:59] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:46:59] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:46:59] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:47:00] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:47:00] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:47:00] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:47:00] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:47:00] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:47:00] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:47:01] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:47:01] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 18:47:01] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2024-05-29 18:47:01] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2024-05-29 18:47:01] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 18:47:01] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2024-05-29 18:47:02] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-29 18:47:03] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:47:04] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:47:04] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:47:04] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 18:47:04] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:47:05] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:47:05] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2024-05-29 18:47:05] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:47:05] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2024-05-29 18:47:05] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2024-05-29 18:47:07] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:47:07] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:47:07] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:47:07] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:47:07] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:47:08] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:47:08] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:47:08] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:47:08] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:47:08] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:47:09] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:47:09] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2024-05-29 18:47:09] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:47:09] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2024-05-29 18:47:09] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:47:09] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:47:10] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:47:10] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:47:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:47:10] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:47:10] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:47:11] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:47:11] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:47:11] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:47:11] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:11] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:47:13] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:47:13] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:13] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:13] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:47:13] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:47:15] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:47:15] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:47:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 18222 ms
[2024-05-29 18:47:15] [INFO ] Trap strengthening (SAT) tested/added 102/101 trap constraints in 18222 ms
[2024-05-29 18:47:15] [INFO ] After 18799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 18:47:15] [INFO ] After 19039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 36 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 201835 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201835 steps, saw 65723 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:47:18] [INFO ] Computed 201 invariants in 4 ms
[2024-05-29 18:47:18] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2024-05-29 18:47:19] [INFO ] After 560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:47:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2024-05-29 18:47:19] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:47:19] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 0 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:47:27] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:47:27] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:47:27] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2024-05-29 18:47:27] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-29 18:47:28] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2024-05-29 18:47:28] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:47:28] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-29 18:47:28] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2024-05-29 18:47:29] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2024-05-29 18:47:29] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2024-05-29 18:47:29] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2024-05-29 18:47:29] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2024-05-29 18:47:29] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2024-05-29 18:47:30] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2024-05-29 18:47:30] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2024-05-29 18:47:30] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2024-05-29 18:47:30] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2024-05-29 18:47:31] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2024-05-29 18:47:31] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2024-05-29 18:47:31] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2024-05-29 18:47:31] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2024-05-29 18:47:31] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-05-29 18:47:32] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2024-05-29 18:47:32] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:47:32] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:47:32] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 18:47:33] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 18:47:33] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:47:33] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:47:33] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2024-05-29 18:47:33] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2024-05-29 18:47:34] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2024-05-29 18:47:34] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2024-05-29 18:47:34] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 0 ms to minimize.
[2024-05-29 18:47:34] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2024-05-29 18:47:34] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2024-05-29 18:47:36] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2024-05-29 18:47:41] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:47:42] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:47:43] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2024-05-29 18:47:43] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 18:47:43] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:47:43] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2024-05-29 18:47:43] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2024-05-29 18:47:44] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 18:47:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 18:47:44] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 30 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:47:44] [INFO ] Invariant cache hit.
[2024-05-29 18:47:44] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-29 18:47:44] [INFO ] Invariant cache hit.
[2024-05-29 18:47:45] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2024-05-29 18:47:45] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-29 18:47:45] [INFO ] Invariant cache hit.
[2024-05-29 18:47:45] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1829 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 18:47:45] [INFO ] Invariant cache hit.
[2024-05-29 18:47:46] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2024-05-29 18:47:46] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:47:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2024-05-29 18:47:47] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:47:47] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:47:47] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2024-05-29 18:47:47] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2024-05-29 18:47:47] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:47:48] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:47:48] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2024-05-29 18:47:48] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:47:48] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:47:48] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:47:49] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2024-05-29 18:47:49] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:47:49] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:47:49] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:47:49] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:47:49] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:47:50] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:50] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:47:50] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:47:50] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:47:50] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:47:51] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:47:51] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:47:51] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:47:51] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 4 ms to minimize.
[2024-05-29 18:47:51] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2024-05-29 18:47:52] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2024-05-29 18:47:52] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2024-05-29 18:47:52] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2024-05-29 18:47:52] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:47:52] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2024-05-29 18:47:53] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2024-05-29 18:47:53] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:47:53] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:47:53] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:47:53] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2024-05-29 18:47:54] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2024-05-29 18:47:54] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 0 ms to minimize.
[2024-05-29 18:47:54] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:47:54] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:47:54] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:47:54] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 18:47:55] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:47:55] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2024-05-29 18:47:55] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:47:55] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:47:55] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:47:56] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:47:56] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:47:56] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:47:56] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:47:56] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:47:56] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:48:01] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:48:03] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:48:04] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 1 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 0 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 0 ms to minimize.
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 1 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:48:14] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2024-05-29 18:48:14] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2024-05-29 18:48:14] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-05-29 18:48:14] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:48:14] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:48:16] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:48:16] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:48:16] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:48:16] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2024-05-29 18:48:16] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:48:17] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2024-05-29 18:48:17] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:48:17] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:48:17] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2024-05-29 18:48:17] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:48:18] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:48:18] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2024-05-29 18:48:18] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:48:18] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:48:18] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:48:19] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2024-05-29 18:48:19] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:48:19] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-05-29 18:48:19] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:48:19] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2024-05-29 18:48:19] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 0 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:48:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Trap strengthening (SAT) tested/added 203/202 trap constraints in 34300 ms
[2024-05-29 18:48:21] [INFO ] After 34744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 18:48:21] [INFO ] After 34964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 517 ms.
Product exploration explored 100000 steps with 150 reset in 605 ms.
Built C files in :
/tmp/ltsmin5672342248078924325
[2024-05-29 18:48:23] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:48:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:48:23] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:48:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:48:23] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:48:23] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:48:23] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5672342248078924325
Running compilation step : cd /tmp/ltsmin5672342248078924325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2668 ms.
Running link step : cd /tmp/ltsmin5672342248078924325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5672342248078924325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9257322098605632608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:48:38] [INFO ] Computed 201 invariants in 4 ms
[2024-05-29 18:48:38] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-29 18:48:38] [INFO ] Invariant cache hit.
[2024-05-29 18:48:39] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2024-05-29 18:48:39] [INFO ] Redundant transitions in 195 ms returned []
[2024-05-29 18:48:39] [INFO ] Invariant cache hit.
[2024-05-29 18:48:40] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1933 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin17058252793331473475
[2024-05-29 18:48:40] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:48:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:48:40] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:48:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:48:40] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:48:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:48:40] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17058252793331473475
Running compilation step : cd /tmp/ltsmin17058252793331473475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2698 ms.
Running link step : cd /tmp/ltsmin17058252793331473475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17058252793331473475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12893276560370861226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:48:55] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:48:55] [INFO ] Flatten gal took : 36 ms
[2024-05-29 18:48:55] [INFO ] Time to serialize gal into /tmp/LTL15625092966546086844.gal : 6 ms
[2024-05-29 18:48:55] [INFO ] Time to serialize properties into /tmp/LTL3580706287826316134.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15625092966546086844.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11822789393851930314.hoa' '-atoms' '/tmp/LTL3580706287826316134.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3580706287826316134.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11822789393851930314.hoa
Detected timeout of ITS tools.
[2024-05-29 18:49:10] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:49:10] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:49:10] [INFO ] Time to serialize gal into /tmp/LTL15865226940021475129.gal : 8 ms
[2024-05-29 18:49:10] [INFO ] Time to serialize properties into /tmp/LTL11960854332596122960.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15865226940021475129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11960854332596122960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p3==0)||(p20==0))||(p29==0))"))||(G("(p697==0)")))))
Formula 0 simplified : G(F!"(((p3==0)||(p20==0))||(p29==0))" & F!"(p697==0)")
Detected timeout of ITS tools.
[2024-05-29 18:49:25] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:49:25] [INFO ] Applying decomposition
[2024-05-29 18:49:25] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13088214943924452614.txt' '-o' '/tmp/graph13088214943924452614.bin' '-w' '/tmp/graph13088214943924452614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13088214943924452614.bin' '-l' '-1' '-v' '-w' '/tmp/graph13088214943924452614.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:49:25] [INFO ] Decomposing Gal with order
[2024-05-29 18:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:49:25] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-29 18:49:25] [INFO ] Flatten gal took : 50 ms
[2024-05-29 18:49:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 956 labels/synchronizations in 29 ms.
[2024-05-29 18:49:25] [INFO ] Time to serialize gal into /tmp/LTL13382299509289390583.gal : 19 ms
[2024-05-29 18:49:25] [INFO ] Time to serialize properties into /tmp/LTL8900662818004652556.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13382299509289390583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8900662818004652556.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i0.u1.p3==0)||(i0.u5.p20==0))||(i0.u8.p29==0))"))||(G("(i15.u199.p697==0)")))))
Formula 0 simplified : G(F!"(((i0.u1.p3==0)||(i0.u5.p20==0))||(i0.u8.p29==0))" & F!"(i15.u199.p697==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14642848832333241048
[2024-05-29 18:49:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14642848832333241048
Running compilation step : cd /tmp/ltsmin14642848832333241048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1672 ms.
Running link step : cd /tmp/ltsmin14642848832333241048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14642848832333241048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-09 finished in 275239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G(!p0))) U X((!p1||F(!p2)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2024-05-29 18:49:57] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 18:49:58] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-29 18:49:58] [INFO ] Invariant cache hit.
[2024-05-29 18:49:59] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2024-05-29 18:49:59] [INFO ] Invariant cache hit.
[2024-05-29 18:49:59] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND p1 p2), (AND p2 p1), (AND p1 p2), p2, (AND p2 p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s421 1), p1:(AND (EQ s96 1) (EQ s100 1) (EQ s107 1)), p2:(AND (EQ s360 1) (EQ s364 1) (EQ s373 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2507 ms.
Product exploration explored 100000 steps with 50000 reset in 2554 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 6202 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-12 finished in 13296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 34 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:50:11] [INFO ] Computed 201 invariants in 1 ms
[2024-05-29 18:50:11] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-29 18:50:11] [INFO ] Invariant cache hit.
[2024-05-29 18:50:12] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2024-05-29 18:50:12] [INFO ] Redundant transitions in 176 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:50:12] [INFO ] Computed 201 invariants in 2 ms
[2024-05-29 18:50:12] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1843 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 769 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(OR p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s414 1) (EQ s419 1)), p0:(AND (EQ s414 1) (EQ s419 1)), p1:(NEQ s439 1), p3:(AND (EQ s500 1) (EQ s506 1) (EQ s513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 158 reset in 525 ms.
Product exploration explored 100000 steps with 163 reset in 606 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p1), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 123 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Finished Best-First random walk after 8730 steps, including 2 resets, run visited all 1 properties in 33 ms. (steps per millisecond=264 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p1), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p2))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F (AND p3 p0 (NOT p1))), (F (AND (NOT p2) p3)), (F (AND (NOT p3) p0 (NOT p1))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) (NOT p1)))]
Knowledge based reduction with 17 factoid took 302 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 172 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:50:16] [INFO ] Invariant cache hit.
[2024-05-29 18:50:16] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-29 18:50:16] [INFO ] Invariant cache hit.
[2024-05-29 18:50:17] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-29 18:50:17] [INFO ] Redundant transitions in 180 ms returned []
[2024-05-29 18:50:17] [INFO ] Invariant cache hit.
[2024-05-29 18:50:17] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1821 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p1), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X p1)), (X (X (NOT p2))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 99 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-29 18:50:18] [INFO ] Invariant cache hit.
[2024-05-29 18:50:18] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2024-05-29 18:50:18] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:50:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2024-05-29 18:50:19] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:50:22] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:50:22] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:50:22] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:50:22] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:50:22] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:50:23] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2024-05-29 18:50:23] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:50:23] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:50:23] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 18:50:23] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:50:23] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:29] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2024-05-29 18:50:29] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 18:50:29] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:50:29] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 18:50:29] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:50:29] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:50:31] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:50:31] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:50:31] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:50:31] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:50:31] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:50:31] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:50:32] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:50:32] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:50:32] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:50:32] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2024-05-29 18:50:32] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2024-05-29 18:50:32] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:50:37] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:37] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:50:37] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:50:37] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-29 18:50:37] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 18:50:37] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:38] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:50:38] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:38] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:50:38] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:38] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:50:39] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:39] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:50:39] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 18:50:39] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 18:50:39] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:50:39] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 18:50:40] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-05-29 18:50:40] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:40] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2024-05-29 18:50:40] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:40] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2024-05-29 18:50:41] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:41] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-05-29 18:50:41] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:50:41] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:50:41] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 18:50:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 18:50:44] [INFO ] After 25331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 29 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Finished Best-First random walk after 8131 steps, including 2 resets, run visited all 1 properties in 27 ms. (steps per millisecond=301 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p1), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X p1)), (X (X (NOT p2))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F (AND p3 p0 (NOT p1))), (F (AND (NOT p2) p3)), (F (AND (NOT p3) p0 (NOT p1))), (F (NOT (OR p2 (NOT p3)))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) (NOT p1)))]
Knowledge based reduction with 17 factoid took 4345 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 159 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Product exploration explored 100000 steps with 155 reset in 517 ms.
Product exploration explored 100000 steps with 160 reset in 628 ms.
Built C files in :
/tmp/ltsmin13105653062973094472
[2024-05-29 18:50:50] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:50:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:50:50] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:50:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:50:50] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:50:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:50:50] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13105653062973094472
Running compilation step : cd /tmp/ltsmin13105653062973094472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2635 ms.
Running link step : cd /tmp/ltsmin13105653062973094472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin13105653062973094472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9708833238370733764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:51:05] [INFO ] Invariant cache hit.
[2024-05-29 18:51:05] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-29 18:51:05] [INFO ] Invariant cache hit.
[2024-05-29 18:51:06] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2024-05-29 18:51:06] [INFO ] Redundant transitions in 171 ms returned []
[2024-05-29 18:51:06] [INFO ] Invariant cache hit.
[2024-05-29 18:51:07] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1858 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin208352811458546159
[2024-05-29 18:51:07] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:51:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:51:07] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:51:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:51:07] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:51:07] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:51:07] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin208352811458546159
Running compilation step : cd /tmp/ltsmin208352811458546159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2788 ms.
Running link step : cd /tmp/ltsmin208352811458546159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin208352811458546159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7517767019902464096.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:51:22] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:51:22] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:51:22] [INFO ] Time to serialize gal into /tmp/LTL15098626519275619589.gal : 6 ms
[2024-05-29 18:51:22] [INFO ] Time to serialize properties into /tmp/LTL2391994849774710470.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15098626519275619589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16886383167124919017.hoa' '-atoms' '/tmp/LTL2391994849774710470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2391994849774710470.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16886383167124919017.hoa
Detected timeout of ITS tools.
[2024-05-29 18:51:37] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:51:37] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:51:37] [INFO ] Time to serialize gal into /tmp/LTL138729460847123153.gal : 8 ms
[2024-05-29 18:51:37] [INFO ] Time to serialize properties into /tmp/LTL17619658291360595767.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL138729460847123153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17619658291360595767.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((!("((p414==1)&&(p419==1))"))||(F("(p439==0)")))U((G((!("((p414==1)&&(p419==1))"))||(F("(p439==0)"))))||(("((p414==1)&&(p419==1))"...263
Formula 0 simplified : (!"((p414==1)&&(p419==1))" | XF"(((p500==1)&&(p506==1))&&(p513==1))") U ("((p414==1)&&(p419==1))" & G!"(p439==0)")
Detected timeout of ITS tools.
[2024-05-29 18:51:52] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:51:52] [INFO ] Applying decomposition
[2024-05-29 18:51:52] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5402398214347822821.txt' '-o' '/tmp/graph5402398214347822821.bin' '-w' '/tmp/graph5402398214347822821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5402398214347822821.bin' '-l' '-1' '-v' '-w' '/tmp/graph5402398214347822821.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:51:52] [INFO ] Decomposing Gal with order
[2024-05-29 18:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:51:52] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-29 18:51:52] [INFO ] Flatten gal took : 49 ms
[2024-05-29 18:51:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 820 labels/synchronizations in 28 ms.
[2024-05-29 18:51:52] [INFO ] Time to serialize gal into /tmp/LTL6764900674064293354.gal : 6 ms
[2024-05-29 18:51:52] [INFO ] Time to serialize properties into /tmp/LTL6219317591363782796.ltl : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6764900674064293354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6219317591363782796.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((!("((i10.i1.i0.u118.p414==1)&&(i10.i1.i0.u120.p419==1))"))||(F("(i11.i0.i0.u125.p439==0)")))U((G((!("((i10.i1.i0.u118.p414==1)&&(...455
Formula 0 simplified : (!"((i10.i1.i0.u118.p414==1)&&(i10.i1.i0.u120.p419==1))" | XF"(((i12.u143.p500==1)&&(i12.u144.p506==1))&&(i12.u147.p513==1))") U ("(...239
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2893787446044867903
[2024-05-29 18:52:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2893787446044867903
Running compilation step : cd /tmp/ltsmin2893787446044867903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1672 ms.
Running link step : cd /tmp/ltsmin2893787446044867903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2893787446044867903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||(X([](!(LTLAPp3==true)))&&(!(LTLAPp0==true)||<>((LTLAPp1==true)))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-13 finished in 131785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 38 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:52:22] [INFO ] Computed 201 invariants in 5 ms
[2024-05-29 18:52:23] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-29 18:52:23] [INFO ] Invariant cache hit.
[2024-05-29 18:52:24] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-29 18:52:24] [INFO ] Redundant transitions in 186 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:52:24] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 18:52:24] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 14 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1881 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s336 1) (OR (EQ s367 0) (EQ s384 0) (EQ s394 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 696 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-14 finished in 1950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||((p1 U p2)&&X(G(p3)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-050A-LTLFireability-04
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 49 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2024-05-29 18:52:25] [INFO ] Computed 201 invariants in 2 ms
[2024-05-29 18:52:25] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-29 18:52:25] [INFO ] Invariant cache hit.
[2024-05-29 18:52:26] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2024-05-29 18:52:26] [INFO ] Invariant cache hit.
[2024-05-29 18:52:27] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 702/703 places, 952/953 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1704 ms. Remains : 702/703 places, 952/953 transitions.
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(OR p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s341 0) (EQ s343 0) (EQ s348 0)), p2:(AND (EQ s397 1) (EQ s399 1) (EQ s404 1)), p1:(AND (EQ s341 1) (EQ s343 1) (EQ s348 1)), p3:(EQ s603 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 156 reset in 495 ms.
Product exploration explored 100000 steps with 156 reset in 589 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 111 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3807 steps, including 5 resets, run visited all 1 properties in 28 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 16 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 702 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-29 18:52:28] [INFO ] Invariant cache hit.
[2024-05-29 18:52:29] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-29 18:52:29] [INFO ] Invariant cache hit.
[2024-05-29 18:52:29] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
[2024-05-29 18:52:30] [INFO ] Redundant transitions in 185 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2024-05-29 18:52:30] [INFO ] Computed 201 invariants in 7 ms
[2024-05-29 18:52:30] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/702 places, 951/952 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1902 ms. Remains : 702/702 places, 951/952 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1748 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 156 reset in 501 ms.
Product exploration explored 100000 steps with 157 reset in 597 ms.
Built C files in :
/tmp/ltsmin14475418355605798910
[2024-05-29 18:52:32] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:52:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:32] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:52:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:32] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:52:32] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:32] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14475418355605798910
Running compilation step : cd /tmp/ltsmin14475418355605798910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2725 ms.
Running link step : cd /tmp/ltsmin14475418355605798910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14475418355605798910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4285390043367435140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 18:52:47] [INFO ] Invariant cache hit.
[2024-05-29 18:52:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-29 18:52:47] [INFO ] Invariant cache hit.
[2024-05-29 18:52:48] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2024-05-29 18:52:48] [INFO ] Redundant transitions in 189 ms returned []
[2024-05-29 18:52:48] [INFO ] Invariant cache hit.
[2024-05-29 18:52:49] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1833 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin16157384680068404055
[2024-05-29 18:52:49] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 18:52:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:49] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 18:52:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:49] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 18:52:49] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:49] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16157384680068404055
Running compilation step : cd /tmp/ltsmin16157384680068404055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2717 ms.
Running link step : cd /tmp/ltsmin16157384680068404055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16157384680068404055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4466674448726972689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:53:04] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:53:04] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:53:04] [INFO ] Time to serialize gal into /tmp/LTL13139280719814467043.gal : 5 ms
[2024-05-29 18:53:04] [INFO ] Time to serialize properties into /tmp/LTL12654441085787460903.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13139280719814467043.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4688942942258279430.hoa' '-atoms' '/tmp/LTL12654441085787460903.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12654441085787460903.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4688942942258279430.hoa
Detected timeout of ITS tools.
[2024-05-29 18:53:19] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:53:19] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:53:19] [INFO ] Time to serialize gal into /tmp/LTL2315014581107558023.gal : 7 ms
[2024-05-29 18:53:19] [INFO ] Time to serialize properties into /tmp/LTL14954590949423432703.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2315014581107558023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14954590949423432703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((p341==0)||(p343==0))||(p348==0))")))||((("(((p341==1)&&(p343==1))&&(p348==1))")U("(((p397==1)&&(p399==1))&&(p404==1))"))&&...177
Formula 0 simplified : FG!"(((p341==0)||(p343==0))||(p348==0))" & ((!"(((p341==1)&&(p343==1))&&(p348==1))" R !"(((p397==1)&&(p399==1))&&(p404==1))") | XF!"...166
Detected timeout of ITS tools.
[2024-05-29 18:53:34] [INFO ] Flatten gal took : 49 ms
[2024-05-29 18:53:34] [INFO ] Applying decomposition
[2024-05-29 18:53:34] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11762059079839164851.txt' '-o' '/tmp/graph11762059079839164851.bin' '-w' '/tmp/graph11762059079839164851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11762059079839164851.bin' '-l' '-1' '-v' '-w' '/tmp/graph11762059079839164851.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:53:34] [INFO ] Decomposing Gal with order
[2024-05-29 18:53:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:53:34] [INFO ] Removed a total of 1045 redundant transitions.
[2024-05-29 18:53:34] [INFO ] Flatten gal took : 47 ms
[2024-05-29 18:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 812 labels/synchronizations in 27 ms.
[2024-05-29 18:53:34] [INFO ] Time to serialize gal into /tmp/LTL14546315908212004693.gal : 6 ms
[2024-05-29 18:53:34] [INFO ] Time to serialize properties into /tmp/LTL15626917264921483915.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14546315908212004693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15626917264921483915.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((i8.u97.p341==0)||(i8.u98.p343==0))||(i8.u99.p348==0))")))||((("(((i8.u97.p341==1)&&(i8.u98.p343==1))&&(i8.u99.p348==1))")U...252
Formula 0 simplified : FG!"(((i8.u97.p341==0)||(i8.u98.p343==0))||(i8.u99.p348==0))" & ((!"(((i8.u97.p341==1)&&(i8.u98.p343==1))&&(i8.u99.p348==1))" R !"((...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15367479021504959515
[2024-05-29 18:53:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15367479021504959515
Running compilation step : cd /tmp/ltsmin15367479021504959515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1638 ms.
Running link step : cd /tmp/ltsmin15367479021504959515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15367479021504959515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(((LTLAPp1==true) U (LTLAPp2==true))&&X([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-04 finished in 99704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
[2024-05-29 18:54:04] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3413425164640826151
[2024-05-29 18:54:05] [INFO ] Computing symmetric may disable matrix : 953 transitions.
[2024-05-29 18:54:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:54:05] [INFO ] Computing symmetric may enable matrix : 953 transitions.
[2024-05-29 18:54:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:54:05] [INFO ] Applying decomposition
[2024-05-29 18:54:05] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6210930647581170397.txt' '-o' '/tmp/graph6210930647581170397.bin' '-w' '/tmp/graph6210930647581170397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6210930647581170397.bin' '-l' '-1' '-v' '-w' '/tmp/graph6210930647581170397.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:54:05] [INFO ] Decomposing Gal with order
[2024-05-29 18:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:54:05] [INFO ] Computing Do-Not-Accords matrix : 953 transitions.
[2024-05-29 18:54:05] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:54:05] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3413425164640826151
Running compilation step : cd /tmp/ltsmin3413425164640826151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 18:54:05] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-29 18:54:05] [INFO ] Flatten gal took : 45 ms
[2024-05-29 18:54:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 960 labels/synchronizations in 29 ms.
[2024-05-29 18:54:05] [INFO ] Time to serialize gal into /tmp/LTLFireability15629256067089608090.gal : 6 ms
[2024-05-29 18:54:05] [INFO ] Time to serialize properties into /tmp/LTLFireability5572027418876103028.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15629256067089608090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5572027418876103028.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G((F("(((i12.i0.i0.u153.p535==0)||(i12.i0.i1.u157.p550==0))||(i12.i0.i1.u160.p561==0))"))&&(F(G("(((i13.u173.p608!=1)||(i13.u174.p6...190
Formula 0 simplified : F(G!"(((i12.i0.i0.u153.p535==0)||(i12.i0.i1.u157.p550==0))||(i12.i0.i1.u160.p561==0))" | GF!"(((i13.u173.p608!=1)||(i13.u174.p609!=1...180
Compilation finished in 2944 ms.
Running link step : cd /tmp/ltsmin3413425164640826151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3413425164640826151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3413425164640826151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3413425164640826151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp2==true)))||(((LTLAPp3==true) U (LTLAPp4==true))&&X([]((LTLAPp5==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.144: LTL layer: formula: ([](<>((LTLAPp2==true)))||(((LTLAPp3==true) U (LTLAPp4==true))&&X([]((LTLAPp5==true)))))
pins2lts-mc-linux64( 6/ 8), 0.144: "([](<>((LTLAPp2==true)))||(((LTLAPp3==true) U (LTLAPp4==true))&&X([]((LTLAPp5==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.151: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.163: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.166: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.209: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.364: DFS-FIFO for weak LTL, using special progress label 966
pins2lts-mc-linux64( 0/ 8), 0.365: There are 967 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.365: State length is 704, there are 971 groups
pins2lts-mc-linux64( 0/ 8), 0.365: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.365: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.365: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.365: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.425: ~1 levels ~960 states ~3640 transitions
pins2lts-mc-linux64( 5/ 8), 0.491: ~1 levels ~1920 states ~7816 transitions
pins2lts-mc-linux64( 5/ 8), 0.611: ~1 levels ~3840 states ~16640 transitions
pins2lts-mc-linux64( 5/ 8), 0.843: ~1 levels ~7680 states ~36904 transitions
pins2lts-mc-linux64( 5/ 8), 1.265: ~1 levels ~15360 states ~78264 transitions
pins2lts-mc-linux64( 5/ 8), 2.020: ~1 levels ~30720 states ~168568 transitions
pins2lts-mc-linux64( 5/ 8), 3.497: ~1 levels ~61440 states ~360112 transitions
pins2lts-mc-linux64( 5/ 8), 6.002: ~1 levels ~122880 states ~760208 transitions
pins2lts-mc-linux64( 5/ 8), 11.092: ~1 levels ~245760 states ~1634344 transitions
pins2lts-mc-linux64( 5/ 8), 22.131: ~1 levels ~491520 states ~3409832 transitions
pins2lts-mc-linux64( 5/ 8), 42.711: ~1 levels ~983040 states ~7113352 transitions
pins2lts-mc-linux64( 5/ 8), 83.900: ~1 levels ~1966080 states ~14826696 transitions
pins2lts-mc-linux64( 5/ 8), 161.321: ~1 levels ~3932160 states ~30782776 transitions
pins2lts-mc-linux64( 0/ 8), 242.972: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 243.160:
pins2lts-mc-linux64( 0/ 8), 243.160: mean standard work distribution: 3.7% (states) 3.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 243.165:
pins2lts-mc-linux64( 0/ 8), 243.165: Explored 5445822 states 47794904 transitions, fanout: 8.776
pins2lts-mc-linux64( 0/ 8), 243.165: Total exploration time 242.770 sec (242.600 sec minimum, 242.676 sec on average)
pins2lts-mc-linux64( 0/ 8), 243.165: States per second: 22432, Transitions per second: 196873
pins2lts-mc-linux64( 0/ 8), 243.165:
pins2lts-mc-linux64( 0/ 8), 243.165: Progress states detected: 10212023
pins2lts-mc-linux64( 0/ 8), 243.165: Redundant explorations: -46.6726
pins2lts-mc-linux64( 0/ 8), 243.165:
pins2lts-mc-linux64( 0/ 8), 243.165: Queue width: 8B, total height: 8024139, memory: 61.22MB
pins2lts-mc-linux64( 0/ 8), 243.165: Tree memory: 333.9MB, 34.3 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 243.165: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 243.173: Stored 965 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 243.212: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 243.213: Est. total memory use: 395.1MB (~1085.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3413425164640826151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp2==true)))||(((LTLAPp3==true) U (LTLAPp4==true))&&X([]((LTLAPp5==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3413425164640826151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp2==true)))||(((LTLAPp3==true) U (LTLAPp4==true))&&X([]((LTLAPp5==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 19:18:18] [INFO ] Applying decomposition
[2024-05-29 19:18:18] [INFO ] Flatten gal took : 398 ms
[2024-05-29 19:18:18] [INFO ] Decomposing Gal with order
[2024-05-29 19:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:18:19] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-29 19:18:19] [INFO ] Flatten gal took : 437 ms
[2024-05-29 19:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 231 ms.
[2024-05-29 19:18:19] [INFO ] Time to serialize gal into /tmp/LTLFireability1372242555157252719.gal : 59 ms
[2024-05-29 19:18:19] [INFO ] Time to serialize properties into /tmp/LTLFireability4014042966050171611.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1372242555157252719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4014042966050171611.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((G((F("(((u154.p535==0)||(u158.p550==0))||(u161.p561==0))"))&&(F(G("(((u174.p608!=1)||(u175.p609!=1))||(u176.p613!=1))"))))))
Formula 0 simplified : F(G!"(((u154.p535==0)||(u158.p550==0))||(u161.p561==0))" | GF!"(((u174.p608!=1)||(u175.p609!=1))||(u176.p613!=1))")
Reverse transition relation is NOT exact ! Due to transitions t304, t307, t310, t317, t320, t324, t326, t331, t336, t339, t344, t348, t350, t356, t361, t36...4105
Computing Next relation with stutter on 2.394e+38 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7964284 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16179648 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVs-PT-050A, 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 r373-tall-171683789500533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A 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 ;