About the Execution of 2023-gold for FunctionPointer-PT-c128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.783 | 3600000.00 | 4477574.00 | 110494.10 | FFTTF?FTTFFFTTFF | 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.r197-tall-171640625100202.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 FunctionPointer-PT-c128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 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 FunctionPointer-PT-c128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716540288108
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 08:44:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 08:44:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:44:49] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2024-05-24 08:44:49] [INFO ] Transformed 2826 places.
[2024-05-24 08:44:50] [INFO ] Transformed 8960 transitions.
[2024-05-24 08:44:50] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 47 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3708
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3708
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 967 place count 1317 transition count 3346
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1120 place count 1164 transition count 3040
Iterating global reduction 2 with 153 rules applied. Total rules applied 1273 place count 1164 transition count 3040
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1345 place count 1164 transition count 2968
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1358 place count 1151 transition count 2942
Iterating global reduction 3 with 13 rules applied. Total rules applied 1371 place count 1151 transition count 2942
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1383 place count 1139 transition count 2918
Iterating global reduction 3 with 12 rules applied. Total rules applied 1395 place count 1139 transition count 2918
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1407 place count 1127 transition count 2894
Iterating global reduction 3 with 12 rules applied. Total rules applied 1419 place count 1127 transition count 2894
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1431 place count 1115 transition count 2870
Iterating global reduction 3 with 12 rules applied. Total rules applied 1443 place count 1115 transition count 2870
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1455 place count 1103 transition count 2846
Iterating global reduction 3 with 12 rules applied. Total rules applied 1467 place count 1103 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1478 place count 1092 transition count 2824
Iterating global reduction 3 with 11 rules applied. Total rules applied 1489 place count 1092 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1500 place count 1081 transition count 2802
Iterating global reduction 3 with 11 rules applied. Total rules applied 1511 place count 1081 transition count 2802
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1553 place count 1039 transition count 2646
Iterating global reduction 3 with 42 rules applied. Total rules applied 1595 place count 1039 transition count 2646
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1649 place count 985 transition count 2430
Iterating global reduction 3 with 54 rules applied. Total rules applied 1703 place count 985 transition count 2430
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1757 place count 931 transition count 2286
Iterating global reduction 3 with 54 rules applied. Total rules applied 1811 place count 931 transition count 2286
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1865 place count 877 transition count 2178
Iterating global reduction 3 with 54 rules applied. Total rules applied 1919 place count 877 transition count 2178
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1973 place count 823 transition count 2070
Iterating global reduction 3 with 54 rules applied. Total rules applied 2027 place count 823 transition count 2070
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2081 place count 769 transition count 1962
Iterating global reduction 3 with 54 rules applied. Total rules applied 2135 place count 769 transition count 1962
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2183 place count 721 transition count 1866
Iterating global reduction 3 with 48 rules applied. Total rules applied 2231 place count 721 transition count 1866
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2249 place count 703 transition count 1830
Iterating global reduction 3 with 18 rules applied. Total rules applied 2267 place count 703 transition count 1830
Applied a total of 2267 rules in 1386 ms. Remains 703 /1628 variables (removed 925) and now considering 1830/5962 (removed 4132) transitions.
[2024-05-24 08:44:51] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
// Phase 1: matrix 1231 rows 703 cols
[2024-05-24 08:44:51] [INFO ] Computed 2 invariants in 34 ms
[2024-05-24 08:44:52] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-24 08:44:52] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-24 08:44:52] [INFO ] Invariant cache hit.
[2024-05-24 08:44:52] [INFO ] State equation strengthened by 304 read => feed constraints.
[2024-05-24 08:44:55] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 4076 ms to find 0 implicit places.
[2024-05-24 08:44:55] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-24 08:44:55] [INFO ] Invariant cache hit.
[2024-05-24 08:44:56] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 703/1628 places, 1830/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6055 ms. Remains : 703/1628 places, 1830/5962 transitions.
Support contains 23 out of 703 places after structural reductions.
[2024-05-24 08:44:56] [INFO ] Flatten gal took : 135 ms
[2024-05-24 08:44:56] [INFO ] Flatten gal took : 94 ms
[2024-05-24 08:44:56] [INFO ] Input system was already deterministic with 1830 transitions.
Incomplete random walk after 10044 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
[2024-05-24 08:44:57] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-24 08:44:57] [INFO ] Invariant cache hit.
[2024-05-24 08:44:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:44:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:44:57] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 08:44:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 08:44:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:44:58] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 08:44:58] [INFO ] State equation strengthened by 304 read => feed constraints.
[2024-05-24 08:44:58] [INFO ] After 254ms SMT Verify possible using 304 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 08:44:59] [INFO ] After 662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-24 08:44:59] [INFO ] After 1630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 133 ms.
Support contains 9 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Graph (complete) has 3007 edges and 703 vertex of which 517 are kept as prefixes of interest. Removing 186 places using SCC suffix rule.6 ms
Discarding 186 places :
Also discarding 0 output transitions
Drop transitions removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 517 transition count 1458
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 381 place count 509 transition count 1442
Iterating global reduction 1 with 8 rules applied. Total rules applied 389 place count 509 transition count 1442
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 395 place count 509 transition count 1436
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 400 place count 504 transition count 1424
Iterating global reduction 2 with 5 rules applied. Total rules applied 405 place count 504 transition count 1424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 408 place count 501 transition count 1416
Iterating global reduction 2 with 3 rules applied. Total rules applied 411 place count 501 transition count 1416
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 414 place count 498 transition count 1410
Iterating global reduction 2 with 3 rules applied. Total rules applied 417 place count 498 transition count 1410
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 420 place count 495 transition count 1404
Iterating global reduction 2 with 3 rules applied. Total rules applied 423 place count 495 transition count 1404
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 426 place count 492 transition count 1398
Iterating global reduction 2 with 3 rules applied. Total rules applied 429 place count 492 transition count 1398
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 432 place count 489 transition count 1392
Iterating global reduction 2 with 3 rules applied. Total rules applied 435 place count 489 transition count 1392
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 440 place count 484 transition count 1376
Iterating global reduction 2 with 5 rules applied. Total rules applied 445 place count 484 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 449 place count 480 transition count 1360
Iterating global reduction 2 with 4 rules applied. Total rules applied 453 place count 480 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 457 place count 476 transition count 1350
Iterating global reduction 2 with 4 rules applied. Total rules applied 461 place count 476 transition count 1350
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 465 place count 472 transition count 1342
Iterating global reduction 2 with 4 rules applied. Total rules applied 469 place count 472 transition count 1342
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 473 place count 468 transition count 1334
Iterating global reduction 2 with 4 rules applied. Total rules applied 477 place count 468 transition count 1334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 481 place count 464 transition count 1326
Iterating global reduction 2 with 4 rules applied. Total rules applied 485 place count 464 transition count 1326
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 489 place count 460 transition count 1318
Iterating global reduction 2 with 4 rules applied. Total rules applied 493 place count 460 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 494 place count 459 transition count 1316
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 459 transition count 1316
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 505 place count 459 transition count 1306
Applied a total of 505 rules in 425 ms. Remains 459 /703 variables (removed 244) and now considering 1306/1830 (removed 524) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 459/703 places, 1306/1830 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 08:44:59] [INFO ] Flow matrix only has 754 transitions (discarded 552 similar events)
// Phase 1: matrix 754 rows 459 cols
[2024-05-24 08:44:59] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 08:45:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-24 08:45:00] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 08:45:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:00] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 08:45:00] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-24 08:45:00] [INFO ] After 150ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 08:45:00] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-24 08:45:00] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 6 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 1306/1306 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 457 transition count 1302
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 457 transition count 1302
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 457 transition count 1298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 455 transition count 1294
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 455 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 454 transition count 1292
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 454 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 453 transition count 1288
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 453 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 452 transition count 1286
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 452 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 451 transition count 1284
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 451 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 450 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 450 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 449 transition count 1280
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 449 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 448 transition count 1278
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 448 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 447 transition count 1276
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 447 transition count 1276
Applied a total of 28 rules in 164 ms. Remains 447 /459 variables (removed 12) and now considering 1276/1306 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 447/459 places, 1276/1306 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 08:45:01] [INFO ] Flow matrix only has 733 transitions (discarded 543 similar events)
// Phase 1: matrix 733 rows 447 cols
[2024-05-24 08:45:01] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 08:45:01] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:01] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:45:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 08:45:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:01] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:45:01] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-24 08:45:01] [INFO ] After 137ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:45:01] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-24 08:45:01] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1276/1276 transitions.
Graph (complete) has 2190 edges and 447 vertex of which 444 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 444 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 443 transition count 1268
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 443 transition count 1268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 443 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 442 transition count 1264
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 442 transition count 1264
Applied a total of 13 rules in 84 ms. Remains 442 /447 variables (removed 5) and now considering 1264/1276 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 442/447 places, 1264/1276 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 292870 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292870 steps, saw 179596 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 08:45:05] [INFO ] Flow matrix only has 722 transitions (discarded 542 similar events)
// Phase 1: matrix 722 rows 442 cols
[2024-05-24 08:45:05] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 08:45:05] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:45:05] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:45:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:45:05] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:45:05] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-24 08:45:05] [INFO ] After 145ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:45:05] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-24 08:45:05] [INFO ] After 649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 79 ms.
Support contains 4 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1264/1264 transitions.
Applied a total of 0 rules in 54 ms. Remains 442 /442 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 442/442 places, 1264/1264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1264/1264 transitions.
Applied a total of 0 rules in 48 ms. Remains 442 /442 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
[2024-05-24 08:45:06] [INFO ] Flow matrix only has 722 transitions (discarded 542 similar events)
[2024-05-24 08:45:06] [INFO ] Invariant cache hit.
[2024-05-24 08:45:06] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-24 08:45:06] [INFO ] Flow matrix only has 722 transitions (discarded 542 similar events)
[2024-05-24 08:45:06] [INFO ] Invariant cache hit.
[2024-05-24 08:45:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-24 08:45:08] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2024-05-24 08:45:08] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-24 08:45:08] [INFO ] Flow matrix only has 722 transitions (discarded 542 similar events)
[2024-05-24 08:45:08] [INFO ] Invariant cache hit.
[2024-05-24 08:45:08] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2776 ms. Remains : 442/442 places, 1264/1264 transitions.
Ensure Unique test removed 542 transitions
Reduce isomorphic transitions removed 542 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 442 transition count 713
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 561 place count 433 transition count 712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 432 transition count 712
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 562 place count 432 transition count 633
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 720 place count 353 transition count 633
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 980 place count 223 transition count 503
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1044 place count 159 transition count 375
Iterating global reduction 3 with 64 rules applied. Total rules applied 1108 place count 159 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1109 place count 159 transition count 374
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1172 place count 96 transition count 248
Iterating global reduction 4 with 63 rules applied. Total rules applied 1235 place count 96 transition count 248
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1298 place count 33 transition count 122
Iterating global reduction 4 with 63 rules applied. Total rules applied 1361 place count 33 transition count 122
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1424 place count 33 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1424 place count 33 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1426 place count 32 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1428 place count 31 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1432 place count 29 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1433 place count 29 transition count 56
Applied a total of 1433 rules in 56 ms. Remains 29 /442 variables (removed 413) and now considering 56/1264 (removed 1208) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 56 rows 29 cols
[2024-05-24 08:45:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 08:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 08:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:45:08] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 08:45:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:08] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:45:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:45:08] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:45:09] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 08:45:09] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FunctionPointer-PT-c128-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 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((p0 U (p1&&G(p2))))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 693 transition count 1810
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 693 transition count 1810
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 693 transition count 1802
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 685 transition count 1784
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 685 transition count 1784
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 679 transition count 1766
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 679 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 672 transition count 1744
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 672 transition count 1744
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 665 transition count 1726
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 665 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 658 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 658 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 651 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 651 transition count 1698
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 643 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 643 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 636 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 636 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 631 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 628 transition count 1640
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 625 transition count 1634
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 625 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 622 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 622 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 619 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 618 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 618 transition count 1620
Applied a total of 178 rules in 260 ms. Remains 618 /703 variables (removed 85) and now considering 1620/1830 (removed 210) transitions.
[2024-05-24 08:45:09] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
// Phase 1: matrix 1085 rows 618 cols
[2024-05-24 08:45:09] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 08:45:09] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-24 08:45:09] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-24 08:45:09] [INFO ] Invariant cache hit.
[2024-05-24 08:45:10] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 08:45:12] [INFO ] Implicit Places using invariants and state equation in 2440 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
[2024-05-24 08:45:12] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-24 08:45:12] [INFO ] Invariant cache hit.
[2024-05-24 08:45:12] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/703 places, 1620/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3608 ms. Remains : 618/703 places, 1620/1830 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 391 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s520), p0:(AND (GT s525 s538) (GT 1 s520) (LEQ s526 s70)), p2:(GT s525 s538)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-00 finished in 4063 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))))'
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 690 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 680 transition count 1768
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 680 transition count 1768
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 674 transition count 1750
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 674 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 667 transition count 1730
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 667 transition count 1730
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 660 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 660 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 653 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 638 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 638 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 627 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 627 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 621 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 618 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 185 place count 615 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 188 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 614 transition count 1608
Applied a total of 190 rules in 247 ms. Remains 614 /703 variables (removed 89) and now considering 1608/1830 (removed 222) transitions.
[2024-05-24 08:45:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 08:45:13] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 08:45:13] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-24 08:45:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:45:13] [INFO ] Invariant cache hit.
[2024-05-24 08:45:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:45:20] [INFO ] Implicit Places using invariants and state equation in 6333 ms returned []
Implicit Place search using SMT with State Equation took 6724 ms to find 0 implicit places.
[2024-05-24 08:45:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:45:20] [INFO ] Invariant cache hit.
[2024-05-24 08:45:20] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/703 places, 1608/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7501 ms. Remains : 614/703 places, 1608/1830 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 s535)], 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]]
Product exploration explored 100000 steps with 736 reset in 659 ms.
Product exploration explored 100000 steps with 732 reset in 569 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 553037 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553037 steps, saw 358955 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:45:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:45:25] [INFO ] Invariant cache hit.
[2024-05-24 08:45:25] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:25] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 08:45:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:45:25] [INFO ] After 85ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:25] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:45:26] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:26] [INFO ] After 121ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:26] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-24 08:45:26] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Graph (complete) has 2682 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1224
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 422 transition count 1220
Applied a total of 389 rules in 103 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1608 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 422/614 places, 1220/1608 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 656049 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656049 steps, saw 402275 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:45:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 08:45:29] [INFO ] Computed 3 invariants in 10 ms
[2024-05-24 08:45:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 08:45:29] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 08:45:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 08:45:29] [INFO ] After 39ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:29] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:30] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:30] [INFO ] After 44ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:30] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 08:45:30] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 50 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 08:45:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 08:45:30] [INFO ] Invariant cache hit.
[2024-05-24 08:45:30] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-24 08:45:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 08:45:30] [INFO ] Invariant cache hit.
[2024-05-24 08:45:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 08:45:32] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2024-05-24 08:45:32] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 08:45:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 08:45:32] [INFO ] Invariant cache hit.
[2024-05-24 08:45:32] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2487 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 41 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 08:45:32] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 08:45:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 08:45:32] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 08:45:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:45:32] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:32] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 08:45:32] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:32] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:32] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 08:45:32] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 16 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 08:45:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 08:45:33] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 08:45:33] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-24 08:45:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:45:33] [INFO ] Invariant cache hit.
[2024-05-24 08:45:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:45:35] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
[2024-05-24 08:45:35] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:45:35] [INFO ] Invariant cache hit.
[2024-05-24 08:45:35] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2694 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 566048 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566048 steps, saw 367399 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:45:39] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:45:39] [INFO ] Invariant cache hit.
[2024-05-24 08:45:39] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:39] [INFO ] After 245ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 08:45:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:45:39] [INFO ] After 81ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:39] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:45:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:45:39] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:39] [INFO ] After 118ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:40] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 08:45:40] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Graph (complete) has 2682 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1224
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 422 transition count 1220
Applied a total of 389 rules in 90 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1608 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 422/614 places, 1220/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662812 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662812 steps, saw 406423 distinct states, run finished after 3002 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:45:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 08:45:43] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 08:45:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 08:45:43] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 08:45:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 08:45:43] [INFO ] After 45ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:43] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 08:45:43] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:43] [INFO ] After 41ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:43] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 08:45:43] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 49 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 08:45:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 08:45:43] [INFO ] Invariant cache hit.
[2024-05-24 08:45:44] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-24 08:45:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 08:45:44] [INFO ] Invariant cache hit.
[2024-05-24 08:45:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 08:45:45] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-05-24 08:45:45] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 08:45:45] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 08:45:45] [INFO ] Invariant cache hit.
[2024-05-24 08:45:45] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1945 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 24 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 08:45:45] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 08:45:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 08:45:45] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 08:45:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:45:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:45:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 08:45:45] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:45:45] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 08:45:45] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 757 reset in 483 ms.
Product exploration explored 100000 steps with 743 reset in 496 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 277 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
[2024-05-24 08:45:47] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 08:45:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 08:45:47] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 08:45:48] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/614 places, 1604/1608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 829 ms. Remains : 614/614 places, 1604/1608 transitions.
Built C files in :
/tmp/ltsmin7328074671485958701
[2024-05-24 08:45:48] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7328074671485958701
Running compilation step : cd /tmp/ltsmin7328074671485958701;'/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 2933 ms.
Running link step : cd /tmp/ltsmin7328074671485958701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7328074671485958701;'/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' '--hoa' '/tmp/stateBased11239038450308935769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 12 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 08:46:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 08:46:03] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 08:46:03] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-24 08:46:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:46:03] [INFO ] Invariant cache hit.
[2024-05-24 08:46:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:46:10] [INFO ] Implicit Places using invariants and state equation in 6354 ms returned []
Implicit Place search using SMT with State Equation took 6722 ms to find 0 implicit places.
[2024-05-24 08:46:10] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:46:10] [INFO ] Invariant cache hit.
[2024-05-24 08:46:10] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7218 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin6034287249059954727
[2024-05-24 08:46:10] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6034287249059954727
Running compilation step : cd /tmp/ltsmin6034287249059954727;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6034287249059954727;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6034287249059954727;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 08:46:13] [INFO ] Flatten gal took : 72 ms
[2024-05-24 08:46:14] [INFO ] Flatten gal took : 61 ms
[2024-05-24 08:46:14] [INFO ] Time to serialize gal into /tmp/LTL16739519243632097086.gal : 11 ms
[2024-05-24 08:46:14] [INFO ] Time to serialize properties into /tmp/LTL10551412977310019170.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/LTL16739519243632097086.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16747748881620481784.hoa' '-atoms' '/tmp/LTL10551412977310019170.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...320
Loading property file /tmp/LTL10551412977310019170.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16747748881620481784.hoa
Detected timeout of ITS tools.
[2024-05-24 08:46:29] [INFO ] Flatten gal took : 74 ms
[2024-05-24 08:46:29] [INFO ] Flatten gal took : 69 ms
[2024-05-24 08:46:29] [INFO ] Time to serialize gal into /tmp/LTL15280780720749040900.gal : 9 ms
[2024-05-24 08:46:29] [INFO ] Time to serialize properties into /tmp/LTL9417610335082183013.ltl : 4 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/LTL15280780720749040900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9417610335082183013.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 : !((X(X(G("(l1645<2)")))))
Formula 0 simplified : XXF!"(l1645<2)"
Detected timeout of ITS tools.
[2024-05-24 08:46:44] [INFO ] Flatten gal took : 62 ms
[2024-05-24 08:46:44] [INFO ] Applying decomposition
[2024-05-24 08:46:44] [INFO ] Flatten gal took : 46 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/graph4211632130456987385.txt' '-o' '/tmp/graph4211632130456987385.bin' '-w' '/tmp/graph4211632130456987385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4211632130456987385.bin' '-l' '-1' '-v' '-w' '/tmp/graph4211632130456987385.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:46:44] [INFO ] Decomposing Gal with order
[2024-05-24 08:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:46:44] [INFO ] Removed a total of 2667 redundant transitions.
[2024-05-24 08:46:45] [INFO ] Flatten gal took : 219 ms
[2024-05-24 08:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1190 labels/synchronizations in 131 ms.
[2024-05-24 08:46:45] [INFO ] Time to serialize gal into /tmp/LTL2533628801473100307.gal : 31 ms
[2024-05-24 08:46:45] [INFO ] Time to serialize properties into /tmp/LTL9513914319346810498.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/LTL2533628801473100307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9513914319346810498.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 : !((X(X(G("(i26.i0.u147.l1645<2)")))))
Formula 0 simplified : XXF!"(i26.i0.u147.l1645<2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3590135760558961324
[2024-05-24 08:47:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3590135760558961324
Running compilation step : cd /tmp/ltsmin3590135760558961324;'/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 2799 ms.
Running link step : cd /tmp/ltsmin3590135760558961324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3590135760558961324;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-01 finished in 122170 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&&X(G((p0||X(X(X(G(p1))))))))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 218 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-24 08:47:15] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-24 08:47:15] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 08:47:16] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-24 08:47:16] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:47:16] [INFO ] Invariant cache hit.
[2024-05-24 08:47:16] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:47:18] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 2993 ms to find 0 implicit places.
[2024-05-24 08:47:18] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:47:18] [INFO ] Invariant cache hit.
[2024-05-24 08:47:19] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3754 ms. Remains : 636/703 places, 1662/1830 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 5}, { cond=p0, acceptance={0, 1} source=3 dest: 6}], [{ cond=true, acceptance={1} source=4 dest: 6}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 6}], [{ cond=p1, acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={1} source=9 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 7}]], initial=0, aps=[p0:(GT 2 s565), p1:(GT s559 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 681 reset in 569 ms.
Product exploration explored 100000 steps with 709 reset in 602 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10019 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 08:47:21] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:47:21] [INFO ] Invariant cache hit.
[2024-05-24 08:47:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:47:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:47:22] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:47:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:47:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:47:22] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:47:22] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:47:22] [INFO ] After 142ms SMT Verify possible using 272 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:47:22] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-24 08:47:22] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 107 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 444/636 places, 1270/1662 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:47:23] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-24 08:47:23] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 08:47:23] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:47:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:47:23] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:23] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:47:23] [INFO ] After 45ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:23] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 08:47:23] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 51 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 444/444 places, 1270/1270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620719 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620719 steps, saw 382354 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:47:26] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:26] [INFO ] Invariant cache hit.
[2024-05-24 08:47:26] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:47:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:47:26] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:26] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:47:26] [INFO ] After 69ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:27] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 08:47:27] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 49 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 50 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-24 08:47:27] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:27] [INFO ] Invariant cache hit.
[2024-05-24 08:47:27] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-24 08:47:27] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:27] [INFO ] Invariant cache hit.
[2024-05-24 08:47:27] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:47:28] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2024-05-24 08:47:28] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 08:47:28] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:28] [INFO ] Invariant cache hit.
[2024-05-24 08:47:29] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2120 ms. Remains : 444/444 places, 1270/1270 transitions.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 25 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-24 08:47:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 08:47:29] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 08:47:29] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:47:29] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:29] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 08:47:29] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 457 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 15 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-24 08:47:30] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-24 08:47:30] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 08:47:30] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-24 08:47:30] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:47:30] [INFO ] Invariant cache hit.
[2024-05-24 08:47:31] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:47:33] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
[2024-05-24 08:47:33] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:47:33] [INFO ] Invariant cache hit.
[2024-05-24 08:47:33] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3137 ms. Remains : 636/636 places, 1662/1662 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10045 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 08:47:34] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:47:34] [INFO ] Invariant cache hit.
[2024-05-24 08:47:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 08:47:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 08:47:34] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:47:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:47:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:47:35] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:47:35] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:47:35] [INFO ] After 143ms SMT Verify possible using 272 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:47:35] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-24 08:47:35] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 95 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 444/636 places, 1270/1662 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:47:35] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-24 08:47:35] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 08:47:35] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:47:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:47:35] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:35] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:47:36] [INFO ] After 38ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:36] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-24 08:47:36] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 47 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 444/444 places, 1270/1270 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 653839 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 653839 steps, saw 402754 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:47:39] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:39] [INFO ] Invariant cache hit.
[2024-05-24 08:47:39] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:47:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 08:47:39] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:39] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:47:39] [INFO ] After 68ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:39] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-24 08:47:39] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 51 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 50 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-24 08:47:39] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:39] [INFO ] Invariant cache hit.
[2024-05-24 08:47:40] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-24 08:47:40] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:40] [INFO ] Invariant cache hit.
[2024-05-24 08:47:40] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:47:42] [INFO ] Implicit Places using invariants and state equation in 2963 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2024-05-24 08:47:43] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 08:47:43] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:47:43] [INFO ] Invariant cache hit.
[2024-05-24 08:47:43] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3741 ms. Remains : 444/444 places, 1270/1270 transitions.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 26 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-24 08:47:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 08:47:43] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:47:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 08:47:43] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:47:43] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:47:43] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 08:47:43] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 416 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 416 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 752 reset in 512 ms.
Product exploration explored 100000 steps with 731 reset in 531 ms.
Built C files in :
/tmp/ltsmin12607827395749038609
[2024-05-24 08:47:46] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12607827395749038609
Running compilation step : cd /tmp/ltsmin12607827395749038609;'/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 2978 ms.
Running link step : cd /tmp/ltsmin12607827395749038609;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12607827395749038609;'/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' '--hoa' '/tmp/stateBased842473276405868958.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 22 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-24 08:48:01] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-24 08:48:01] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 08:48:01] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-24 08:48:01] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:48:01] [INFO ] Invariant cache hit.
[2024-05-24 08:48:02] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:48:04] [INFO ] Implicit Places using invariants and state equation in 3149 ms returned []
Implicit Place search using SMT with State Equation took 3533 ms to find 0 implicit places.
[2024-05-24 08:48:04] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:48:04] [INFO ] Invariant cache hit.
[2024-05-24 08:48:05] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4113 ms. Remains : 636/636 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin6092437396233819063
[2024-05-24 08:48:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6092437396233819063
Running compilation step : cd /tmp/ltsmin6092437396233819063;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6092437396233819063;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6092437396233819063;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 08:48:08] [INFO ] Flatten gal took : 45 ms
[2024-05-24 08:48:08] [INFO ] Flatten gal took : 43 ms
[2024-05-24 08:48:08] [INFO ] Time to serialize gal into /tmp/LTL15121949933516251031.gal : 8 ms
[2024-05-24 08:48:08] [INFO ] Time to serialize properties into /tmp/LTL6359063306342646728.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/LTL15121949933516251031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14558033902982551617.hoa' '-atoms' '/tmp/LTL6359063306342646728.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/LTL6359063306342646728.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14558033902982551617.hoa
Detected timeout of ITS tools.
[2024-05-24 08:48:23] [INFO ] Flatten gal took : 39 ms
[2024-05-24 08:48:23] [INFO ] Flatten gal took : 41 ms
[2024-05-24 08:48:23] [INFO ] Time to serialize gal into /tmp/LTL7897588073959050841.gal : 8 ms
[2024-05-24 08:48:23] [INFO ] Time to serialize properties into /tmp/LTL5381356649923305380.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/LTL7897588073959050841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5381356649923305380.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 : !((F(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
Detected timeout of ITS tools.
[2024-05-24 08:48:38] [INFO ] Flatten gal took : 40 ms
[2024-05-24 08:48:38] [INFO ] Applying decomposition
[2024-05-24 08:48:38] [INFO ] Flatten gal took : 38 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/graph5748110032318345017.txt' '-o' '/tmp/graph5748110032318345017.bin' '-w' '/tmp/graph5748110032318345017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5748110032318345017.bin' '-l' '-1' '-v' '-w' '/tmp/graph5748110032318345017.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:48:39] [INFO ] Decomposing Gal with order
[2024-05-24 08:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:48:39] [INFO ] Removed a total of 2779 redundant transitions.
[2024-05-24 08:48:39] [INFO ] Flatten gal took : 78 ms
[2024-05-24 08:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1234 labels/synchronizations in 69 ms.
[2024-05-24 08:48:39] [INFO ] Time to serialize gal into /tmp/LTL2046640879991904251.gal : 9 ms
[2024-05-24 08:48:39] [INFO ] Time to serialize properties into /tmp/LTL17162442496949821727.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/LTL2046640879991904251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17162442496949821727.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(("(i22.i4.u162.l2172<2)")&&(X(G(("(i22.i4.u162.l2172<2)")||(X(X(X(G("(i22.i2.u164.l1982>0)")))))))))))
Formula 0 simplified : G(!"(i22.i4.u162.l2172<2)" | XF(!"(i22.i4.u162.l2172<2)" & XXXF!"(i22.i2.u164.l1982>0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4226251165580664372
[2024-05-24 08:48:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4226251165580664372
Running compilation step : cd /tmp/ltsmin4226251165580664372;'/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 2957 ms.
Running link step : cd /tmp/ltsmin4226251165580664372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4226251165580664372;'/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)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 113976 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 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 691 transition count 1794
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 682 transition count 1772
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 682 transition count 1772
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 677 transition count 1756
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 671 transition count 1738
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 671 transition count 1738
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 665 transition count 1722
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 665 transition count 1722
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 659 transition count 1710
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 659 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 653 transition count 1698
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 641 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 641 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 140 place count 637 transition count 1658
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 637 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 635 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 635 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 633 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 633 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 631 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 631 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 629 transition count 1642
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 629 transition count 1642
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 629 transition count 1636
Applied a total of 166 rules in 407 ms. Remains 629 /703 variables (removed 74) and now considering 1636/1830 (removed 194) transitions.
[2024-05-24 08:49:09] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2024-05-24 08:49:09] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 08:49:10] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-24 08:49:10] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 08:49:10] [INFO ] Invariant cache hit.
[2024-05-24 08:49:10] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 08:49:17] [INFO ] Implicit Places using invariants and state equation in 6904 ms returned []
Implicit Place search using SMT with State Equation took 7302 ms to find 0 implicit places.
[2024-05-24 08:49:17] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 08:49:17] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 08:49:17] [INFO ] Invariant cache hit.
[2024-05-24 08:49:17] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/703 places, 1636/1830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8269 ms. Remains : 629/703 places, 1636/1830 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-06 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:(LEQ 3 s550), p1:(LEQ 1 s563)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-06 finished in 8400 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((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 680 transition count 1770
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 680 transition count 1770
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 673 transition count 1748
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 673 transition count 1748
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 665 transition count 1724
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 665 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 649 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 641 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 143 place count 632 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 152 place count 632 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 158 place count 626 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 164 place count 626 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 169 place count 621 transition count 1620
Iterating global reduction 1 with 5 rules applied. Total rules applied 174 place count 621 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 177 place count 618 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 180 place count 618 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 612 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 612 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 609 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 608 transition count 1594
Applied a total of 200 rules in 212 ms. Remains 608 /703 variables (removed 95) and now considering 1594/1830 (removed 236) transitions.
[2024-05-24 08:49:18] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
// Phase 1: matrix 1066 rows 608 cols
[2024-05-24 08:49:18] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 08:49:18] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-24 08:49:18] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-24 08:49:18] [INFO ] Invariant cache hit.
[2024-05-24 08:49:18] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 08:49:20] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
[2024-05-24 08:49:20] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-24 08:49:20] [INFO ] Invariant cache hit.
[2024-05-24 08:49:20] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 608/703 places, 1594/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2834 ms. Remains : 608/703 places, 1594/1830 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 2 s279), p1:(GT s522 s520)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6984 steps with 49 reset in 44 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-09 finished in 3041 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(F(p0)))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 679 transition count 1768
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 679 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 672 transition count 1746
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 672 transition count 1746
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 664 transition count 1722
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 656 transition count 1702
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 656 transition count 1702
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 648 transition count 1686
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 648 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 641 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 633 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 633 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 627 transition count 1636
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 172 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 174 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 176 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 178 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 615 transition count 1612
Applied a total of 186 rules in 199 ms. Remains 615 /703 variables (removed 88) and now considering 1612/1830 (removed 218) transitions.
[2024-05-24 08:49:21] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 08:49:21] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 08:49:21] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-24 08:49:21] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 08:49:21] [INFO ] Invariant cache hit.
[2024-05-24 08:49:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:49:24] [INFO ] Implicit Places using invariants and state equation in 2971 ms returned []
Implicit Place search using SMT with State Equation took 3366 ms to find 0 implicit places.
[2024-05-24 08:49:24] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 08:49:24] [INFO ] Invariant cache hit.
[2024-05-24 08:49:24] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/703 places, 1612/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4049 ms. Remains : 615/703 places, 1612/1830 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s143 s544)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 810 ms.
Product exploration explored 100000 steps with 50000 reset in 800 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c128-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c128-LTLCardinality-12 finished in 5775 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))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c128-LTLCardinality-01
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 690 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 680 transition count 1768
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 680 transition count 1768
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 674 transition count 1750
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 674 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 667 transition count 1730
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 667 transition count 1730
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 660 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 660 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 653 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 638 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 638 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 627 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 627 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 621 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 618 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 185 place count 615 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 188 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 614 transition count 1608
Applied a total of 190 rules in 259 ms. Remains 614 /703 variables (removed 89) and now considering 1608/1830 (removed 222) transitions.
[2024-05-24 08:49:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 08:49:27] [INFO ] Computed 2 invariants in 7 ms
[2024-05-24 08:49:27] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 08:49:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:49:27] [INFO ] Invariant cache hit.
[2024-05-24 08:49:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 08:49:29] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2024-05-24 08:49:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 08:49:29] [INFO ] Invariant cache hit.
[2024-05-24 08:49:29] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 614/703 places, 1608/1830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3029 ms. Remains : 614/703 places, 1608/1830 transitions.
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 s535)], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 36936 steps with 267 reset in 188 ms.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-01 finished in 3445 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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&&X(G((p0||X(X(X(G(p1))))))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c128-LTLCardinality-05
Stuttering acceptance computed with spot in 386 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 253 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-24 08:49:30] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-24 08:49:30] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 08:49:31] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-24 08:49:31] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:49:31] [INFO ] Invariant cache hit.
[2024-05-24 08:49:31] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:49:35] [INFO ] Implicit Places using invariants and state equation in 4369 ms returned []
Implicit Place search using SMT with State Equation took 4771 ms to find 0 implicit places.
[2024-05-24 08:49:35] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:49:35] [INFO ] Invariant cache hit.
[2024-05-24 08:49:36] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5527 ms. Remains : 636/703 places, 1662/1830 transitions.
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 5}, { cond=p0, acceptance={0, 1} source=3 dest: 6}], [{ cond=true, acceptance={1} source=4 dest: 6}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 6}], [{ cond=p1, acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={1} source=9 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 7}]], initial=0, aps=[p0:(GT 2 s565), p1:(GT s559 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 726 reset in 505 ms.
Product exploration explored 100000 steps with 735 reset in 521 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10035 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 282596 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{2=1, 4=1, 5=1}
Probabilistic random walk after 282596 steps, saw 183436 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-24 08:49:40] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:49:40] [INFO ] Invariant cache hit.
[2024-05-24 08:49:41] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:49:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:49:41] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:49:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 08:49:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:49:41] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:49:41] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:49:41] [INFO ] After 134ms SMT Verify possible using 272 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:49:42] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-24 08:49:42] [INFO ] After 857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 98 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 444/636 places, 1270/1662 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 322028 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322028 steps, saw 198377 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 08:49:45] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-24 08:49:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 08:49:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:49:45] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:49:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:49:46] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:49:46] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:49:46] [INFO ] After 108ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:49:46] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-24 08:49:46] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 44 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 44 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-24 08:49:46] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:49:46] [INFO ] Invariant cache hit.
[2024-05-24 08:49:46] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-24 08:49:46] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:49:46] [INFO ] Invariant cache hit.
[2024-05-24 08:49:46] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:49:48] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2024-05-24 08:49:48] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 08:49:48] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:49:48] [INFO ] Invariant cache hit.
[2024-05-24 08:49:48] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2255 ms. Remains : 444/444 places, 1270/1270 transitions.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 24 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-24 08:49:48] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 08:49:48] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 08:49:48] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 08:49:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 08:49:48] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 08:49:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:49:48] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 08:49:48] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 08:49:48] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 404 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 15 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-24 08:49:49] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-24 08:49:49] [INFO ] Computed 2 invariants in 7 ms
[2024-05-24 08:49:50] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-24 08:49:50] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:49:50] [INFO ] Invariant cache hit.
[2024-05-24 08:49:50] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:49:53] [INFO ] Implicit Places using invariants and state equation in 3158 ms returned []
Implicit Place search using SMT with State Equation took 3563 ms to find 0 implicit places.
[2024-05-24 08:49:53] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:49:53] [INFO ] Invariant cache hit.
[2024-05-24 08:49:53] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4081 ms. Remains : 636/636 places, 1662/1662 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:49:54] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:49:54] [INFO ] Invariant cache hit.
[2024-05-24 08:49:54] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:49:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 08:49:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 08:49:54] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:49:54] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:49:55] [INFO ] After 102ms SMT Verify possible using 272 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:49:55] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-24 08:49:55] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 96 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 444/636 places, 1270/1662 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646311 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646311 steps, saw 398117 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 08:49:58] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-24 08:49:58] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 08:49:58] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:49:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 08:49:58] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:49:58] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:49:58] [INFO ] After 43ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:49:58] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 08:49:58] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 47 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 49 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-24 08:49:58] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:49:58] [INFO ] Invariant cache hit.
[2024-05-24 08:49:59] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-24 08:49:59] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:49:59] [INFO ] Invariant cache hit.
[2024-05-24 08:49:59] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-24 08:50:00] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2024-05-24 08:50:00] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 08:50:00] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-24 08:50:00] [INFO ] Invariant cache hit.
[2024-05-24 08:50:00] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1892 ms. Remains : 444/444 places, 1270/1270 transitions.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 26 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-24 08:50:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 08:50:00] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 08:50:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 08:50:00] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 08:50:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 08:50:00] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 08:50:00] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 08:50:00] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 478 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 748 reset in 510 ms.
Product exploration explored 100000 steps with 716 reset in 525 ms.
Built C files in :
/tmp/ltsmin3669757058561950815
[2024-05-24 08:50:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3669757058561950815
Running compilation step : cd /tmp/ltsmin3669757058561950815;'/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 2995 ms.
Running link step : cd /tmp/ltsmin3669757058561950815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3669757058561950815;'/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' '--hoa' '/tmp/stateBased16147890715465512912.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 19 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-24 08:50:18] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-24 08:50:18] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 08:50:18] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-24 08:50:18] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:50:18] [INFO ] Invariant cache hit.
[2024-05-24 08:50:19] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-24 08:50:21] [INFO ] Implicit Places using invariants and state equation in 2881 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2024-05-24 08:50:21] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-24 08:50:21] [INFO ] Invariant cache hit.
[2024-05-24 08:50:22] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3830 ms. Remains : 636/636 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin6607852484106297243
[2024-05-24 08:50:22] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6607852484106297243
Running compilation step : cd /tmp/ltsmin6607852484106297243;'/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 2869 ms.
Running link step : cd /tmp/ltsmin6607852484106297243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6607852484106297243;'/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' '--hoa' '/tmp/stateBased7208815303607979175.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 08:50:37] [INFO ] Flatten gal took : 35 ms
[2024-05-24 08:50:37] [INFO ] Flatten gal took : 36 ms
[2024-05-24 08:50:37] [INFO ] Time to serialize gal into /tmp/LTL922076644509811717.gal : 22 ms
[2024-05-24 08:50:37] [INFO ] Time to serialize properties into /tmp/LTL13917039194127278218.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/LTL922076644509811717.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4604650363969919178.hoa' '-atoms' '/tmp/LTL13917039194127278218.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...317
Loading property file /tmp/LTL13917039194127278218.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4604650363969919178.hoa
Detected timeout of ITS tools.
[2024-05-24 08:50:52] [INFO ] Flatten gal took : 35 ms
[2024-05-24 08:50:52] [INFO ] Flatten gal took : 37 ms
[2024-05-24 08:50:52] [INFO ] Time to serialize gal into /tmp/LTL7537529280636272380.gal : 6 ms
[2024-05-24 08:50:52] [INFO ] Time to serialize properties into /tmp/LTL940316770640686648.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/LTL7537529280636272380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL940316770640686648.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...274
Read 1 LTL properties
Checking formula 0 : !((F(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
Detected timeout of ITS tools.
[2024-05-24 08:51:07] [INFO ] Flatten gal took : 36 ms
[2024-05-24 08:51:07] [INFO ] Applying decomposition
[2024-05-24 08:51:07] [INFO ] Flatten gal took : 35 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/graph18131771807550944352.txt' '-o' '/tmp/graph18131771807550944352.bin' '-w' '/tmp/graph18131771807550944352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18131771807550944352.bin' '-l' '-1' '-v' '-w' '/tmp/graph18131771807550944352.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:51:07] [INFO ] Decomposing Gal with order
[2024-05-24 08:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:51:08] [INFO ] Removed a total of 2780 redundant transitions.
[2024-05-24 08:51:08] [INFO ] Flatten gal took : 84 ms
[2024-05-24 08:51:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1235 labels/synchronizations in 37 ms.
[2024-05-24 08:51:08] [INFO ] Time to serialize gal into /tmp/LTL10336895325452678420.gal : 8 ms
[2024-05-24 08:51:08] [INFO ] Time to serialize properties into /tmp/LTL18050269120720811027.ltl : 55 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/LTL10336895325452678420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18050269120720811027.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 : !((F(("(i22.i4.u158.l2172<2)")&&(X(G(("(i22.i4.u158.l2172<2)")||(X(X(X(G("(i22.i3.u160.l1982>0)")))))))))))
Formula 0 simplified : G(!"(i22.i4.u158.l2172<2)" | XF(!"(i22.i4.u158.l2172<2)" & XXXF!"(i22.i3.u160.l1982>0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12986125543996617748
[2024-05-24 08:51:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12986125543996617748
Running compilation step : cd /tmp/ltsmin12986125543996617748;'/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 2869 ms.
Running link step : cd /tmp/ltsmin12986125543996617748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12986125543996617748;'/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)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 128252 ms.
[2024-05-24 08:51:38] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4463853950435843504
[2024-05-24 08:51:38] [INFO ] Too many transitions (1830) to apply POR reductions. Disabling POR matrices.
[2024-05-24 08:51:38] [INFO ] Applying decomposition
[2024-05-24 08:51:38] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4463853950435843504
Running compilation step : cd /tmp/ltsmin4463853950435843504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-24 08:51:38] [INFO ] Flatten gal took : 40 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/graph10507920273299756506.txt' '-o' '/tmp/graph10507920273299756506.bin' '-w' '/tmp/graph10507920273299756506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10507920273299756506.bin' '-l' '-1' '-v' '-w' '/tmp/graph10507920273299756506.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:51:38] [INFO ] Decomposing Gal with order
[2024-05-24 08:51:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:51:38] [INFO ] Removed a total of 3073 redundant transitions.
[2024-05-24 08:51:38] [INFO ] Flatten gal took : 75 ms
[2024-05-24 08:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1500 labels/synchronizations in 47 ms.
[2024-05-24 08:51:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality9853014099004515108.gal : 9 ms
[2024-05-24 08:51:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality5353353259332825393.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/LTLCardinality9853014099004515108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5353353259332825393.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 1 LTL properties
Checking formula 0 : !((F(("(i28.i5.u184.l2172<2)")&&(X(G(("(i28.i5.u184.l2172<2)")||(X(X(X(G("(i28.i3.u187.l1982>0)")))))))))))
Formula 0 simplified : G(!"(i28.i5.u184.l2172<2)" | XF(!"(i28.i5.u184.l2172<2)" & XXXF!"(i28.i3.u187.l1982>0)"))
Compilation finished in 3517 ms.
Running link step : cd /tmp/ltsmin4463853950435843504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4463853950435843504;'/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' '<>(((LTLAPp1==true)&&X([](((LTLAPp1==true)||X(X(X([]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: LTL layer: formula: <>(((LTLAPp1==true)&&X([](((LTLAPp1==true)||X(X(X([]((LTLAPp2==true))))))))))
pins2lts-mc-linux64( 5/ 8), 0.009: "<>(((LTLAPp1==true)&&X([](((LTLAPp1==true)||X(X(X([]((LTLAPp2==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.318: There are 1834 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.318: State length is 704, there are 1878 groups
pins2lts-mc-linux64( 0/ 8), 0.318: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.318: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.318: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.318: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.452: [Blue] ~120 levels ~960 states ~6312 transitions
pins2lts-mc-linux64( 1/ 8), 0.582: [Blue] ~240 levels ~1920 states ~12632 transitions
pins2lts-mc-linux64( 1/ 8), 0.805: [Blue] ~480 levels ~3840 states ~25240 transitions
pins2lts-mc-linux64( 1/ 8), 1.145: [Blue] ~960 levels ~7680 states ~48880 transitions
pins2lts-mc-linux64( 1/ 8), 1.680: [Blue] ~1920 levels ~15360 states ~83744 transitions
pins2lts-mc-linux64( 1/ 8), 2.764: [Blue] ~3840 levels ~30720 states ~180952 transitions
pins2lts-mc-linux64( 1/ 8), 4.677: [Blue] ~7680 levels ~61440 states ~385744 transitions
pins2lts-mc-linux64( 1/ 8), 8.439: [Blue] ~15360 levels ~122880 states ~796584 transitions
pins2lts-mc-linux64( 1/ 8), 15.039: [Blue] ~30720 levels ~245760 states ~1616992 transitions
pins2lts-mc-linux64( 1/ 8), 28.395: [Blue] ~61440 levels ~491520 states ~3257104 transitions
pins2lts-mc-linux64( 1/ 8), 55.199: [Blue] ~122880 levels ~983040 states ~6538192 transitions
pins2lts-mc-linux64( 4/ 8), 109.736: [Blue] ~245760 levels ~1966080 states ~11198056 transitions
pins2lts-mc-linux64( 4/ 8), 218.810: [Blue] ~491520 levels ~3932160 states ~22393784 transitions
pins2lts-mc-linux64( 1/ 8), 236.059: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 236.333:
pins2lts-mc-linux64( 0/ 8), 236.333: Explored 4117814 states 28627801 transitions, fanout: 6.952
pins2lts-mc-linux64( 0/ 8), 236.333: Total exploration time 235.980 sec (235.750 sec minimum, 235.865 sec on average)
pins2lts-mc-linux64( 0/ 8), 236.333: States per second: 17450, Transitions per second: 121315
pins2lts-mc-linux64( 0/ 8), 236.333:
pins2lts-mc-linux64( 0/ 8), 236.333: State space has 26994424 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 236.333: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 236.333: blue states: 4117814 (15.25%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 236.333: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 236.333: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 236.333:
pins2lts-mc-linux64( 0/ 8), 236.333: Total memory used for local state coloring: 62.8MB
pins2lts-mc-linux64( 0/ 8), 236.333:
pins2lts-mc-linux64( 0/ 8), 236.333: Queue width: 8B, total height: 4117558, memory: 31.41MB
pins2lts-mc-linux64( 0/ 8), 236.333: Tree memory: 462.0MB, 17.9 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 236.333: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 236.333: Stored 1871 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 236.333: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 236.333: Est. total memory use: 493.4MB (~1055.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4463853950435843504;'/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' '<>(((LTLAPp1==true)&&X([](((LTLAPp1==true)||X(X(X([]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4463853950435843504;'/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' '<>(((LTLAPp1==true)&&X([](((LTLAPp1==true)||X(X(X([]((LTLAPp2==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-24 09:13:54] [INFO ] Flatten gal took : 40 ms
[2024-05-24 09:13:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality7819447209190053050.gal : 6 ms
[2024-05-24 09:13:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality15241294331737150223.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/LTLCardinality7819447209190053050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15241294331737150223.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...298
Read 1 LTL properties
Checking formula 0 : !((F(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
Detected timeout of ITS tools.
[2024-05-24 09:36:12] [INFO ] Flatten gal took : 394 ms
[2024-05-24 09:36:14] [INFO ] Input system was already deterministic with 1830 transitions.
[2024-05-24 09:36:14] [INFO ] Transformed 703 places.
[2024-05-24 09:36:14] [INFO ] Transformed 1830 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 09:36:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality2612257667692407348.gal : 20 ms
[2024-05-24 09:36:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality9713453649898686568.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/LTLCardinality2612257667692407348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9713453649898686568.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8180188 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15889416 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="FunctionPointer-PT-c128"
export BK_EXAMINATION="LTLCardinality"
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 FunctionPointer-PT-c128, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625100202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;