About the Execution of 2023-gold for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13585.035 | 3600000.00 | 12561520.00 | 2194.50 | ?T??T?FFFTF?FF?F | 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.r153-tall-171631151600347.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 DoubleExponent-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K 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 DoubleExponent-PT-010-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716425355986
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=DoubleExponent-PT-010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 00:49:17] [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-23 00:49:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:49:17] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-23 00:49:17] [INFO ] Transformed 534 places.
[2024-05-23 00:49:17] [INFO ] Transformed 498 transitions.
[2024-05-23 00:49:17] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 531 transition count 498
Applied a total of 3 rules in 172 ms. Remains 531 /534 variables (removed 3) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 531 cols
[2024-05-23 00:49:18] [INFO ] Computed 52 invariants in 60 ms
[2024-05-23 00:49:18] [INFO ] Implicit Places using invariants in 455 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 525 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 528 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 528 transition count 497
Applied a total of 2 rules in 69 ms. Remains 528 /529 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 528 cols
[2024-05-23 00:49:18] [INFO ] Computed 50 invariants in 32 ms
[2024-05-23 00:49:18] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-23 00:49:18] [INFO ] Invariant cache hit.
[2024-05-23 00:49:20] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 528/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2672 ms. Remains : 528/534 places, 497/498 transitions.
Support contains 44 out of 528 places after structural reductions.
[2024-05-23 00:49:20] [INFO ] Flatten gal took : 66 ms
[2024-05-23 00:49:20] [INFO ] Flatten gal took : 30 ms
[2024-05-23 00:49:20] [INFO ] Input system was already deterministic with 497 transitions.
Support contains 43 out of 528 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-23 00:49:21] [INFO ] Invariant cache hit.
[2024-05-23 00:49:22] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-23 00:49:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-05-23 00:49:22] [INFO ] [Nat]Absence check using 6 positive and 44 generalized place invariants in 16 ms returned sat
[2024-05-23 00:49:24] [INFO ] After 1625ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :16
[2024-05-23 00:49:24] [INFO ] Deduced a trap composed of 186 places in 152 ms of which 5 ms to minimize.
[2024-05-23 00:49:24] [INFO ] Deduced a trap composed of 215 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:49:24] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:49:24] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:49:24] [INFO ] Deduced a trap composed of 198 places in 167 ms of which 1 ms to minimize.
[2024-05-23 00:49:25] [INFO ] Deduced a trap composed of 179 places in 146 ms of which 0 ms to minimize.
[2024-05-23 00:49:25] [INFO ] Deduced a trap composed of 211 places in 157 ms of which 1 ms to minimize.
[2024-05-23 00:49:25] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 1 ms to minimize.
[2024-05-23 00:49:25] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 0 ms to minimize.
[2024-05-23 00:49:25] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 0 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 218 places in 146 ms of which 0 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 222 places in 147 ms of which 0 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 0 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 0 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 149 places in 124 ms of which 1 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 197 places in 126 ms of which 1 ms to minimize.
[2024-05-23 00:49:26] [INFO ] Deduced a trap composed of 217 places in 126 ms of which 1 ms to minimize.
[2024-05-23 00:49:27] [INFO ] Deduced a trap composed of 186 places in 130 ms of which 0 ms to minimize.
[2024-05-23 00:49:27] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:49:27] [INFO ] Deduced a trap composed of 170 places in 128 ms of which 1 ms to minimize.
[2024-05-23 00:49:27] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 0 ms to minimize.
[2024-05-23 00:49:27] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 1 ms to minimize.
[2024-05-23 00:49:27] [INFO ] Deduced a trap composed of 224 places in 122 ms of which 1 ms to minimize.
[2024-05-23 00:49:28] [INFO ] Deduced a trap composed of 238 places in 137 ms of which 0 ms to minimize.
[2024-05-23 00:49:28] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 1 ms to minimize.
[2024-05-23 00:49:28] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4114 ms
[2024-05-23 00:49:29] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:49:29] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2024-05-23 00:49:29] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2024-05-23 00:49:29] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2024-05-23 00:49:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 640 ms
[2024-05-23 00:49:29] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-05-23 00:49:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-05-23 00:49:30] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 1 ms to minimize.
[2024-05-23 00:49:30] [INFO ] Deduced a trap composed of 168 places in 119 ms of which 0 ms to minimize.
[2024-05-23 00:49:30] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 0 ms to minimize.
[2024-05-23 00:49:30] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 0 ms to minimize.
[2024-05-23 00:49:30] [INFO ] Deduced a trap composed of 184 places in 121 ms of which 4 ms to minimize.
[2024-05-23 00:49:30] [INFO ] Deduced a trap composed of 197 places in 115 ms of which 1 ms to minimize.
[2024-05-23 00:49:31] [INFO ] Deduced a trap composed of 198 places in 108 ms of which 1 ms to minimize.
[2024-05-23 00:49:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1182 ms
[2024-05-23 00:49:31] [INFO ] Deduced a trap composed of 211 places in 141 ms of which 0 ms to minimize.
[2024-05-23 00:49:31] [INFO ] Deduced a trap composed of 203 places in 141 ms of which 0 ms to minimize.
[2024-05-23 00:49:31] [INFO ] Deduced a trap composed of 187 places in 136 ms of which 0 ms to minimize.
[2024-05-23 00:49:32] [INFO ] Deduced a trap composed of 200 places in 135 ms of which 0 ms to minimize.
[2024-05-23 00:49:32] [INFO ] Deduced a trap composed of 186 places in 141 ms of which 1 ms to minimize.
[2024-05-23 00:49:32] [INFO ] Deduced a trap composed of 204 places in 137 ms of which 1 ms to minimize.
[2024-05-23 00:49:32] [INFO ] Deduced a trap composed of 184 places in 132 ms of which 1 ms to minimize.
[2024-05-23 00:49:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1299 ms
[2024-05-23 00:49:32] [INFO ] Deduced a trap composed of 108 places in 86 ms of which 1 ms to minimize.
[2024-05-23 00:49:33] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:49:33] [INFO ] Deduced a trap composed of 127 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:49:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2024-05-23 00:49:33] [INFO ] Deduced a trap composed of 238 places in 146 ms of which 1 ms to minimize.
[2024-05-23 00:49:34] [INFO ] Deduced a trap composed of 233 places in 144 ms of which 1 ms to minimize.
[2024-05-23 00:49:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2024-05-23 00:49:34] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2024-05-23 00:49:34] [INFO ] Deduced a trap composed of 113 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:49:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2024-05-23 00:49:34] [INFO ] Deduced a trap composed of 218 places in 133 ms of which 1 ms to minimize.
[2024-05-23 00:49:35] [INFO ] Deduced a trap composed of 221 places in 143 ms of which 1 ms to minimize.
[2024-05-23 00:49:35] [INFO ] Deduced a trap composed of 222 places in 140 ms of which 0 ms to minimize.
[2024-05-23 00:49:35] [INFO ] Deduced a trap composed of 219 places in 136 ms of which 0 ms to minimize.
[2024-05-23 00:49:35] [INFO ] Deduced a trap composed of 222 places in 128 ms of which 0 ms to minimize.
[2024-05-23 00:49:35] [INFO ] Deduced a trap composed of 193 places in 145 ms of which 5 ms to minimize.
[2024-05-23 00:49:35] [INFO ] Deduced a trap composed of 169 places in 136 ms of which 1 ms to minimize.
[2024-05-23 00:49:36] [INFO ] Deduced a trap composed of 223 places in 141 ms of which 1 ms to minimize.
[2024-05-23 00:49:36] [INFO ] Deduced a trap composed of 191 places in 138 ms of which 1 ms to minimize.
[2024-05-23 00:49:36] [INFO ] Deduced a trap composed of 211 places in 143 ms of which 0 ms to minimize.
[2024-05-23 00:49:36] [INFO ] Deduced a trap composed of 216 places in 143 ms of which 0 ms to minimize.
[2024-05-23 00:49:36] [INFO ] Deduced a trap composed of 205 places in 141 ms of which 0 ms to minimize.
[2024-05-23 00:49:36] [INFO ] Deduced a trap composed of 224 places in 143 ms of which 1 ms to minimize.
[2024-05-23 00:49:37] [INFO ] Deduced a trap composed of 217 places in 144 ms of which 0 ms to minimize.
[2024-05-23 00:49:37] [INFO ] Deduced a trap composed of 187 places in 126 ms of which 1 ms to minimize.
[2024-05-23 00:49:37] [INFO ] Deduced a trap composed of 203 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:49:37] [INFO ] Deduced a trap composed of 198 places in 140 ms of which 1 ms to minimize.
[2024-05-23 00:49:37] [INFO ] Deduced a trap composed of 217 places in 142 ms of which 0 ms to minimize.
[2024-05-23 00:49:37] [INFO ] Deduced a trap composed of 189 places in 139 ms of which 1 ms to minimize.
[2024-05-23 00:49:38] [INFO ] Deduced a trap composed of 193 places in 142 ms of which 0 ms to minimize.
[2024-05-23 00:49:38] [INFO ] Deduced a trap composed of 221 places in 141 ms of which 1 ms to minimize.
[2024-05-23 00:49:38] [INFO ] Deduced a trap composed of 219 places in 146 ms of which 0 ms to minimize.
[2024-05-23 00:49:38] [INFO ] Deduced a trap composed of 233 places in 137 ms of which 0 ms to minimize.
[2024-05-23 00:49:38] [INFO ] Deduced a trap composed of 177 places in 136 ms of which 1 ms to minimize.
[2024-05-23 00:49:38] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4049 ms
[2024-05-23 00:49:38] [INFO ] After 16331ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :16
Attempting to minimize the solution found.
Minimization took 2161 ms.
[2024-05-23 00:49:40] [INFO ] After 18938ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :16
Fused 24 Parikh solutions to 15 different solutions.
Parikh walk visited 1 properties in 16292 ms.
Support contains 28 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 528 transition count 401
Reduce places removed 96 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 103 rules applied. Total rules applied 199 place count 432 transition count 394
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 206 place count 425 transition count 394
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 206 place count 425 transition count 373
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 248 place count 404 transition count 373
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 402 place count 327 transition count 296
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 434 place count 311 transition count 296
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 311 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 436 place count 310 transition count 295
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 4 with 39 rules applied. Total rules applied 475 place count 310 transition count 256
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 514 place count 271 transition count 256
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 555 place count 271 transition count 256
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 271 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 270 transition count 255
Applied a total of 557 rules in 133 ms. Remains 270 /528 variables (removed 258) and now considering 255/497 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 270/528 places, 255/497 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 798 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 255 rows 270 cols
[2024-05-23 00:49:59] [INFO ] Computed 50 invariants in 25 ms
[2024-05-23 00:49:59] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-23 00:49:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:49:59] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2024-05-23 00:50:00] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-23 00:50:00] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:50:00] [INFO ] After 522ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-23 00:50:00] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:50:01] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:50:02] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-05-23 00:50:03] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2681 ms
[2024-05-23 00:50:04] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-23 00:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-23 00:50:04] [INFO ] After 4235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 742 ms.
[2024-05-23 00:50:05] [INFO ] After 5552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 2933 ms.
Support contains 24 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 255/255 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 265 transition count 250
Applied a total of 10 rules in 19 ms. Remains 265 /270 variables (removed 5) and now considering 250/255 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 265/270 places, 250/255 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 191904 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{8=1}
Probabilistic random walk after 191904 steps, saw 95966 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 250 rows 265 cols
[2024-05-23 00:50:12] [INFO ] Computed 50 invariants in 16 ms
[2024-05-23 00:50:13] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-23 00:50:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:50:13] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 16 ms returned sat
[2024-05-23 00:50:13] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:50:14] [INFO ] After 538ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:14] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:50:14] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:50:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:50:14] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:50:14] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:50:14] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-23 00:50:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1340 ms
[2024-05-23 00:50:15] [INFO ] After 2434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 659 ms.
[2024-05-23 00:50:16] [INFO ] After 3566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 3070 ms.
Support contains 22 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 250/250 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 249
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 264 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 263 transition count 248
Applied a total of 4 rules in 29 ms. Remains 263 /265 variables (removed 2) and now considering 248/250 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 263/265 places, 248/250 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Probably explored full state space saw : 106745 states, properties seen :0
Probabilistic random walk after 213490 steps, saw 106745 distinct states, run finished after 2998 ms. (steps per millisecond=71 ) properties seen :0
Interrupted probabilistic random walk after 208656 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Exhaustive walk after 208656 steps, saw 104380 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 248 rows 263 cols
[2024-05-23 00:50:27] [INFO ] Computed 50 invariants in 20 ms
[2024-05-23 00:50:27] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-23 00:50:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-23 00:50:27] [INFO ] [Nat]Absence check using 6 positive and 44 generalized place invariants in 11 ms returned sat
[2024-05-23 00:50:27] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:50:28] [INFO ] After 472ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:28] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-23 00:50:28] [INFO ] After 976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 261 ms.
[2024-05-23 00:50:29] [INFO ] After 1730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 7378 ms.
Support contains 22 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 248/248 transitions.
Applied a total of 0 rules in 8 ms. Remains 263 /263 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 263/263 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 248/248 transitions.
Applied a total of 0 rules in 10 ms. Remains 263 /263 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-23 00:50:36] [INFO ] Invariant cache hit.
[2024-05-23 00:50:36] [INFO ] Implicit Places using invariants in 215 ms returned [20, 26, 50, 55, 82, 89, 111, 117, 143, 148, 149, 171, 176, 200, 207, 214, 254, 260]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 228 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/263 places, 248/248 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 245 transition count 243
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 240 transition count 243
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 240 transition count 243
Applied a total of 15 rules in 35 ms. Remains 240 /245 variables (removed 5) and now considering 243/248 (removed 5) transitions.
// Phase 1: matrix 243 rows 240 cols
[2024-05-23 00:50:36] [INFO ] Computed 32 invariants in 12 ms
[2024-05-23 00:50:36] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-23 00:50:36] [INFO ] Invariant cache hit.
[2024-05-23 00:50:37] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:50:38] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/263 places, 243/248 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1555 ms. Remains : 240/263 places, 243/248 transitions.
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 233908 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233908 steps, saw 116975 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 11 properties.
[2024-05-23 00:50:42] [INFO ] Invariant cache hit.
[2024-05-23 00:50:42] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-23 00:50:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 00:50:42] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-23 00:50:43] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:43] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:50:43] [INFO ] After 666ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:43] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 653 ms
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:50:44] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 1 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 5 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:50:45] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:50:46] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Deduced a trap composed of 109 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2894 ms
[2024-05-23 00:50:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-23 00:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-23 00:50:48] [INFO ] After 4853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 518 ms.
[2024-05-23 00:50:48] [INFO ] After 5870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 8818 ms.
Support contains 22 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 243/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 240/240 places, 243/243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 243/243 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-23 00:50:57] [INFO ] Invariant cache hit.
[2024-05-23 00:50:57] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 00:50:57] [INFO ] Invariant cache hit.
[2024-05-23 00:50:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-23 00:50:58] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-05-23 00:50:58] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-23 00:50:58] [INFO ] Invariant cache hit.
[2024-05-23 00:50:58] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1499 ms. Remains : 240/240 places, 243/243 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 240 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 238 transition count 241
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 4 place count 238 transition count 228
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 30 place count 225 transition count 228
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 37 place count 218 transition count 221
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 218 transition count 221
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 218 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 216 transition count 219
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 216 transition count 219
Applied a total of 49 rules in 33 ms. Remains 216 /240 variables (removed 24) and now considering 219/243 (removed 24) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 219 rows 216 cols
[2024-05-23 00:50:58] [INFO ] Computed 32 invariants in 14 ms
[2024-05-23 00:50:58] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-23 00:50:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-23 00:50:59] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-23 00:50:59] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:50:59] [INFO ] After 192ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-23 00:50:59] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 00:51:00] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-23 00:51:00] [INFO ] After 832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 334 ms.
[2024-05-23 00:51:00] [INFO ] After 1680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA DoubleExponent-PT-010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 896 edges and 528 vertex of which 525 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 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)))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 241 place count 405 transition count 354
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 276 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 502 place count 275 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 503 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 274 transition count 262
Applied a total of 504 rules in 70 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:51:00] [INFO ] Computed 49 invariants in 8 ms
[2024-05-23 00:51:01] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-23 00:51:01] [INFO ] Invariant cache hit.
[2024-05-23 00:51:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:51:02] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2024-05-23 00:51:02] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-23 00:51:02] [INFO ] Invariant cache hit.
[2024-05-23 00:51:02] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 274/528 places, 262/497 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 215 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s233 s223) (LEQ 1 s227))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13948 reset in 214 ms.
Product exploration explored 100000 steps with 13958 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 796 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 719148 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 719148 steps, saw 359683 distinct states, run finished after 3002 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:51:06] [INFO ] Invariant cache hit.
[2024-05-23 00:51:06] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:51:06] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 00:51:06] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:51:06] [INFO ] After 118ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-05-23 00:51:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-23 00:51:07] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:51:07] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-23 00:51:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 675 ms
[2024-05-23 00:51:07] [INFO ] After 829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-23 00:51:07] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 237 transition count 225
Applied a total of 113 rules in 18 ms. Remains 237 /274 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 237/274 places, 225/262 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 747930 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 747930 steps, saw 374218 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 237 cols
[2024-05-23 00:51:10] [INFO ] Computed 49 invariants in 19 ms
[2024-05-23 00:51:10] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:51:10] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-23 00:51:10] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:10] [INFO ] After 268ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:10] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 00:51:10] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 78 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 00:51:10] [INFO ] Invariant cache hit.
[2024-05-23 00:51:11] [INFO ] Implicit Places using invariants in 270 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 178, 184, 191, 228, 234]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 271 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 219 transition count 216
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 210 transition count 216
Applied a total of 18 rules in 8 ms. Remains 210 /219 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:51:11] [INFO ] Computed 31 invariants in 11 ms
[2024-05-23 00:51:11] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 00:51:11] [INFO ] Invariant cache hit.
[2024-05-23 00:51:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:12] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1797 ms. Remains : 210/237 places, 216/225 transitions.
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 836131 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 836131 steps, saw 418148 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:51:15] [INFO ] Invariant cache hit.
[2024-05-23 00:51:15] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 00:51:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:51:16] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:16] [INFO ] After 295ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:16] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:51:16] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:51:16] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2024-05-23 00:51:16] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 0 ms to minimize.
[2024-05-23 00:51:16] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:51:17] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:51:18] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-23 00:51:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-23 00:51:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-23 00:51:19] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2769 ms
[2024-05-23 00:51:19] [INFO ] After 3088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-23 00:51:19] [INFO ] After 3342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:51:19] [INFO ] Invariant cache hit.
[2024-05-23 00:51:19] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-23 00:51:19] [INFO ] Invariant cache hit.
[2024-05-23 00:51:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:20] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2024-05-23 00:51:20] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 00:51:20] [INFO ] Invariant cache hit.
[2024-05-23 00:51:20] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1374 ms. Remains : 210/210 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
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 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 16 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-23 00:51:20] [INFO ] Computed 31 invariants in 11 ms
[2024-05-23 00:51:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:51:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:51:20] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:51:20] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:20] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:51:20] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:51:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 924 ms
[2024-05-23 00:51:21] [INFO ] After 952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 00:51:21] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:51:21] [INFO ] Computed 49 invariants in 10 ms
[2024-05-23 00:51:22] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 00:51:22] [INFO ] Invariant cache hit.
[2024-05-23 00:51:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:51:23] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2024-05-23 00:51:23] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-23 00:51:23] [INFO ] Invariant cache hit.
[2024-05-23 00:51:23] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1401 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1394 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645575 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645575 steps, saw 322883 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:51:26] [INFO ] Invariant cache hit.
[2024-05-23 00:51:26] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:51:26] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 00:51:26] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:51:26] [INFO ] After 116ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:26] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-23 00:51:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 648 ms
[2024-05-23 00:51:27] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 00:51:27] [INFO ] After 995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 113 place count 237 transition count 225
Applied a total of 113 rules in 16 ms. Remains 237 /274 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 237/274 places, 225/262 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 673751 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 673751 steps, saw 337091 distinct states, run finished after 3002 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 237 cols
[2024-05-23 00:51:30] [INFO ] Computed 49 invariants in 27 ms
[2024-05-23 00:51:30] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:51:30] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-23 00:51:30] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:31] [INFO ] After 270ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:31] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-23 00:51:31] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 76 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 00:51:31] [INFO ] Invariant cache hit.
[2024-05-23 00:51:31] [INFO ] Implicit Places using invariants in 297 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 178, 184, 191, 228, 234]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 300 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 219 transition count 216
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 210 transition count 216
Applied a total of 18 rules in 9 ms. Remains 210 /219 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:51:31] [INFO ] Computed 31 invariants in 15 ms
[2024-05-23 00:51:31] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-23 00:51:31] [INFO ] Invariant cache hit.
[2024-05-23 00:51:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:33] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1652 ms. Remains : 210/237 places, 216/225 transitions.
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 885 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 736836 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 736836 steps, saw 368491 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:51:36] [INFO ] Invariant cache hit.
[2024-05-23 00:51:36] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 00:51:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-23 00:51:36] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:36] [INFO ] After 292ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:36] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:51:36] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:51:36] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2024-05-23 00:51:37] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:51:38] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:51:39] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2734 ms
[2024-05-23 00:51:39] [INFO ] After 3051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-23 00:51:39] [INFO ] After 3312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:51:39] [INFO ] Invariant cache hit.
[2024-05-23 00:51:39] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-23 00:51:39] [INFO ] Invariant cache hit.
[2024-05-23 00:51:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:51:40] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2024-05-23 00:51:40] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-23 00:51:40] [INFO ] Invariant cache hit.
[2024-05-23 00:51:41] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1535 ms. Remains : 210/210 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
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 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 12 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-23 00:51:41] [INFO ] Computed 31 invariants in 17 ms
[2024-05-23 00:51:41] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:51:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 00:51:41] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:51:41] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:51:41] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 0 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 0 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:51:41] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2024-05-23 00:51:42] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:51:42] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:51:42] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-23 00:51:42] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:51:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1077 ms
[2024-05-23 00:51:42] [INFO ] After 1101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 00:51:42] [INFO ] After 1271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13970 reset in 109 ms.
Product exploration explored 100000 steps with 13850 reset in 163 ms.
Built C files in :
/tmp/ltsmin15420010621882490024
[2024-05-23 00:51:43] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 00:51:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:51:43] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 00:51:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:51:43] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 00:51:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:51:43] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15420010621882490024
Running compilation step : cd /tmp/ltsmin15420010621882490024;'/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 610 ms.
Running link step : cd /tmp/ltsmin15420010621882490024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15420010621882490024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8645625875216548749.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:51:58] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 00:51:58] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-23 00:51:58] [INFO ] Invariant cache hit.
[2024-05-23 00:51:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:51:59] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2024-05-23 00:51:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:51:59] [INFO ] Invariant cache hit.
[2024-05-23 00:51:59] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1332 ms. Remains : 274/274 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin3955300330386764897
[2024-05-23 00:51:59] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 00:51:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:51:59] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 00:51:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:51:59] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 00:51:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:51:59] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3955300330386764897
Running compilation step : cd /tmp/ltsmin3955300330386764897;'/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 520 ms.
Running link step : cd /tmp/ltsmin3955300330386764897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3955300330386764897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased422996786639422928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:52:14] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:52:14] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:52:14] [INFO ] Time to serialize gal into /tmp/LTL15291920645551914036.gal : 4 ms
[2024-05-23 00:52:14] [INFO ] Time to serialize properties into /tmp/LTL9272522522258787400.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/LTL15291920645551914036.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6357070049002465177.hoa' '-atoms' '/tmp/LTL9272522522258787400.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9272522522258787400.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6357070049002465177.hoa
Detected timeout of ITS tools.
[2024-05-23 00:52:29] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:52:29] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:52:29] [INFO ] Time to serialize gal into /tmp/LTL12186913166106792479.gal : 5 ms
[2024-05-23 00:52:29] [INFO ] Time to serialize properties into /tmp/LTL9325990887339563469.ltl : 5 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/LTL12186913166106792479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9325990887339563469.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p502<=p481)||(p486>=1))"))))
Formula 0 simplified : FG!"((p502<=p481)||(p486>=1))"
Detected timeout of ITS tools.
[2024-05-23 00:52:44] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:52:44] [INFO ] Applying decomposition
[2024-05-23 00:52:44] [INFO ] Flatten gal took : 13 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/graph10633058863464629951.txt' '-o' '/tmp/graph10633058863464629951.bin' '-w' '/tmp/graph10633058863464629951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10633058863464629951.bin' '-l' '-1' '-v' '-w' '/tmp/graph10633058863464629951.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:52:44] [INFO ] Decomposing Gal with order
[2024-05-23 00:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:52:45] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-23 00:52:45] [INFO ] Flatten gal took : 55 ms
[2024-05-23 00:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 11 ms.
[2024-05-23 00:52:45] [INFO ] Time to serialize gal into /tmp/LTL8262025005191141931.gal : 6 ms
[2024-05-23 00:52:45] [INFO ] Time to serialize properties into /tmp/LTL12089159924568188740.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/LTL8262025005191141931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12089159924568188740.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu90.p502<=gu90.p481)||(gi0.gi1.gi1.gu92.p486>=1))"))))
Formula 0 simplified : FG!"((gu90.p502<=gu90.p481)||(gi0.gi1.gi1.gu92.p486>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7486408572590031875
[2024-05-23 00:53:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7486408572590031875
Running compilation step : cd /tmp/ltsmin7486408572590031875;'/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 426 ms.
Running link step : cd /tmp/ltsmin7486408572590031875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7486408572590031875;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-00 finished in 134508 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(p0))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 408 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 43 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:53:15] [INFO ] Computed 49 invariants in 15 ms
[2024-05-23 00:53:15] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-23 00:53:15] [INFO ] Invariant cache hit.
[2024-05-23 00:53:15] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 00:53:16] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-05-23 00:53:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:53:16] [INFO ] Invariant cache hit.
[2024-05-23 00:53:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1356 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-02 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}]], initial=1, aps=[p0:(LEQ s190 s256)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13796 reset in 129 ms.
Product exploration explored 100000 steps with 13803 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661877 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661877 steps, saw 331035 distinct states, run finished after 3004 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:53:20] [INFO ] Invariant cache hit.
[2024-05-23 00:53:20] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:53:20] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 9 ms returned sat
[2024-05-23 00:53:20] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 00:53:20] [INFO ] After 387ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:20] [INFO ] After 419ms 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-23 00:53:20] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 236 transition count 224
Applied a total of 116 rules in 17 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 236/274 places, 224/262 transitions.
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 676853 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 676853 steps, saw 338641 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 236 cols
[2024-05-23 00:53:24] [INFO ] Computed 49 invariants in 20 ms
[2024-05-23 00:53:24] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:53:24] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 15 ms returned sat
[2024-05-23 00:53:24] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:24] [INFO ] After 57ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:24] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-23 00:53:24] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 169 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-23 00:53:24] [INFO ] Invariant cache hit.
[2024-05-23 00:53:24] [INFO ] Implicit Places using invariants in 285 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 179, 185, 192, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 289 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 218 transition count 215
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 209 transition count 215
Applied a total of 18 rules in 9 ms. Remains 209 /218 variables (removed 9) and now considering 215/224 (removed 9) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:53:24] [INFO ] Computed 31 invariants in 12 ms
[2024-05-23 00:53:25] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-23 00:53:25] [INFO ] Invariant cache hit.
[2024-05-23 00:53:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:26] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1854 ms. Remains : 209/236 places, 215/224 transitions.
Incomplete random walk after 10000 steps, including 1389 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 725635 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725635 steps, saw 362894 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:53:29] [INFO ] Invariant cache hit.
[2024-05-23 00:53:29] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 00:53:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:53:29] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:29] [INFO ] After 88ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:29] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:53:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-23 00:53:30] [INFO ] After 253ms 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-23 00:53:30] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:53:30] [INFO ] Invariant cache hit.
[2024-05-23 00:53:30] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-23 00:53:30] [INFO ] Invariant cache hit.
[2024-05-23 00:53:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:31] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
[2024-05-23 00:53:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:53:31] [INFO ] Invariant cache hit.
[2024-05-23 00:53:31] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1804 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
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 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 17 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-23 00:53:31] [INFO ] Computed 31 invariants in 17 ms
[2024-05-23 00:53:31] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 00:53:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:53:32] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:53:32] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:32] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 00:53:32] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:53:32] [INFO ] Computed 49 invariants in 16 ms
[2024-05-23 00:53:32] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-23 00:53:32] [INFO ] Invariant cache hit.
[2024-05-23 00:53:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 00:53:33] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2024-05-23 00:53:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:53:33] [INFO ] Invariant cache hit.
[2024-05-23 00:53:33] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1376 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 787 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 668953 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668953 steps, saw 334565 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:53:37] [INFO ] Invariant cache hit.
[2024-05-23 00:53:37] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:53:37] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2024-05-23 00:53:37] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:37] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 00:53:37] [INFO ] After 386ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:37] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-23 00:53:37] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 236 transition count 224
Applied a total of 116 rules in 14 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 236/274 places, 224/262 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 697544 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 697544 steps, saw 348997 distinct states, run finished after 3004 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 236 cols
[2024-05-23 00:53:40] [INFO ] Computed 49 invariants in 13 ms
[2024-05-23 00:53:41] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:53:41] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 14 ms returned sat
[2024-05-23 00:53:41] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:41] [INFO ] After 55ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:41] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-23 00:53:41] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 164 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-23 00:53:41] [INFO ] Invariant cache hit.
[2024-05-23 00:53:41] [INFO ] Implicit Places using invariants in 286 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 179, 185, 192, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 293 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 218 transition count 215
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 209 transition count 215
Applied a total of 18 rules in 10 ms. Remains 209 /218 variables (removed 9) and now considering 215/224 (removed 9) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:53:41] [INFO ] Computed 31 invariants in 20 ms
[2024-05-23 00:53:42] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-23 00:53:42] [INFO ] Invariant cache hit.
[2024-05-23 00:53:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:44] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2564 ms. Remains : 209/236 places, 215/224 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 725646 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725646 steps, saw 362900 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:53:47] [INFO ] Invariant cache hit.
[2024-05-23 00:53:47] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 00:53:47] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 11 ms returned sat
[2024-05-23 00:53:47] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:47] [INFO ] After 89ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:47] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 00:53:47] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-23 00:53:47] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:53:47] [INFO ] Invariant cache hit.
[2024-05-23 00:53:47] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 00:53:47] [INFO ] Invariant cache hit.
[2024-05-23 00:53:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:53:49] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2024-05-23 00:53:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:53:49] [INFO ] Invariant cache hit.
[2024-05-23 00:53:49] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1676 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
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 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-23 00:53:49] [INFO ] Computed 31 invariants in 13 ms
[2024-05-23 00:53:49] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:53:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 00:53:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:53:49] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:53:49] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:53:49] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 00:53:49] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13815 reset in 107 ms.
Product exploration explored 100000 steps with 13826 reset in 112 ms.
Built C files in :
/tmp/ltsmin2383123270677483772
[2024-05-23 00:53:50] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 00:53:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:53:50] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 00:53:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:53:50] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 00:53:50] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:53:50] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2383123270677483772
Running compilation step : cd /tmp/ltsmin2383123270677483772;'/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 576 ms.
Running link step : cd /tmp/ltsmin2383123270677483772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2383123270677483772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15036385111224815694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:54:05] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 00:54:05] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-23 00:54:05] [INFO ] Invariant cache hit.
[2024-05-23 00:54:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 00:54:06] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2024-05-23 00:54:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:54:06] [INFO ] Invariant cache hit.
[2024-05-23 00:54:06] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1319 ms. Remains : 274/274 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin6180353339991918001
[2024-05-23 00:54:06] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 00:54:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:54:06] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 00:54:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:54:06] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 00:54:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:54:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6180353339991918001
Running compilation step : cd /tmp/ltsmin6180353339991918001;'/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 531 ms.
Running link step : cd /tmp/ltsmin6180353339991918001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6180353339991918001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3770120010254189507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:54:21] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:54:21] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:54:21] [INFO ] Time to serialize gal into /tmp/LTL17018021007270418060.gal : 2 ms
[2024-05-23 00:54:21] [INFO ] Time to serialize properties into /tmp/LTL6441824435892477979.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/LTL17018021007270418060.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16473718534092924365.hoa' '-atoms' '/tmp/LTL6441824435892477979.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/LTL6441824435892477979.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16473718534092924365.hoa
Detected timeout of ITS tools.
[2024-05-23 00:54:36] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:54:36] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:54:36] [INFO ] Time to serialize gal into /tmp/LTL2166664284443295790.gal : 2 ms
[2024-05-23 00:54:36] [INFO ] Time to serialize properties into /tmp/LTL18219587734393486790.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/LTL2166664284443295790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18219587734393486790.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("(p427<=p70)")))
Formula 0 simplified : F!"(p427<=p70)"
Detected timeout of ITS tools.
[2024-05-23 00:54:52] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:54:52] [INFO ] Applying decomposition
[2024-05-23 00:54:52] [INFO ] Flatten gal took : 11 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/graph296145299155850289.txt' '-o' '/tmp/graph296145299155850289.bin' '-w' '/tmp/graph296145299155850289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph296145299155850289.bin' '-l' '-1' '-v' '-w' '/tmp/graph296145299155850289.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:54:52] [INFO ] Decomposing Gal with order
[2024-05-23 00:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:54:52] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-23 00:54:52] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 10 ms.
[2024-05-23 00:54:52] [INFO ] Time to serialize gal into /tmp/LTL1120562091411334013.gal : 4 ms
[2024-05-23 00:54:52] [INFO ] Time to serialize properties into /tmp/LTL4222659359357555939.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/LTL1120562091411334013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4222659359357555939.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 : !((G("(gu98.p427<=gu98.p70)")))
Formula 0 simplified : F!"(gu98.p427<=gu98.p70)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16844168125846810848
[2024-05-23 00:55:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16844168125846810848
Running compilation step : cd /tmp/ltsmin16844168125846810848;'/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 437 ms.
Running link step : cd /tmp/ltsmin16844168125846810848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16844168125846810848;'/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))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-02 finished in 126963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 241 place count 405 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 30 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-23 00:55:22] [INFO ] Computed 49 invariants in 17 ms
[2024-05-23 00:55:22] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 00:55:22] [INFO ] Invariant cache hit.
[2024-05-23 00:55:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:55:23] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2024-05-23 00:55:23] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:55:23] [INFO ] Invariant cache hit.
[2024-05-23 00:55:23] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1408 ms. Remains : 277/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s76 s111), p0:(LEQ s171 s87)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13929 reset in 128 ms.
Product exploration explored 100000 steps with 13804 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 785 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 808 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 385075 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385075 steps, saw 192589 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 00:55:27] [INFO ] Invariant cache hit.
[2024-05-23 00:55:27] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:55:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:55:27] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 14 ms returned sat
[2024-05-23 00:55:27] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-23 00:55:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:55:27] [INFO ] After 79ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-23 00:55:27] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 00:55:27] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 264/264 transitions.
Graph (complete) has 809 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 263
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 38 place count 276 transition count 227
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 240 transition count 227
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 116 place count 240 transition count 227
Applied a total of 116 rules in 18 ms. Remains 240 /277 variables (removed 37) and now considering 227/264 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 240/277 places, 227/264 transitions.
Incomplete random walk after 10000 steps, including 1253 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 865 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 692818 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 692818 steps, saw 346619 distinct states, run finished after 3002 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 240 cols
[2024-05-23 00:55:31] [INFO ] Computed 49 invariants in 17 ms
[2024-05-23 00:55:31] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 00:55:31] [INFO ] [Nat]Absence check using 6 positive and 43 generalized place invariants in 23 ms returned sat
[2024-05-23 00:55:31] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:31] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:31] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-23 00:55:31] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-23 00:55:31] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-23 00:55:31] [INFO ] Invariant cache hit.
[2024-05-23 00:55:31] [INFO ] Implicit Places using invariants in 284 ms returned [20, 26, 46, 51, 74, 81, 102, 108, 130, 135, 136, 157, 162, 184, 190, 197, 231, 237]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 286 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/240 places, 227/227 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 222 transition count 218
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 213 transition count 218
Applied a total of 18 rules in 8 ms. Remains 213 /222 variables (removed 9) and now considering 218/227 (removed 9) transitions.
// Phase 1: matrix 218 rows 213 cols
[2024-05-23 00:55:31] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:55:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 00:55:31] [INFO ] Invariant cache hit.
[2024-05-23 00:55:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:33] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 1959 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 213/240 places, 218/227 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2258 ms. Remains : 213/240 places, 218/227 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 751813 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 751813 steps, saw 375987 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:55:36] [INFO ] Invariant cache hit.
[2024-05-23 00:55:36] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-23 00:55:36] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-23 00:55:36] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:36] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:36] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 00:55:37] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 213/213 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-05-23 00:55:37] [INFO ] Invariant cache hit.
[2024-05-23 00:55:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-23 00:55:37] [INFO ] Invariant cache hit.
[2024-05-23 00:55:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:38] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
[2024-05-23 00:55:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:55:38] [INFO ] Invariant cache hit.
[2024-05-23 00:55:38] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1925 ms. Remains : 213/213 places, 218/218 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 212 transition count 217
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 2 place count 212 transition count 200
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 195 transition count 200
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 186 transition count 191
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 186 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 185 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 185 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 183 transition count 188
Applied a total of 60 rules in 14 ms. Remains 183 /213 variables (removed 30) and now considering 188/218 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 188 rows 183 cols
[2024-05-23 00:55:38] [INFO ] Computed 31 invariants in 12 ms
[2024-05-23 00:55:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 00:55:39] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-23 00:55:39] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:55:39] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:39] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:55:39] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:55:39] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:55:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
[2024-05-23 00:55:39] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 00:55:39] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 155 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 277 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 264/264 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-23 00:55:39] [INFO ] Computed 49 invariants in 13 ms
[2024-05-23 00:55:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 00:55:39] [INFO ] Invariant cache hit.
[2024-05-23 00:55:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:55:40] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2024-05-23 00:55:41] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:55:41] [INFO ] Invariant cache hit.
[2024-05-23 00:55:41] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1421 ms. Remains : 277/277 places, 264/264 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 799 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 663245 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663245 steps, saw 331716 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:55:44] [INFO ] Invariant cache hit.
[2024-05-23 00:55:44] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:55:44] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2024-05-23 00:55:44] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:55:44] [INFO ] After 53ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:44] [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 16 ms.
[2024-05-23 00:55:44] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 264/264 transitions.
Graph (complete) has 809 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 276 transition count 262
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 274 transition count 261
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 1 with 2 rules applied. Total rules applied 8 place count 273 transition count 261
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 44 place count 273 transition count 225
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 80 place count 237 transition count 225
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 121 place count 237 transition count 225
Applied a total of 121 rules in 23 ms. Remains 237 /277 variables (removed 40) and now considering 225/264 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 237/277 places, 225/264 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 694996 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694996 steps, saw 347713 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 237 cols
[2024-05-23 00:55:47] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 00:55:47] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-23 00:55:47] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-23 00:55:47] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:47] [INFO ] After 46ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:47] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-23 00:55:47] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-23 00:55:48] [INFO ] Invariant cache hit.
[2024-05-23 00:55:48] [INFO ] Implicit Places using invariants in 262 ms returned [20, 26, 46, 51, 74, 79, 100, 106, 128, 133, 134, 154, 159, 181, 187, 194, 228, 234]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 263 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 219 transition count 216
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 210 transition count 216
Applied a total of 18 rules in 7 ms. Remains 210 /219 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:55:48] [INFO ] Computed 31 invariants in 13 ms
[2024-05-23 00:55:48] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-23 00:55:48] [INFO ] Invariant cache hit.
[2024-05-23 00:55:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:49] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1785 ms. Remains : 210/237 places, 216/225 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 264449 states, properties seen :0
Probabilistic random walk after 528905 steps, saw 264449 distinct states, run finished after 2137 ms. (steps per millisecond=247 ) properties seen :0
Interrupted probabilistic random walk after 741854 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Exhaustive walk after 741854 steps, saw 371008 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:55:54] [INFO ] Invariant cache hit.
[2024-05-23 00:55:54] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-23 00:55:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:55:55] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:55] [INFO ] After 32ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:55] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 00:55:55] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:55:55] [INFO ] Invariant cache hit.
[2024-05-23 00:55:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-23 00:55:55] [INFO ] Invariant cache hit.
[2024-05-23 00:55:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:55:56] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-23 00:55:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:55:56] [INFO ] Invariant cache hit.
[2024-05-23 00:55:56] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1710 ms. Remains : 210/210 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 210 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 180 transition count 186
Applied a total of 60 rules in 10 ms. Remains 180 /210 variables (removed 30) and now considering 186/216 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-23 00:55:56] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:55:56] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 00:55:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-23 00:55:57] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:55:57] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:55:57] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 00:55:57] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13874 reset in 121 ms.
Product exploration explored 100000 steps with 13861 reset in 120 ms.
Built C files in :
/tmp/ltsmin9448643094489248905
[2024-05-23 00:55:57] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-23 00:55:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:55:57] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-23 00:55:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:55:57] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-23 00:55:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:55:57] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9448643094489248905
Running compilation step : cd /tmp/ltsmin9448643094489248905;'/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 530 ms.
Running link step : cd /tmp/ltsmin9448643094489248905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9448643094489248905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4859818885867260116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 264/264 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 277 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 263
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 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 274 transition count 262
Applied a total of 6 rules in 13 ms. Remains 274 /277 variables (removed 3) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 00:56:12] [INFO ] Computed 49 invariants in 17 ms
[2024-05-23 00:56:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-23 00:56:13] [INFO ] Invariant cache hit.
[2024-05-23 00:56:13] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:56:14] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2024-05-23 00:56:14] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:56:14] [INFO ] Invariant cache hit.
[2024-05-23 00:56:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/277 places, 262/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1363 ms. Remains : 274/277 places, 262/264 transitions.
Built C files in :
/tmp/ltsmin8083881145146317741
[2024-05-23 00:56:14] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 00:56:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:56:14] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 00:56:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:56:14] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 00:56:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:56:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8083881145146317741
Running compilation step : cd /tmp/ltsmin8083881145146317741;'/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 524 ms.
Running link step : cd /tmp/ltsmin8083881145146317741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8083881145146317741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15987120377336110228.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:56:29] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:56:29] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:56:29] [INFO ] Time to serialize gal into /tmp/LTL10237071710209723561.gal : 2 ms
[2024-05-23 00:56:29] [INFO ] Time to serialize properties into /tmp/LTL2820866843816534713.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/LTL10237071710209723561.gal' '-t' 'CGAL' '-hoa' '/tmp/aut898520970503292356.hoa' '-atoms' '/tmp/LTL2820866843816534713.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/LTL2820866843816534713.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut898520970503292356.hoa
Detected timeout of ITS tools.
[2024-05-23 00:56:44] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:56:44] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:56:44] [INFO ] Time to serialize gal into /tmp/LTL7087484791306737549.gal : 2 ms
[2024-05-23 00:56:44] [INFO ] Time to serialize properties into /tmp/LTL6583204932245251966.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/LTL7087484791306737549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6583204932245251966.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(G(("(p382<=p245)")U("(p227<=p284)")))))
Formula 0 simplified : GF(!"(p382<=p245)" R !"(p227<=p284)")
Detected timeout of ITS tools.
[2024-05-23 00:56:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:56:59] [INFO ] Applying decomposition
[2024-05-23 00:56:59] [INFO ] Flatten gal took : 9 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/graph17162195702976053122.txt' '-o' '/tmp/graph17162195702976053122.bin' '-w' '/tmp/graph17162195702976053122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17162195702976053122.bin' '-l' '-1' '-v' '-w' '/tmp/graph17162195702976053122.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:56:59] [INFO ] Decomposing Gal with order
[2024-05-23 00:56:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:56:59] [INFO ] Removed a total of 194 redundant transitions.
[2024-05-23 00:56:59] [INFO ] Flatten gal took : 20 ms
[2024-05-23 00:56:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2024-05-23 00:56:59] [INFO ] Time to serialize gal into /tmp/LTL5637699431745205065.gal : 4 ms
[2024-05-23 00:56:59] [INFO ] Time to serialize properties into /tmp/LTL14484502978591500633.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/LTL5637699431745205065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14484502978591500633.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 : !((F(G(("(gu33.p382<=gu33.p245)")U("(gu43.p227<=gu43.p284)")))))
Formula 0 simplified : GF(!"(gu33.p382<=gu33.p245)" R !"(gu43.p227<=gu43.p284)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15310050332227529468
[2024-05-23 00:57:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15310050332227529468
Running compilation step : cd /tmp/ltsmin15310050332227529468;'/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 442 ms.
Running link step : cd /tmp/ltsmin15310050332227529468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15310050332227529468;'/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) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-03 finished in 127495 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((X(X(X(p0)))&&F(p1))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 14 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 00:57:29] [INFO ] Computed 49 invariants in 23 ms
[2024-05-23 00:57:30] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-23 00:57:30] [INFO ] Invariant cache hit.
[2024-05-23 00:57:32] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2310 ms to find 0 implicit places.
[2024-05-23 00:57:32] [INFO ] Invariant cache hit.
[2024-05-23 00:57:32] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2562 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}]], initial=0, aps=[p1:(GT 1 s106), p0:(GT 2 s12)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 291 ms.
Product exploration explored 100000 steps with 25000 reset in 261 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 00:57:33] [INFO ] Invariant cache hit.
[2024-05-23 00:57:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-23 00:57:33] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 14 ms returned sat
[2024-05-23 00:57:34] [INFO ] After 381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 00:57:34] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2024-05-23 00:57:34] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 0 ms to minimize.
[2024-05-23 00:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2024-05-23 00:57:34] [INFO ] After 731ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 00:57:34] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 00:57:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:34] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 00:57:35] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-23 00:57:35] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 0 ms to minimize.
[2024-05-23 00:57:35] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2024-05-23 00:57:35] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2024-05-23 00:57:35] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2024-05-23 00:57:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 591 ms
[2024-05-23 00:57:35] [INFO ] After 916ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-23 00:57:35] [INFO ] After 1020ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 244 place count 404 transition count 353
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 472 place count 290 transition count 260
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 545 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 582 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 622 place count 235 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 234 transition count 222
Applied a total of 623 rules in 38 ms. Remains 234 /527 variables (removed 293) and now considering 222/497 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 234/527 places, 222/497 transitions.
Incomplete random walk after 10000 steps, including 1316 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 689225 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 689225 steps, saw 344833 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2024-05-23 00:57:38] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 00:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:38] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-23 00:57:39] [INFO ] After 105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:57:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:57:39] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:39] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:57:39] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 11 ms returned sat
[2024-05-23 00:57:39] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:39] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:39] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-23 00:57:39] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 00:57:39] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-23 00:57:39] [INFO ] Invariant cache hit.
[2024-05-23 00:57:39] [INFO ] Implicit Places using invariants in 276 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 285 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 216 transition count 214
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 10 ms. Remains 208 /216 variables (removed 8) and now considering 214/222 (removed 8) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-23 00:57:39] [INFO ] Computed 31 invariants in 15 ms
[2024-05-23 00:57:39] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-23 00:57:39] [INFO ] Invariant cache hit.
[2024-05-23 00:57:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:57:41] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/234 places, 214/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1934 ms. Remains : 208/234 places, 214/222 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 938 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 735192 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 735192 steps, saw 367675 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:57:44] [INFO ] Invariant cache hit.
[2024-05-23 00:57:44] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-23 00:57:44] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-23 00:57:44] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:57:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:57:44] [INFO ] After 139ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:44] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 00:57:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:57:44] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:45] [INFO ] After 133ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:45] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-23 00:57:45] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 00:57:45] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:57:45] [INFO ] Invariant cache hit.
[2024-05-23 00:57:45] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-23 00:57:45] [INFO ] Invariant cache hit.
[2024-05-23 00:57:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 00:57:46] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
[2024-05-23 00:57:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:57:46] [INFO ] Invariant cache hit.
[2024-05-23 00:57:46] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1815 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 10 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-23 00:57:47] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 00:57:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 00:57:47] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 7 ms returned sat
[2024-05-23 00:57:47] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:57:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:57:47] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 00:57:47] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-23 00:57:47] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:47] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 00:57:47] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-23 00:57:47] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:47] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:47] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:57:47] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:57:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-23 00:57:47] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 00:57:47] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 10 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 00:57:47] [INFO ] Computed 49 invariants in 24 ms
[2024-05-23 00:57:48] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-23 00:57:48] [INFO ] Invariant cache hit.
[2024-05-23 00:57:50] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
[2024-05-23 00:57:50] [INFO ] Invariant cache hit.
[2024-05-23 00:57:50] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2354 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 251 ms.
Product exploration explored 100000 steps with 25000 reset in 258 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 139 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 140 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 522 transition count 511
Deduced a syphon composed of 135 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 522 transition count 511
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 228 places in 2 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 241 place count 522 transition count 531
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 242 place count 521 transition count 530
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 243 place count 521 transition count 530
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 247 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 263 place count 521 transition count 651
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 284 place count 500 transition count 609
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 305 place count 500 transition count 609
Deduced a syphon composed of 226 places in 1 ms
Applied a total of 305 rules in 112 ms. Remains 500 /527 variables (removed 27) and now considering 609/497 (removed -112) transitions.
[2024-05-23 00:57:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 609 rows 500 cols
[2024-05-23 00:57:52] [INFO ] Computed 49 invariants in 23 ms
[2024-05-23 00:57:52] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 609/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 500/527 places, 609/497 transitions.
Built C files in :
/tmp/ltsmin8744512084399544365
[2024-05-23 00:57:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8744512084399544365
Running compilation step : cd /tmp/ltsmin8744512084399544365;'/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 750 ms.
Running link step : cd /tmp/ltsmin8744512084399544365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8744512084399544365;'/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/stateBased4833811709871881525.hoa' '--buchi-type=spotba'
LTSmin run took 418 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLCardinality-04 finished in 23746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 405 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 243 place count 404 transition count 354
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 467 place count 292 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 34 ms. Remains 273 /528 variables (removed 255) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 00:57:53] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 00:57:53] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-23 00:57:53] [INFO ] Invariant cache hit.
[2024-05-23 00:57:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:57:54] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2024-05-23 00:57:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:57:54] [INFO ] Invariant cache hit.
[2024-05-23 00:57:55] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1505 ms. Remains : 273/528 places, 261/497 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s137 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13922 reset in 105 ms.
Product exploration explored 100000 steps with 13850 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1373 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 832 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649877 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649877 steps, saw 325037 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:57:58] [INFO ] Invariant cache hit.
[2024-05-23 00:57:58] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:57:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:57:58] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2024-05-23 00:57:58] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:57:58] [INFO ] After 60ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:57:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-23 00:57:58] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-23 00:57:59] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 17 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 235/273 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1321 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 686067 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 686067 steps, saw 343246 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2024-05-23 00:58:02] [INFO ] Computed 49 invariants in 13 ms
[2024-05-23 00:58:02] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:58:02] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-23 00:58:02] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:02] [INFO ] After 53ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 00:58:02] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-05-23 00:58:02] [INFO ] After 426ms 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 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 00:58:02] [INFO ] Invariant cache hit.
[2024-05-23 00:58:02] [INFO ] Implicit Places using invariants in 290 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 293 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 10 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-23 00:58:02] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:58:03] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 00:58:03] [INFO ] Invariant cache hit.
[2024-05-23 00:58:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:04] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2076 ms. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1460 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 752218 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 752218 steps, saw 376185 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:58:07] [INFO ] Invariant cache hit.
[2024-05-23 00:58:07] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 00:58:07] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:58:07] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:07] [INFO ] After 59ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:08] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-23 00:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-23 00:58:08] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-23 00:58:08] [INFO ] After 368ms 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 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:58:08] [INFO ] Invariant cache hit.
[2024-05-23 00:58:08] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 00:58:08] [INFO ] Invariant cache hit.
[2024-05-23 00:58:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:09] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
[2024-05-23 00:58:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:58:09] [INFO ] Invariant cache hit.
[2024-05-23 00:58:09] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1800 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
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 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 12 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-23 00:58:09] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:58:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:58:10] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-23 00:58:10] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:58:10] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:10] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-23 00:58:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-23 00:58:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-23 00:58:10] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-23 00:58:10] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 00:58:10] [INFO ] Computed 49 invariants in 16 ms
[2024-05-23 00:58:10] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 00:58:10] [INFO ] Invariant cache hit.
[2024-05-23 00:58:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:58:11] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-05-23 00:58:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:58:11] [INFO ] Invariant cache hit.
[2024-05-23 00:58:11] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1276 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1368 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 653727 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 653727 steps, saw 326954 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:58:14] [INFO ] Invariant cache hit.
[2024-05-23 00:58:14] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:58:14] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2024-05-23 00:58:15] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:58:15] [INFO ] After 55ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:15] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-23 00:58:15] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-23 00:58:15] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 811 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 13 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 235/273 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 695712 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695712 steps, saw 348065 distinct states, run finished after 3002 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2024-05-23 00:58:18] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 00:58:18] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:58:18] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-23 00:58:18] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:18] [INFO ] After 52ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:18] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-23 00:58:18] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-23 00:58:18] [INFO ] After 427ms 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 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 00:58:18] [INFO ] Invariant cache hit.
[2024-05-23 00:58:19] [INFO ] Implicit Places using invariants in 279 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 280 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 6 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-23 00:58:19] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:58:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 00:58:19] [INFO ] Invariant cache hit.
[2024-05-23 00:58:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:20] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2092 ms. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 755345 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 755345 steps, saw 377750 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:58:24] [INFO ] Invariant cache hit.
[2024-05-23 00:58:24] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 00:58:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:58:24] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:24] [INFO ] After 60ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:24] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:58:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-23 00:58:24] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-23 00:58:24] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:58:24] [INFO ] Invariant cache hit.
[2024-05-23 00:58:24] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-23 00:58:24] [INFO ] Invariant cache hit.
[2024-05-23 00:58:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 00:58:26] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2024-05-23 00:58:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:58:26] [INFO ] Invariant cache hit.
[2024-05-23 00:58:26] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1688 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
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 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 11 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-23 00:58:26] [INFO ] Computed 31 invariants in 12 ms
[2024-05-23 00:58:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:58:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:58:26] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-23 00:58:26] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:58:26] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:58:26] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-23 00:58:26] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-23 00:58:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-23 00:58:26] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 00:58:26] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13934 reset in 106 ms.
Product exploration explored 100000 steps with 13859 reset in 112 ms.
Built C files in :
/tmp/ltsmin15535681987683716337
[2024-05-23 00:58:26] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-23 00:58:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:58:26] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-23 00:58:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:58:26] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-23 00:58:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:58:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15535681987683716337
Running compilation step : cd /tmp/ltsmin15535681987683716337;'/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 530 ms.
Running link step : cd /tmp/ltsmin15535681987683716337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15535681987683716337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13898222030207814896.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 00:58:42] [INFO ] Computed 49 invariants in 10 ms
[2024-05-23 00:58:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 00:58:42] [INFO ] Invariant cache hit.
[2024-05-23 00:58:42] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 00:58:43] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2024-05-23 00:58:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:58:43] [INFO ] Invariant cache hit.
[2024-05-23 00:58:43] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 273/273 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin14447838558233959424
[2024-05-23 00:58:43] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-23 00:58:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:58:43] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-23 00:58:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:58:43] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-23 00:58:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:58:43] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14447838558233959424
Running compilation step : cd /tmp/ltsmin14447838558233959424;'/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 523 ms.
Running link step : cd /tmp/ltsmin14447838558233959424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14447838558233959424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13224001687850611307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:58:58] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:58:58] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:58:58] [INFO ] Time to serialize gal into /tmp/LTL15309414740924258588.gal : 1 ms
[2024-05-23 00:58:58] [INFO ] Time to serialize properties into /tmp/LTL13584511205183742169.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/LTL15309414740924258588.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14886587750544465181.hoa' '-atoms' '/tmp/LTL13584511205183742169.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/LTL13584511205183742169.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14886587750544465181.hoa
Detected timeout of ITS tools.
[2024-05-23 00:59:13] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:59:13] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:59:13] [INFO ] Time to serialize gal into /tmp/LTL18353440511326928066.gal : 2 ms
[2024-05-23 00:59:13] [INFO ] Time to serialize properties into /tmp/LTL5282836344309801544.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/LTL18353440511326928066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5282836344309801544.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 : !((F(G("(p334<=p185)"))))
Formula 0 simplified : GF!"(p334<=p185)"
Detected timeout of ITS tools.
[2024-05-23 00:59:28] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:59:28] [INFO ] Applying decomposition
[2024-05-23 00:59:28] [INFO ] Flatten gal took : 20 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/graph7119902402357190803.txt' '-o' '/tmp/graph7119902402357190803.bin' '-w' '/tmp/graph7119902402357190803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7119902402357190803.bin' '-l' '-1' '-v' '-w' '/tmp/graph7119902402357190803.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:59:28] [INFO ] Decomposing Gal with order
[2024-05-23 00:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:59:28] [INFO ] Removed a total of 194 redundant transitions.
[2024-05-23 00:59:28] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-23 00:59:28] [INFO ] Time to serialize gal into /tmp/LTL10753981222388168455.gal : 3 ms
[2024-05-23 00:59:28] [INFO ] Time to serialize properties into /tmp/LTL12630020284442903364.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/LTL10753981222388168455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12630020284442903364.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu51.p334<=gu51.p185)"))))
Formula 0 simplified : GF!"(gu51.p334<=gu51.p185)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6249671854848891911
[2024-05-23 00:59:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6249671854848891911
Running compilation step : cd /tmp/ltsmin6249671854848891911;'/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 407 ms.
Running link step : cd /tmp/ltsmin6249671854848891911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6249671854848891911;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-05 finished in 125421 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)||(F(p1)&&F(!p1))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 407 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 239 place count 406 transition count 357
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 499 place count 276 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 275 transition count 262
Applied a total of 500 rules in 34 ms. Remains 275 /528 variables (removed 253) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 275 cols
[2024-05-23 00:59:59] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 00:59:59] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-23 00:59:59] [INFO ] Invariant cache hit.
[2024-05-23 00:59:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:00] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2024-05-23 01:00:00] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:00:00] [INFO ] Invariant cache hit.
[2024-05-23 01:00:00] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1390 ms. Remains : 275/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s25), p1:(GT 3 s64)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-06 finished in 1540 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(G(p0)))'
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 16 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 01:00:00] [INFO ] Computed 49 invariants in 25 ms
[2024-05-23 01:00:00] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-23 01:00:00] [INFO ] Invariant cache hit.
[2024-05-23 01:00:02] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2024-05-23 01:00:02] [INFO ] Invariant cache hit.
[2024-05-23 01:00:03] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2643 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s358)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-07 finished in 2768 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||G((p1||F(p2)))))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 276 transition count 264
Applied a total of 498 rules in 31 ms. Remains 276 /528 variables (removed 252) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-23 01:00:03] [INFO ] Computed 49 invariants in 9 ms
[2024-05-23 01:00:03] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-23 01:00:03] [INFO ] Invariant cache hit.
[2024-05-23 01:00:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:04] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2024-05-23 01:00:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:00:04] [INFO ] Invariant cache hit.
[2024-05-23 01:00:04] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1052 ms. Remains : 276/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GT 1 s258), p1:(GT 1 s255), p0:(LEQ s1 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13907 reset in 141 ms.
Product exploration explored 100000 steps with 13851 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 670887 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{1=1}
Probabilistic random walk after 670887 steps, saw 335528 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-23 01:00:08] [INFO ] Invariant cache hit.
[2024-05-23 01:00:08] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:00:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:00:08] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2024-05-23 01:00:08] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-09 finished in 4994 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(p0) U (p1&&F(!p1))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 241 place count 405 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 31 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2024-05-23 01:00:08] [INFO ] Computed 49 invariants in 13 ms
[2024-05-23 01:00:08] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 01:00:08] [INFO ] Invariant cache hit.
[2024-05-23 01:00:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:09] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2024-05-23 01:00:09] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 01:00:09] [INFO ] Invariant cache hit.
[2024-05-23 01:00:09] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1391 ms. Remains : 277/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, true, (NOT p0), p1]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s138 s245), p0:(AND (LEQ s138 s245) (LEQ s215 s78))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 227 steps with 33 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-10 finished in 1642 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||F(G(p1)))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 13 ms. Remains 527 /528 variables (removed 1) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2024-05-23 01:00:09] [INFO ] Computed 49 invariants in 23 ms
[2024-05-23 01:00:10] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-23 01:00:10] [INFO ] Invariant cache hit.
[2024-05-23 01:00:12] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2024-05-23 01:00:12] [INFO ] Invariant cache hit.
[2024-05-23 01:00:12] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2371 ms. Remains : 527/528 places, 497/497 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT s378 s263), p1:(LEQ s60 s156)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3329 reset in 110 ms.
Product exploration explored 100000 steps with 3329 reset in 110 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 317 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 290 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7406 steps, run visited all 1 properties in 47 ms. (steps per millisecond=157 )
Probabilistic random walk after 7406 steps, saw 3729 distinct states, run finished after 47 ms. (steps per millisecond=157 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 409 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 237 place count 407 transition count 377
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 237 place count 407 transition count 357
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 463 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 276 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 275 transition count 263
Applied a total of 500 rules in 33 ms. Remains 275 /527 variables (removed 252) and now considering 263/497 (removed 234) transitions.
// Phase 1: matrix 263 rows 275 cols
[2024-05-23 01:00:13] [INFO ] Computed 49 invariants in 16 ms
[2024-05-23 01:00:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-23 01:00:13] [INFO ] Invariant cache hit.
[2024-05-23 01:00:13] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:14] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2024-05-23 01:00:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:00:14] [INFO ] Invariant cache hit.
[2024-05-23 01:00:14] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/527 places, 263/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1136 ms. Remains : 275/527 places, 263/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 855 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1344 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 790 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3522 steps, run visited all 1 properties in 29 ms. (steps per millisecond=121 )
Probabilistic random walk after 3522 steps, saw 1787 distinct states, run finished after 29 ms. (steps per millisecond=121 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13789 reset in 99 ms.
Product exploration explored 100000 steps with 13693 reset in 109 ms.
Built C files in :
/tmp/ltsmin4376484616531690943
[2024-05-23 01:00:14] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-23 01:00:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:00:14] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-23 01:00:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:00:14] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-23 01:00:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:00:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4376484616531690943
Running compilation step : cd /tmp/ltsmin4376484616531690943;'/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 516 ms.
Running link step : cd /tmp/ltsmin4376484616531690943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4376484616531690943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18362493383934562656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 263/263 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 275 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 274 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 273 transition count 261
Applied a total of 4 rules in 9 ms. Remains 273 /275 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 273 cols
[2024-05-23 01:00:30] [INFO ] Computed 49 invariants in 17 ms
[2024-05-23 01:00:30] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 01:00:30] [INFO ] Invariant cache hit.
[2024-05-23 01:00:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:00:31] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2024-05-23 01:00:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:00:31] [INFO ] Invariant cache hit.
[2024-05-23 01:00:31] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/275 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1158 ms. Remains : 273/275 places, 261/263 transitions.
Built C files in :
/tmp/ltsmin6917048286033996277
[2024-05-23 01:00:31] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-23 01:00:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:00:31] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-23 01:00:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:00:31] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-23 01:00:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:00:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6917048286033996277
Running compilation step : cd /tmp/ltsmin6917048286033996277;'/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 519 ms.
Running link step : cd /tmp/ltsmin6917048286033996277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6917048286033996277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15312626472200761892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:00:46] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:00:46] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:00:46] [INFO ] Time to serialize gal into /tmp/LTL11948881612183066443.gal : 1 ms
[2024-05-23 01:00:46] [INFO ] Time to serialize properties into /tmp/LTL474142143508370345.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/LTL11948881612183066443.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17109082639145885630.hoa' '-atoms' '/tmp/LTL474142143508370345.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL474142143508370345.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17109082639145885630.hoa
Detected timeout of ITS tools.
[2024-05-23 01:01:01] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:01:01] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:01:01] [INFO ] Time to serialize gal into /tmp/LTL7935605024281935646.gal : 2 ms
[2024-05-23 01:01:01] [INFO ] Time to serialize properties into /tmp/LTL9505004231277681999.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/LTL7935605024281935646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9505004231277681999.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 : !((X(("(p44>p336)")||(F(G("(p153<=p24)"))))))
Formula 0 simplified : X(!"(p44>p336)" & GF!"(p153<=p24)")
Detected timeout of ITS tools.
[2024-05-23 01:01:16] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:01:16] [INFO ] Applying decomposition
[2024-05-23 01:01:16] [INFO ] Flatten gal took : 7 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/graph9390471090034504104.txt' '-o' '/tmp/graph9390471090034504104.bin' '-w' '/tmp/graph9390471090034504104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9390471090034504104.bin' '-l' '-1' '-v' '-w' '/tmp/graph9390471090034504104.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:01:16] [INFO ] Decomposing Gal with order
[2024-05-23 01:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:01:16] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-23 01:01:16] [INFO ] Flatten gal took : 37 ms
[2024-05-23 01:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 9 ms.
[2024-05-23 01:01:16] [INFO ] Time to serialize gal into /tmp/LTL17192412284943110978.gal : 3 ms
[2024-05-23 01:01:16] [INFO ] Time to serialize properties into /tmp/LTL15295239142267976175.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/LTL17192412284943110978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15295239142267976175.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(gu82.p44>gu82.p336)")||(F(G("(gu35.p153<=gu35.p24)"))))))
Formula 0 simplified : X(!"(gu82.p44>gu82.p336)" & GF!"(gu35.p153<=gu35.p24)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9646423888981327121
[2024-05-23 01:01:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9646423888981327121
Running compilation step : cd /tmp/ltsmin9646423888981327121;'/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 430 ms.
Running link step : cd /tmp/ltsmin9646423888981327121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9646423888981327121;'/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(((LTLAPp0==true)||<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-11 finished in 96819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 408 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 34 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 01:01:46] [INFO ] Computed 49 invariants in 19 ms
[2024-05-23 01:01:46] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 01:01:46] [INFO ] Invariant cache hit.
[2024-05-23 01:01:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 01:01:48] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-23 01:01:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:01:48] [INFO ] Invariant cache hit.
[2024-05-23 01:01:48] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1520 ms. Remains : 274/528 places, 262/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s65 s130)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13907 reset in 100 ms.
Product exploration explored 100000 steps with 13821 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 791 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 668769 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668769 steps, saw 334472 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:01:51] [INFO ] Invariant cache hit.
[2024-05-23 01:01:51] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:01:51] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 13 ms returned sat
[2024-05-23 01:01:51] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 01:01:52] [INFO ] After 114ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:52] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 01:01:52] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 236 transition count 224
Applied a total of 115 rules in 23 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 236/274 places, 224/262 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 708742 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 708742 steps, saw 354581 distinct states, run finished after 3002 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 236 cols
[2024-05-23 01:01:55] [INFO ] Computed 49 invariants in 15 ms
[2024-05-23 01:01:55] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:01:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:01:55] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 16 ms returned sat
[2024-05-23 01:01:55] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:01:55] [INFO ] After 69ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:01:55] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:01:55] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-23 01:01:55] [INFO ] Invariant cache hit.
[2024-05-23 01:01:55] [INFO ] Implicit Places using invariants in 219 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 223 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 216
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 210 transition count 216
Applied a total of 18 rules in 8 ms. Remains 210 /218 variables (removed 8) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 01:01:55] [INFO ] Computed 31 invariants in 13 ms
[2024-05-23 01:01:55] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 01:01:55] [INFO ] Invariant cache hit.
[2024-05-23 01:01:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:01:57] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/236 places, 216/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1668 ms. Remains : 210/236 places, 216/224 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 264445 states, properties seen :0
Probabilistic random walk after 528899 steps, saw 264445 distinct states, run finished after 2184 ms. (steps per millisecond=242 ) properties seen :0
Interrupted probabilistic random walk after 769517 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Exhaustive walk after 769517 steps, saw 384840 distinct states, run finished after 3005 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:02] [INFO ] Invariant cache hit.
[2024-05-23 01:02:02] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-23 01:02:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 01:02:02] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:02:02] [INFO ] After 53ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:02] [INFO ] After 80ms 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-23 01:02:02] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 01:02:02] [INFO ] Invariant cache hit.
[2024-05-23 01:02:02] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-23 01:02:02] [INFO ] Invariant cache hit.
[2024-05-23 01:02:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:02:04] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2024-05-23 01:02:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:02:04] [INFO ] Invariant cache hit.
[2024-05-23 01:02:04] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1460 ms. Remains : 210/210 places, 216/216 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 193 transition count 199
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 184 transition count 190
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 184 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 187
Applied a total of 58 rules in 10 ms. Remains 181 /210 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 181 cols
[2024-05-23 01:02:04] [INFO ] Computed 31 invariants in 6 ms
[2024-05-23 01:02:04] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 01:02:04] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-23 01:02:04] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:02:04] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:04] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-23 01:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-23 01:02:04] [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 10 ms.
[2024-05-23 01:02:04] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 274 cols
[2024-05-23 01:02:04] [INFO ] Computed 49 invariants in 12 ms
[2024-05-23 01:02:04] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 01:02:04] [INFO ] Invariant cache hit.
[2024-05-23 01:02:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 01:02:06] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
[2024-05-23 01:02:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:02:06] [INFO ] Invariant cache hit.
[2024-05-23 01:02:06] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1486 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647650 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647650 steps, saw 323911 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:09] [INFO ] Invariant cache hit.
[2024-05-23 01:02:09] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:02:09] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2024-05-23 01:02:09] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:09] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 01:02:09] [INFO ] After 115ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:09] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-23 01:02:09] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 813 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 236 transition count 224
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 236 transition count 224
Applied a total of 115 rules in 15 ms. Remains 236 /274 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 236/274 places, 224/262 transitions.
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 690921 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 690921 steps, saw 345673 distinct states, run finished after 3002 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 236 cols
[2024-05-23 01:02:12] [INFO ] Computed 49 invariants in 15 ms
[2024-05-23 01:02:12] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:02:12] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-23 01:02:13] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:02:13] [INFO ] After 69ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:13] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-23 01:02:13] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-23 01:02:13] [INFO ] Invariant cache hit.
[2024-05-23 01:02:13] [INFO ] Implicit Places using invariants in 212 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 224 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 216
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 210 transition count 216
Applied a total of 18 rules in 8 ms. Remains 210 /218 variables (removed 8) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 01:02:13] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 01:02:13] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 01:02:13] [INFO ] Invariant cache hit.
[2024-05-23 01:02:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:02:14] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/236 places, 216/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1720 ms. Remains : 210/236 places, 216/224 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 264445 states, properties seen :0
Probabilistic random walk after 528899 steps, saw 264445 distinct states, run finished after 2177 ms. (steps per millisecond=242 ) properties seen :0
Interrupted probabilistic random walk after 774470 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Exhaustive walk after 774470 steps, saw 387316 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:20] [INFO ] Invariant cache hit.
[2024-05-23 01:02:20] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 01:02:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 01:02:20] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:02:20] [INFO ] After 56ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:20] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 01:02:20] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 01:02:20] [INFO ] Invariant cache hit.
[2024-05-23 01:02:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-23 01:02:20] [INFO ] Invariant cache hit.
[2024-05-23 01:02:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 01:02:21] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
[2024-05-23 01:02:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:02:21] [INFO ] Invariant cache hit.
[2024-05-23 01:02:21] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1534 ms. Remains : 210/210 places, 216/216 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 193 transition count 199
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 184 transition count 190
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 184 transition count 190
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 0 with 2 rules applied. Total rules applied 54 place count 183 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 183 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 187
Applied a total of 58 rules in 10 ms. Remains 181 /210 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 181 cols
[2024-05-23 01:02:21] [INFO ] Computed 31 invariants in 8 ms
[2024-05-23 01:02:22] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 01:02:22] [INFO ] [Nat]Absence check using 8 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-23 01:02:22] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:02:22] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:22] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-23 01:02:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-23 01:02:22] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 01:02:22] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13872 reset in 138 ms.
Product exploration explored 100000 steps with 13817 reset in 114 ms.
Built C files in :
/tmp/ltsmin6524534174670463545
[2024-05-23 01:02:22] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2024-05-23 01:02:22] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:22] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2024-05-23 01:02:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:22] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2024-05-23 01:02:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:02:22] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6524534174670463545
Running compilation step : cd /tmp/ltsmin6524534174670463545;'/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 539 ms.
Running link step : cd /tmp/ltsmin6524534174670463545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6524534174670463545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4465436530409131746.hoa' '--buchi-type=spotba'
LTSmin run took 7801 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLCardinality-12 finished in 44428 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)))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 239 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 277 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 500 place count 276 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 501 place count 276 transition count 264
Applied a total of 501 rules in 32 ms. Remains 276 /528 variables (removed 252) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2024-05-23 01:02:31] [INFO ] Computed 49 invariants in 29 ms
[2024-05-23 01:02:31] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 01:02:31] [INFO ] Invariant cache hit.
[2024-05-23 01:02:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:32] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-23 01:02:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:02:32] [INFO ] Invariant cache hit.
[2024-05-23 01:02:32] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1484 ms. Remains : 276/528 places, 264/497 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s95 s239) (LEQ 2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 63 steps with 16 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-13 finished in 1576 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&&G(F(p0)))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 527 transition count 375
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 406 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 242 place count 406 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 282 place count 386 transition count 355
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 468 place count 293 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 504 place count 275 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 274 transition count 261
Applied a total of 505 rules in 31 ms. Remains 274 /528 variables (removed 254) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-23 01:02:32] [INFO ] Computed 50 invariants in 12 ms
[2024-05-23 01:02:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-23 01:02:32] [INFO ] Invariant cache hit.
[2024-05-23 01:02:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:33] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-05-23 01:02:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 01:02:33] [INFO ] Invariant cache hit.
[2024-05-23 01:02:34] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1372 ms. Remains : 274/528 places, 261/497 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s229 s76)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13923 reset in 99 ms.
Product exploration explored 100000 steps with 13933 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 857 edges and 274 vertex of which 271 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645368 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645368 steps, saw 322773 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:37] [INFO ] Invariant cache hit.
[2024-05-23 01:02:37] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:02:37] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2024-05-23 01:02:37] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:38] [INFO ] After 68ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:38] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 01:02:38] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 108 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 274 transition count 223
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 236 transition count 223
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 114 place count 236 transition count 223
Applied a total of 114 rules in 17 ms. Remains 236 /274 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 236/274 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 668076 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668076 steps, saw 334254 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 236 cols
[2024-05-23 01:02:41] [INFO ] Computed 50 invariants in 15 ms
[2024-05-23 01:02:41] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:02:41] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2024-05-23 01:02:41] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:41] [INFO ] After 143ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:41] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-05-23 01:02:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-05-23 01:02:41] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-23 01:02:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2024-05-23 01:02:41] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-23 01:02:41] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 72 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 01:02:41] [INFO ] Invariant cache hit.
[2024-05-23 01:02:42] [INFO ] Implicit Places using invariants in 311 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 321 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 218 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 209 transition count 214
Applied a total of 18 rules in 8 ms. Remains 209 /218 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-23 01:02:42] [INFO ] Computed 32 invariants in 20 ms
[2024-05-23 01:02:42] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-23 01:02:42] [INFO ] Invariant cache hit.
[2024-05-23 01:02:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:43] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1795 ms. Remains : 209/236 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 726935 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 726935 steps, saw 363540 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:46] [INFO ] Invariant cache hit.
[2024-05-23 01:02:46] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 01:02:46] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-23 01:02:46] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:47] [INFO ] After 131ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:47] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-05-23 01:02:47] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-23 01:02:47] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-23 01:02:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-23 01:02:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 322 ms
[2024-05-23 01:02:47] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:02:47] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 01:02:47] [INFO ] Invariant cache hit.
[2024-05-23 01:02:47] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-23 01:02:47] [INFO ] Invariant cache hit.
[2024-05-23 01:02:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:49] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-05-23 01:02:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:02:49] [INFO ] Invariant cache hit.
[2024-05-23 01:02:49] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1646 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 187
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 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 184
Applied a total of 60 rules in 11 ms. Remains 179 /209 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2024-05-23 01:02:49] [INFO ] Computed 32 invariants in 8 ms
[2024-05-23 01:02:49] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 01:02:49] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-23 01:02:49] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:02:49] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-05-23 01:02:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 474 ms
[2024-05-23 01:02:49] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 01:02:49] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 274 /274 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-23 01:02:50] [INFO ] Computed 50 invariants in 7 ms
[2024-05-23 01:02:50] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-23 01:02:50] [INFO ] Invariant cache hit.
[2024-05-23 01:02:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:51] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2024-05-23 01:02:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 01:02:51] [INFO ] Invariant cache hit.
[2024-05-23 01:02:51] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1412 ms. Remains : 274/274 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 857 edges and 274 vertex of which 271 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1347 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626358 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626358 steps, saw 313276 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:02:54] [INFO ] Invariant cache hit.
[2024-05-23 01:02:54] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 01:02:54] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2024-05-23 01:02:55] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:02:55] [INFO ] After 74ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:55] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 01:02:55] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 121 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 274 transition count 223
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 236 transition count 223
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 114 place count 236 transition count 223
Applied a total of 114 rules in 11 ms. Remains 236 /274 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/274 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 657860 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657860 steps, saw 329142 distinct states, run finished after 3004 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 236 cols
[2024-05-23 01:02:58] [INFO ] Computed 50 invariants in 8 ms
[2024-05-23 01:02:58] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:02:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 01:02:58] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 16 ms returned sat
[2024-05-23 01:02:58] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:02:58] [INFO ] After 130ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:02:58] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-23 01:02:58] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2024-05-23 01:02:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-23 01:02:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2024-05-23 01:02:59] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-23 01:02:59] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-23 01:02:59] [INFO ] Invariant cache hit.
[2024-05-23 01:02:59] [INFO ] Implicit Places using invariants in 287 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 314 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 218 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 209 transition count 214
Applied a total of 18 rules in 6 ms. Remains 209 /218 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-23 01:02:59] [INFO ] Computed 32 invariants in 9 ms
[2024-05-23 01:02:59] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-23 01:02:59] [INFO ] Invariant cache hit.
[2024-05-23 01:02:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:03:01] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1963 ms. Remains : 209/236 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1362 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 728936 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728936 steps, saw 364540 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 01:03:04] [INFO ] Invariant cache hit.
[2024-05-23 01:03:04] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 01:03:04] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-23 01:03:04] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:03:04] [INFO ] After 131ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:04] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-05-23 01:03:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-23 01:03:04] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-23 01:03:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-23 01:03:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2024-05-23 01:03:04] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-23 01:03:04] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 01:03:04] [INFO ] Invariant cache hit.
[2024-05-23 01:03:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 01:03:05] [INFO ] Invariant cache hit.
[2024-05-23 01:03:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-23 01:03:06] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2024-05-23 01:03:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:03:06] [INFO ] Invariant cache hit.
[2024-05-23 01:03:06] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1674 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 187
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 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 184
Applied a total of 60 rules in 11 ms. Remains 179 /209 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2024-05-23 01:03:06] [INFO ] Computed 32 invariants in 15 ms
[2024-05-23 01:03:06] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:03:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 01:03:06] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-23 01:03:06] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 01:03:06] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:03:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-23 01:03:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-23 01:03:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-23 01:03:07] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-23 01:03:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-23 01:03:07] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-23 01:03:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-23 01:03:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 377 ms
[2024-05-23 01:03:07] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 01:03:07] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13949 reset in 98 ms.
Product exploration explored 100000 steps with 13735 reset in 114 ms.
Built C files in :
/tmp/ltsmin8196482695101248347
[2024-05-23 01:03:07] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-23 01:03:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:03:07] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-23 01:03:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:03:07] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-23 01:03:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:03:07] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8196482695101248347
Running compilation step : cd /tmp/ltsmin8196482695101248347;'/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 541 ms.
Running link step : cd /tmp/ltsmin8196482695101248347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8196482695101248347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7229987252007338386.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 274 cols
[2024-05-23 01:03:22] [INFO ] Computed 50 invariants in 12 ms
[2024-05-23 01:03:23] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-23 01:03:23] [INFO ] Invariant cache hit.
[2024-05-23 01:03:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 01:03:24] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-23 01:03:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 01:03:24] [INFO ] Invariant cache hit.
[2024-05-23 01:03:24] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1377 ms. Remains : 274/274 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin16080297970897093451
[2024-05-23 01:03:24] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-23 01:03:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:03:24] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-23 01:03:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:03:24] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-23 01:03:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:03:24] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16080297970897093451
Running compilation step : cd /tmp/ltsmin16080297970897093451;'/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 547 ms.
Running link step : cd /tmp/ltsmin16080297970897093451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16080297970897093451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13294614724759880226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:03:39] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:03:39] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:03:39] [INFO ] Time to serialize gal into /tmp/LTL3586683562472197050.gal : 3 ms
[2024-05-23 01:03:39] [INFO ] Time to serialize properties into /tmp/LTL10083427080934739208.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/LTL3586683562472197050.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10640216651836438467.hoa' '-atoms' '/tmp/LTL10083427080934739208.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/LTL10083427080934739208.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10640216651836438467.hoa
Detected timeout of ITS tools.
[2024-05-23 01:03:54] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:03:54] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:03:54] [INFO ] Time to serialize gal into /tmp/LTL4913203089235996707.gal : 2 ms
[2024-05-23 01:03:54] [INFO ] Time to serialize properties into /tmp/LTL13388141994709687319.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/LTL4913203089235996707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13388141994709687319.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 : !((F(("(p496<=p229)")&&(G(F("(p496<=p229)"))))))
Formula 0 simplified : FG!"(p496<=p229)"
Detected timeout of ITS tools.
[2024-05-23 01:04:09] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:04:09] [INFO ] Applying decomposition
[2024-05-23 01:04:09] [INFO ] Flatten gal took : 9 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/graph4393028866954800113.txt' '-o' '/tmp/graph4393028866954800113.bin' '-w' '/tmp/graph4393028866954800113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4393028866954800113.bin' '-l' '-1' '-v' '-w' '/tmp/graph4393028866954800113.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:04:09] [INFO ] Decomposing Gal with order
[2024-05-23 01:04:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:04:09] [INFO ] Removed a total of 236 redundant transitions.
[2024-05-23 01:04:09] [INFO ] Flatten gal took : 16 ms
[2024-05-23 01:04:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-23 01:04:09] [INFO ] Time to serialize gal into /tmp/LTL7595943480261899718.gal : 4 ms
[2024-05-23 01:04:09] [INFO ] Time to serialize properties into /tmp/LTL980839712389112522.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/LTL7595943480261899718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL980839712389112522.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(("(gu33.p496<=gu33.p229)")&&(G(F("(gu33.p496<=gu33.p229)"))))))
Formula 0 simplified : FG!"(gu33.p496<=gu33.p229)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13714981635503573601
[2024-05-23 01:04:24] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13714981635503573601
Running compilation step : cd /tmp/ltsmin13714981635503573601;'/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 444 ms.
Running link step : cd /tmp/ltsmin13714981635503573601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13714981635503573601;'/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)&&[](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-14 finished in 127084 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)))'
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(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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||F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
[2024-05-23 01:04:40] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11224569048043120181
[2024-05-23 01:04:40] [INFO ] Applying decomposition
[2024-05-23 01:04:40] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2024-05-23 01:04:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:40] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2024-05-23 01:04:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:40] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:04:40] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2024-05-23 01:04:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:04:40] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11224569048043120181
Running compilation step : cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' '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'
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/graph15722871352691959988.txt' '-o' '/tmp/graph15722871352691959988.bin' '-w' '/tmp/graph15722871352691959988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15722871352691959988.bin' '-l' '-1' '-v' '-w' '/tmp/graph15722871352691959988.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:04:40] [INFO ] Decomposing Gal with order
[2024-05-23 01:04:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:04:40] [INFO ] Removed a total of 133 redundant transitions.
[2024-05-23 01:04:40] [INFO ] Flatten gal took : 24 ms
[2024-05-23 01:04:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-23 01:04:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality15791475417274608407.gal : 8 ms
[2024-05-23 01:04:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality1228882978738080772.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/LTLCardinality15791475417274608407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1228882978738080772.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 6 LTL properties
Checking formula 0 : !((G(F("((gi8.gu183.p502<=gi8.gu183.p481)||(gi4.gi2.gi1.gi1.gi3.gu184.p486>=1))"))))
Formula 0 simplified : FG!"((gi8.gu183.p502<=gi8.gu183.p481)||(gi4.gi2.gi1.gi1.gi3.gu184.p486>=1))"
Compilation finished in 1067 ms.
Running link step : cd /tmp/ltsmin11224569048043120181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp1==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 01:29:48] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:29:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality8816652871008624916.gal : 19 ms
[2024-05-23 01:29:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality13637743408428508728.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/LTLCardinality8816652871008624916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13637743408428508728.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 6 LTL properties
Checking formula 0 : !((G(F("((p502<=p481)||(p486>=1))"))))
Formula 0 simplified : FG!"((p502<=p481)||(p486>=1))"
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin11224569048043120181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11224569048043120181;'/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(((LTLAPp5==true)||<>([]((LTLAPp6==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6457852 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16042244 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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 r153-tall-171631151600347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 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 ;