About the Execution of 2023-gold for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14526.468 | 1800000.00 | 5317453.00 | 1824.50 | [undef] | Time out reached |
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.r176-smll-171636280700128.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 EisenbergMcGuire-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-smll-171636280700128
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1716548942584
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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202304061127
[2024-05-24 11:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-24 11:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:09:05] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2024-05-24 11:09:05] [INFO ] Transformed 1090 places.
[2024-05-24 11:09:05] [INFO ] Transformed 5200 transitions.
[2024-05-24 11:09:05] [INFO ] Found NUPN structural information;
[2024-05-24 11:09:05] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 568 ms.
[2024-05-24 11:09:07] [INFO ] Flatten gal took : 629 ms
[2024-05-24 11:09:07] [INFO ] Flatten gal took : 344 ms
[2024-05-24 11:09:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1054470489066756365.gal : 160 ms
[2024-05-24 11:09:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality590759929704124812.prop : 9 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1054470489066756365.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality590759929704124812.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1797 ms. (steps per millisecond=5 ) properties (out of 1090) seen :676
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 414) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 414) seen :0
Running SMT prover for 414 properties.
[2024-05-24 11:09:08] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2024-05-24 11:09:08] [INFO ] Computed 31 invariants in 51 ms
Loading property file /tmp/ReachabilityCardinality590759929704124812.prop.
Invariant property smplace_530 does not hold.
Invariant property smplace_520 does not hold.
Invariant property smplace_60 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_12 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_10 does not hold.
SDD proceeding with computation,1082 properties remain. new max is 2
SDD size :1 after 5
Invariant property smplace_540 does not hold.
SDD proceeding with computation,1081 properties remain. new max is 2
SDD size :5 after 6
Invariant property smplace_650 does not hold.
Invariant property smplace_541 does not hold.
SDD proceeding with computation,1079 properties remain. new max is 2
SDD size :6 after 8
Invariant property smplace_651 does not hold.
Invariant property smplace_542 does not hold.
SDD proceeding with computation,1077 properties remain. new max is 2
SDD size :8 after 10
Invariant property smplace_652 does not hold.
Invariant property smplace_543 does not hold.
SDD proceeding with computation,1075 properties remain. new max is 2
SDD size :10 after 12
Invariant property smplace_653 does not hold.
Invariant property smplace_544 does not hold.
SDD proceeding with computation,1073 properties remain. new max is 2
SDD size :12 after 14
Invariant property smplace_654 does not hold.
SDD proceeding with computation,1072 properties remain. new max is 2
SDD size :14 after 15
Invariant property smplace_169 does not hold.
Invariant property smplace_70 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_14 does not hold.
Invariant property smplace_13 does not hold.
SDD proceeding with computation,1066 properties remain. new max is 2
SDD size :15 after 57
[2024-05-24 11:09:20] [INFO ] After 11869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:414
Invariant property smplace_259 does not hold.
SDD proceeding with computation,1065 properties remain. new max is 2
SDD size :57 after 70
SDD proceeding with computation,1065 properties remain. new max is 4
SDD size :70 after 71
SDD proceeding with computation,1065 properties remain. new max is 8
SDD size :71 after 72
Invariant property smplace_521 does not hold.
Invariant property smplace_349 does not hold.
Invariant property smplace_71 does not hold.
SDD proceeding with computation,1062 properties remain. new max is 8
SDD size :72 after 77
Invariant property smplace_551 does not hold.
Invariant property smplace_531 does not hold.
Invariant property smplace_15 does not hold.
SDD proceeding with computation,1059 properties remain. new max is 8
SDD size :77 after 79
Invariant property smplace_660 does not hold.
Invariant property smplace_552 does not hold.
SDD proceeding with computation,1057 properties remain. new max is 8
SDD size :79 after 81
Invariant property smplace_661 does not hold.
Invariant property smplace_553 does not hold.
SDD proceeding with computation,1055 properties remain. new max is 8
SDD size :81 after 83
Invariant property smplace_662 does not hold.
Invariant property smplace_554 does not hold.
SDD proceeding with computation,1053 properties remain. new max is 8
SDD size :83 after 85
Invariant property smplace_663 does not hold.
Invariant property smplace_555 does not hold.
SDD proceeding with computation,1051 properties remain. new max is 8
SDD size :85 after 87
Invariant property smplace_664 does not hold.
SDD proceeding with computation,1050 properties remain. new max is 8
SDD size :87 after 88
SDD proceeding with computation,1050 properties remain. new max is 16
SDD size :88 after 155
[2024-05-24 11:09:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 65 ms returned sat
[2024-05-24 11:09:29] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 14 ms returned sat
SDD proceeding with computation,1050 properties remain. new max is 32
SDD size :155 after 158
SDD proceeding with computation,1050 properties remain. new max is 64
SDD size :158 after 181
SDD proceeding with computation,1050 properties remain. new max is 128
SDD size :181 after 191
SDD proceeding with computation,1050 properties remain. new max is 256
SDD size :191 after 204
Invariant property smplace_750 does not hold.
SDD proceeding with computation,1049 properties remain. new max is 256
SDD size :204 after 232
Invariant property smplace_760 does not hold.
SDD proceeding with computation,1048 properties remain. new max is 256
SDD size :232 after 280
Invariant property smplace_286 does not hold.
Invariant property smplace_196 does not hold.
Invariant property smplace_100 does not hold.
Invariant property smplace_54 does not hold.
Invariant property smplace_44 does not hold.
Invariant property smplace_23 does not hold.
Invariant property smplace_22 does not hold.
SDD proceeding with computation,1041 properties remain. new max is 256
SDD size :280 after 1084
SDD proceeding with computation,1041 properties remain. new max is 512
SDD size :1084 after 1163
Invariant property smplace_376 does not hold.
Invariant property smplace_287 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_101 does not hold.
SDD proceeding with computation,1037 properties remain. new max is 512
SDD size :1163 after 1600
SDD proceeding with computation,1037 properties remain. new max is 1024
SDD size :1600 after 1762
SDD proceeding with computation,1037 properties remain. new max is 2048
SDD size :1762 after 2196
[2024-05-24 11:09:45] [INFO ] After 6960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :414
[2024-05-24 11:09:45] [INFO ] State equation strengthened by 1246 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 11:09:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 11:09:45] [INFO ] After 25101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:414
Fused 414 Parikh solutions to 61 different solutions.
Invariant property smplace_694 does not hold.
Invariant property smplace_693 does not hold.
Invariant property smplace_692 does not hold.
Invariant property smplace_691 does not hold.
Invariant property smplace_690 does not hold.
Parikh walk visited 1 properties in 1272 ms.
Support contains 409 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Invariant property smplace_588 does not hold.
Invariant property smplace_587 does not hold.
Invariant property smplace_586 does not hold.
Invariant property smplace_585 does not hold.
Invariant property smplace_584 does not hold.
Invariant property smplace_534 does not hold.
Invariant property smplace_524 does not hold.
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 20 place count 1080 transition count 4970
Deduced a syphon composed of 220 places in 15 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 460 place count 860 transition count 4970
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 550 place count 770 transition count 4070
Iterating global reduction 2 with 90 rules applied. Total rules applied 640 place count 770 transition count 4070
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 13 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 716 place count 732 transition count 4032
Invariant property smplace_379 does not hold.
Invariant property smplace_378 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_198 does not hold.
Applied a total of 716 rules in 848 ms. Remains 732 /1090 variables (removed 358) and now considering 4032/5200 (removed 1168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 850 ms. Remains : 732/1090 places, 4032/5200 transitions.
Invariant property smplace_104 does not hold.
Invariant property smplace_103 does not hold.
Invariant property smplace_102 does not hold.
Invariant property smplace_24 does not hold.
SDD proceeding with computation,1016 properties remain. new max is 2048
SDD size :2196 after 2709
Invariant property smplace_753 does not hold.
SDD proceeding with computation,1015 properties remain. new max is 2048
SDD size :2709 after 5480
Invariant property smplace_791 does not hold.
Invariant property smplace_763 does not hold.
SDD proceeding with computation,1013 properties remain. new max is 2048
SDD size :5480 after 8344
Invariant property smplace_790 does not hold.
SDD proceeding with computation,1012 properties remain. new max is 2048
SDD size :8344 after 9228
Invariant property smplace_288 does not hold.
Invariant property smplace_268 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_52 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_17 does not hold.
Invariant property smplace_16 does not hold.
SDD proceeding with computation,1004 properties remain. new max is 2048
SDD size :9228 after 34323
Interrupted random walk after 314650 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 354) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 352) seen :0
Invariant property smplace_358 does not hold.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 352) seen :0
Invariant property smplace_269 does not hold.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 352) seen :0
Invariant property smplace_179 does not hold.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 352) seen :0
Invariant property smplace_81 does not hold.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 352) seen :0
SDD proceeding with computation,1000 properties remain. new max is 2048
SDD size :34323 after 40859
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 352) seen :0
Running SMT prover for 352 properties.
[2024-05-24 11:10:22] [INFO ] Flow matrix only has 1162 transitions (discarded 2870 similar events)
// Phase 1: matrix 1162 rows 732 cols
[2024-05-24 11:10:22] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 11:10:29] [INFO ] After 6829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:352
SDD proceeding with computation,1000 properties remain. new max is 4096
SDD size :40859 after 53227
SDD proceeding with computation,1000 properties remain. new max is 8192
SDD size :53227 after 66755
[2024-05-24 11:10:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 39 ms returned sat
[2024-05-24 11:10:36] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 14 ms returned sat
Invariant property smplace_674 does not hold.
Invariant property smplace_673 does not hold.
Invariant property smplace_672 does not hold.
Invariant property smplace_671 does not hold.
Invariant property smplace_670 does not hold.
Invariant property smplace_566 does not hold.
Invariant property smplace_565 does not hold.
Invariant property smplace_564 does not hold.
Invariant property smplace_563 does not hold.
Invariant property smplace_562 does not hold.
Invariant property smplace_532 does not hold.
Invariant property smplace_522 does not hold.
Invariant property smplace_359 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_18 does not hold.
SDD proceeding with computation,985 properties remain. new max is 8192
SDD size :66755 after 78491
[2024-05-24 11:11:00] [INFO ] After 17603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :352
[2024-05-24 11:11:00] [INFO ] State equation strengthened by 436 read => feed constraints.
Invariant property smplace_751 does not hold.
[2024-05-24 11:11:22] [INFO ] After 21640ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :352
SDD proceeding with computation,984 properties remain. new max is 8192
SDD size :78491 after 127811
[2024-05-24 11:11:23] [INFO ] Deduced a trap composed of 19 places in 1033 ms of which 10 ms to minimize.
[2024-05-24 11:11:24] [INFO ] Deduced a trap composed of 37 places in 933 ms of which 3 ms to minimize.
[2024-05-24 11:11:25] [INFO ] Deduced a trap composed of 116 places in 876 ms of which 3 ms to minimize.
[2024-05-24 11:11:26] [INFO ] Deduced a trap composed of 3 places in 711 ms of which 3 ms to minimize.
[2024-05-24 11:11:26] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 1 ms to minimize.
[2024-05-24 11:11:27] [INFO ] Deduced a trap composed of 84 places in 635 ms of which 1 ms to minimize.
[2024-05-24 11:11:28] [INFO ] Deduced a trap composed of 74 places in 1059 ms of which 2 ms to minimize.
[2024-05-24 11:11:29] [INFO ] Deduced a trap composed of 3 places in 840 ms of which 2 ms to minimize.
[2024-05-24 11:11:30] [INFO ] Deduced a trap composed of 3 places in 599 ms of which 1 ms to minimize.
[2024-05-24 11:11:31] [INFO ] Deduced a trap composed of 3 places in 746 ms of which 1 ms to minimize.
[2024-05-24 11:11:31] [INFO ] Deduced a trap composed of 35 places in 493 ms of which 1 ms to minimize.
[2024-05-24 11:11:32] [INFO ] Deduced a trap composed of 43 places in 565 ms of which 1 ms to minimize.
[2024-05-24 11:11:32] [INFO ] Deduced a trap composed of 33 places in 616 ms of which 1 ms to minimize.
[2024-05-24 11:11:33] [INFO ] Deduced a trap composed of 33 places in 617 ms of which 1 ms to minimize.
[2024-05-24 11:11:34] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 2 ms to minimize.
[2024-05-24 11:11:34] [INFO ] Deduced a trap composed of 3 places in 506 ms of which 1 ms to minimize.
[2024-05-24 11:11:35] [INFO ] Deduced a trap composed of 46 places in 506 ms of which 1 ms to minimize.
[2024-05-24 11:11:35] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 0 ms to minimize.
[2024-05-24 11:11:36] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 0 ms to minimize.
[2024-05-24 11:11:36] [INFO ] Deduced a trap composed of 3 places in 459 ms of which 2 ms to minimize.
[2024-05-24 11:11:37] [INFO ] Deduced a trap composed of 120 places in 348 ms of which 1 ms to minimize.
[2024-05-24 11:11:37] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 1 ms to minimize.
[2024-05-24 11:11:37] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 11:11:37] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 0 ms to minimize.
[2024-05-24 11:11:38] [INFO ] Deduced a trap composed of 63 places in 327 ms of which 1 ms to minimize.
[2024-05-24 11:11:38] [INFO ] Deduced a trap composed of 70 places in 247 ms of which 0 ms to minimize.
[2024-05-24 11:11:39] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 0 ms to minimize.
[2024-05-24 11:11:39] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 1 ms to minimize.
[2024-05-24 11:11:39] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 0 ms to minimize.
[2024-05-24 11:11:39] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2024-05-24 11:11:40] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2024-05-24 11:11:40] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 0 ms to minimize.
[2024-05-24 11:11:40] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2024-05-24 11:11:40] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2024-05-24 11:11:40] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 6 ms to minimize.
[2024-05-24 11:11:40] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 18645 ms
[2024-05-24 11:11:41] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2024-05-24 11:11:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-24 11:11:42] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 1 ms to minimize.
[2024-05-24 11:11:43] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2024-05-24 11:11:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2024-05-24 11:11:44] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2024-05-24 11:11:44] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-24 11:11:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2024-05-24 11:11:45] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2024-05-24 11:11:45] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-05-24 11:11:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2024-05-24 11:11:47] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 11:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-24 11:11:49] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2024-05-24 11:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-05-24 11:11:51] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 1 ms to minimize.
[2024-05-24 11:11:51] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 1 ms to minimize.
[2024-05-24 11:11:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 886 ms
[2024-05-24 11:11:52] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
[2024-05-24 11:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2024-05-24 11:11:52] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-24 11:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-05-24 11:11:52] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2024-05-24 11:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-24 11:11:53] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2024-05-24 11:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-05-24 11:11:53] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2024-05-24 11:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-24 11:11:54] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2024-05-24 11:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-05-24 11:11:55] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2024-05-24 11:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-24 11:11:55] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 0 ms to minimize.
SDD proceeding with computation,984 properties remain. new max is 16384
[2024-05-24 11:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
SDD size :127811 after 147649
[2024-05-24 11:11:58] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 1 ms to minimize.
[2024-05-24 11:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2024-05-24 11:12:01] [INFO ] Deduced a trap composed of 70 places in 302 ms of which 1 ms to minimize.
[2024-05-24 11:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-05-24 11:12:03] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 16 ms to minimize.
[2024-05-24 11:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2024-05-24 11:12:06] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2024-05-24 11:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-24 11:12:08] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 1 ms to minimize.
[2024-05-24 11:12:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-24 11:12:08] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-24 11:12:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-05-24 11:12:10] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2024-05-24 11:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-24 11:12:10] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2024-05-24 11:12:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2024-05-24 11:12:13] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2024-05-24 11:12:13] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2024-05-24 11:12:13] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2024-05-24 11:12:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 670 ms
[2024-05-24 11:12:15] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 0 ms to minimize.
[2024-05-24 11:12:15] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-05-24 11:12:15] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 12 ms to minimize.
[2024-05-24 11:12:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 615 ms
[2024-05-24 11:12:17] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2024-05-24 11:12:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
Invariant property smplace_792 does not hold.
Invariant property smplace_771 does not hold.
Invariant property smplace_770 does not hold.
Invariant property smplace_761 does not hold.
[2024-05-24 11:12:18] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 0 ms to minimize.
[2024-05-24 11:12:19] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 0 ms to minimize.
[2024-05-24 11:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2024-05-24 11:12:19] [INFO ] Deduced a trap composed of 104 places in 681 ms of which 1 ms to minimize.
[2024-05-24 11:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 816 ms
[2024-05-24 11:12:20] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2024-05-24 11:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-24 11:12:23] [INFO ] Deduced a trap composed of 93 places in 670 ms of which 1 ms to minimize.
[2024-05-24 11:12:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 794 ms
SDD proceeding with computation,980 properties remain. new max is 16384
SDD size :147649 after 207646
[2024-05-24 11:12:29] [INFO ] After 88397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :352
Attempting to minimize the solution found.
Minimization took 19933 ms.
[2024-05-24 11:12:49] [INFO ] After 139465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :352
Fused 352 Parikh solutions to 247 different solutions.
Invariant property smplace_773 does not hold.
SDD proceeding with computation,979 properties remain. new max is 16384
SDD size :207646 after 237224
Parikh walk visited 1 properties in 23780 ms.
Support contains 345 out of 732 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 732/732 places, 4032/4032 transitions.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 5 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 0 with 104 rules applied. Total rules applied 104 place count 680 transition count 3980
Applied a total of 104 rules in 447 ms. Remains 680 /732 variables (removed 52) and now considering 3980/4032 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 680/732 places, 3980/4032 transitions.
Interrupted random walk after 314318 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 344) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 344) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 343) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 342) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 342) seen :0
Invariant property smplace_367 does not hold.
Invariant property smplace_289 does not hold.
Invariant property smplace_278 does not hold.
Invariant property smplace_277 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_53 does not hold.
Invariant property smplace_43 does not hold.
Invariant property smplace_20 does not hold.
Invariant property smplace_19 does not hold.
SDD proceeding with computation,967 properties remain. new max is 16384
SDD size :237224 after 1.05024e+06
SDD proceeding with computation,967 properties remain. new max is 32768
SDD size :1.05024e+06 after 1.22764e+06
Interrupted probabilistic random walk after 3000283 steps, run timeout after 117001 ms. (steps per millisecond=25 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 49=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 66=1, 67=1, 68=1, 69=1, 70=1, 71=1, 72=1, 73=1, 74=1, 75=1, 76=1, 77=1, 78=1, 79=1, 80=1, 81=1, 82=1, 83=1, 84=1, 85=1, 86=1, 87=1, 88=1, 89=1, 90=1, 91=1, 92=1, 93=1, 94=1, 98=1, 99=1, 100=1, 103=1, 104=1, 105=1, 106=1, 107=1, 110=1, 111=1, 112=1, 113=1, 115=1, 116=1, 117=1, 118=1, 119=1, 120=1, 121=1, 122=1, 124=1, 125=1, 126=1, 127=1, 128=1, 129=1, 130=1, 131=1, 132=1, 133=1, 134=1, 135=1, 136=1, 137=1, 138=1, 139=1, 140=1, 141=1, 142=1, 144=1, 145=1, 146=1, 147=1, 148=1, 149=1, 150=1, 151=1, 152=1, 154=1, 155=1, 156=1, 157=1, 158=1, 159=1, 160=1, 161=1, 162=1, 163=1, 164=1, 165=1, 166=1, 167=1, 168=1, 169=1, 170=1, 171=1, 172=1, 173=1, 174=1, 175=1, 176=1, 177=1, 178=1, 179=1, 180=1, 181=1, 182=1, 183=1, 184=1, 185=1, 186=1, 187=1, 188=1, 189=1, 190=1, 191=1, 192=1, 193=1, 194=1, 195=1, 196=1, 197=1, 198=1, 199=1, 200=1, 201=1, 202=1, 203=1, 204=1, 205=1, 206=1, 207=1, 208=1, 209=1, 210=1, 211=1, 212=1, 213=1, 214=1, 215=1, 216=1, 217=1, 218=1, 219=1, 220=1, 221=1, 222=1, 223=1, 224=1, 225=1, 226=1, 227=1, 228=1, 229=1, 230=1, 231=1, 232=1, 233=1, 234=1, 235=1, 236=1, 237=1, 238=1, 239=1, 240=1, 241=1, 242=1, 243=1, 244=1, 245=1, 246=1, 247=1, 248=1, 249=1, 250=1, 251=1, 252=1, 253=1, 254=1, 255=1, 256=1, 257=1, 258=1, 259=1, 262=1, 263=1, 264=1, 265=1, 266=1, 267=1, 268=1, 269=1, 272=1, 273=1, 274=1, 275=1, 276=1, 277=1, 278=1, 282=1, 283=1, 284=1, 285=1, 286=1, 287=1, 292=1, 293=1, 294=1, 295=1, 296=1, 297=1, 302=1, 303=1, 304=1, 305=1, 306=1, 308=1, 309=1, 310=1, 312=1, 313=1, 314=1, 315=1, 316=1, 317=1, 318=1, 319=1, 320=1, 321=1, 322=1, 323=1, 324=1, 325=1, 326=1, 327=1, 328=1, 329=1, 330=1, 331=1, 332=1, 333=1, 334=1, 335=1, 336=1, 337=1, 338=1, 339=1, 340=1, 341=1}
Probabilistic random walk after 3000283 steps, saw 1667829 distinct states, run finished after 117006 ms. (steps per millisecond=25 ) properties seen :314
Running SMT prover for 28 properties.
[2024-05-24 11:15:50] [INFO ] Flow matrix only has 1110 transitions (discarded 2870 similar events)
// Phase 1: matrix 1110 rows 680 cols
[2024-05-24 11:15:50] [INFO ] Computed 31 invariants in 21 ms
[2024-05-24 11:15:50] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2024-05-24 11:15:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2024-05-24 11:15:51] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:15:53] [INFO ] After 1522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2024-05-24 11:15:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:15:55] [INFO ] After 1899ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2024-05-24 11:15:55] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 1 ms to minimize.
[2024-05-24 11:15:55] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2024-05-24 11:15:55] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2024-05-24 11:15:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 730 ms
[2024-05-24 11:15:56] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 1 ms to minimize.
[2024-05-24 11:15:56] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 0 ms to minimize.
[2024-05-24 11:15:56] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2024-05-24 11:15:57] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2024-05-24 11:15:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1239 ms
[2024-05-24 11:15:57] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-24 11:15:57] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2024-05-24 11:15:57] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 11:15:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 614 ms
[2024-05-24 11:15:58] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-24 11:15:58] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2024-05-24 11:15:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2024-05-24 11:15:58] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-24 11:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-24 11:15:59] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2024-05-24 11:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-24 11:15:59] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 0 ms to minimize.
[2024-05-24 11:15:59] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2024-05-24 11:15:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2024-05-24 11:15:59] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2024-05-24 11:16:00] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 1 ms to minimize.
[2024-05-24 11:16:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2024-05-24 11:16:00] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2024-05-24 11:16:00] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-05-24 11:16:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 518 ms
[2024-05-24 11:16:01] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2024-05-24 11:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-24 11:16:02] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2024-05-24 11:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2024-05-24 11:16:02] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2024-05-24 11:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-24 11:16:03] [INFO ] After 9825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1694 ms.
[2024-05-24 11:16:04] [INFO ] After 13959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 28 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 1476 ms.
Support contains 28 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 3980/3980 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 680 transition count 3890
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 256 ms. Remains 590 /680 variables (removed 90) and now considering 3890/3980 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 590/680 places, 3890/3980 transitions.
Interrupted random walk after 872646 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=212 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=203 ) properties (out of 28) seen :0
Invariant property smplace_368 does not hold.
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=152 ) properties (out of 28) seen :0
Invariant property smplace_279 does not hold.
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=231 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=277 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=278 ) properties (out of 28) seen :0
Invariant property smplace_189 does not hold.
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=221 ) properties (out of 28) seen :0
Invariant property smplace_92 does not hold.
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=219 ) properties (out of 28) seen :0
SDD proceeding with computation,963 properties remain. new max is 32768
SDD size :1.22764e+06 after 1.84697e+06
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=266 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=270 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=261 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=273 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=279 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=223 ) properties (out of 28) seen :0
SDD proceeding with computation,963 properties remain. new max is 65536
SDD size :1.84697e+06 after 2.4753e+06
Interrupted probabilistic random walk after 4344054 steps, run timeout after 123001 ms. (steps per millisecond=35 ) properties seen :{1=1, 2=1, 6=1, 8=1, 22=1, 24=1, 26=1, 27=1}
Probabilistic random walk after 4344054 steps, saw 2350573 distinct states, run finished after 123002 ms. (steps per millisecond=35 ) properties seen :8
Running SMT prover for 20 properties.
[2024-05-24 11:18:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:18:51] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 11:18:51] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-24 11:18:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 29 ms returned sat
[2024-05-24 11:18:51] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:18:53] [INFO ] After 1642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-24 11:18:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:18:55] [INFO ] After 1706ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-05-24 11:18:56] [INFO ] Deduced a trap composed of 3 places in 522 ms of which 1 ms to minimize.
[2024-05-24 11:18:56] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 0 ms to minimize.
[2024-05-24 11:18:57] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 1 ms to minimize.
[2024-05-24 11:18:57] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 0 ms to minimize.
[2024-05-24 11:18:57] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
[2024-05-24 11:18:57] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2024-05-24 11:18:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2434 ms
[2024-05-24 11:18:58] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 0 ms to minimize.
[2024-05-24 11:18:58] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 0 ms to minimize.
[2024-05-24 11:18:59] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 1 ms to minimize.
[2024-05-24 11:18:59] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2024-05-24 11:18:59] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2024-05-24 11:18:59] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-24 11:19:00] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2024-05-24 11:19:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2171 ms
[2024-05-24 11:19:00] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2024-05-24 11:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2024-05-24 11:19:00] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2024-05-24 11:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2024-05-24 11:19:01] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 1 ms to minimize.
[2024-05-24 11:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-05-24 11:19:01] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2024-05-24 11:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-24 11:19:02] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2024-05-24 11:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-05-24 11:19:02] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 0 ms to minimize.
[2024-05-24 11:19:02] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-24 11:19:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2024-05-24 11:19:03] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 0 ms to minimize.
[2024-05-24 11:19:03] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 1 ms to minimize.
[2024-05-24 11:19:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 607 ms
[2024-05-24 11:19:04] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 1 ms to minimize.
[2024-05-24 11:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-05-24 11:19:04] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-05-24 11:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-05-24 11:19:05] [INFO ] After 11360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1498 ms.
[2024-05-24 11:19:06] [INFO ] After 15287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 781 ms.
Support contains 20 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 289 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 590/590 places, 3890/3890 transitions.
Detected timeout of ITS tools.
[2024-05-24 11:19:08] [INFO ] Flatten gal took : 492 ms
[2024-05-24 11:19:08] [INFO ] Applying decomposition
[2024-05-24 11:19:09] [INFO ] Flatten gal took : 409 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/graph12896927381739152074.txt' '-o' '/tmp/graph12896927381739152074.bin' '-w' '/tmp/graph12896927381739152074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12896927381739152074.bin' '-l' '-1' '-v' '-w' '/tmp/graph12896927381739152074.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:19:10] [INFO ] Decomposing Gal with order
[2024-05-24 11:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:19:12] [INFO ] Removed a total of 10746 redundant transitions.
[2024-05-24 11:19:12] [INFO ] Flatten gal took : 1765 ms
[2024-05-24 11:19:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 754 labels/synchronizations in 671 ms.
[2024-05-24 11:19:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3514097468269221001.gal : 68 ms
[2024-05-24 11:19:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14818244186097721016.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3514097468269221001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14818244186097721016.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14818244186097721016.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :1 after 2
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :2 after 8
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :8 after 225
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :225 after 1335
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :1335 after 22881
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :22881 after 562322
Interrupted random walk after 874241 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=236 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=217 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=212 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=202 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=231 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=216 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 20) seen :0
Invariant property smplace_762 does not hold.
SDD proceeding with computation,19 properties remain. new max is 4096
SDD size :562322 after 2.42863e+06
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=240 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=236 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=232 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=235 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=233 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=232 ) properties (out of 20) seen :0
SDD proceeding with computation,19 properties remain. new max is 8192
SDD size :2.42863e+06 after 3.66932e+07
SDD proceeding with computation,19 properties remain. new max is 16384
SDD size :3.66932e+07 after 1.60469e+08
Interrupted probabilistic random walk after 3644388 steps, run timeout after 114001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 3644388 steps, saw 2008667 distinct states, run finished after 114005 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 20 properties.
[2024-05-24 11:21:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:21:40] [INFO ] Invariant cache hit.
[2024-05-24 11:21:40] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-24 11:21:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2024-05-24 11:21:41] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-24 11:21:42] [INFO ] After 1167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-24 11:21:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:21:44] [INFO ] After 1214ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-05-24 11:21:44] [INFO ] Deduced a trap composed of 3 places in 510 ms of which 4 ms to minimize.
[2024-05-24 11:21:45] [INFO ] Deduced a trap composed of 46 places in 503 ms of which 1 ms to minimize.
[2024-05-24 11:21:45] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 1 ms to minimize.
[2024-05-24 11:21:45] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 1 ms to minimize.
[2024-05-24 11:21:46] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 1 ms to minimize.
[2024-05-24 11:21:46] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
[2024-05-24 11:21:46] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 1 ms to minimize.
[2024-05-24 11:21:47] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2024-05-24 11:21:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3056 ms
[2024-05-24 11:21:47] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2024-05-24 11:21:47] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2024-05-24 11:21:47] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-24 11:21:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 653 ms
[2024-05-24 11:21:48] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-24 11:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-24 11:21:48] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 1 ms to minimize.
[2024-05-24 11:21:48] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2024-05-24 11:21:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2024-05-24 11:21:48] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-24 11:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-24 11:21:49] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 0 ms to minimize.
[2024-05-24 11:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2024-05-24 11:21:50] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2024-05-24 11:21:50] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-24 11:21:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2024-05-24 11:21:50] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 1 ms to minimize.
[2024-05-24 11:21:51] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-24 11:21:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2024-05-24 11:21:51] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2024-05-24 11:21:51] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 0 ms to minimize.
[2024-05-24 11:21:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2024-05-24 11:21:51] [INFO ] After 8883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1176 ms.
[2024-05-24 11:21:52] [INFO ] After 11884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 838 ms.
Support contains 19 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 194 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 590/590 places, 3890/3890 transitions.
SDD proceeding with computation,19 properties remain. new max is 32768
SDD size :1.60469e+08 after 2.4578e+08
Interrupted random walk after 760006 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=251 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=209 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=215 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=217 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=214 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=212 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=215 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=215 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=215 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=212 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=212 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=238 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=219 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 3731904 steps, run timeout after 114001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 3731904 steps, saw 2053905 distinct states, run finished after 114002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 19 properties.
[2024-05-24 11:24:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:24:26] [INFO ] Invariant cache hit.
[2024-05-24 11:24:26] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:24:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:24:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 11:24:28] [INFO ] After 1066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-24 11:24:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:24:29] [INFO ] After 1008ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2024-05-24 11:24:29] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 0 ms to minimize.
[2024-05-24 11:24:30] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2024-05-24 11:24:30] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-05-24 11:24:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 671 ms
[2024-05-24 11:24:30] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 1 ms to minimize.
[2024-05-24 11:24:30] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 0 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 0 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1092 ms
[2024-05-24 11:24:31] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2024-05-24 11:24:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 477 ms
[2024-05-24 11:24:32] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-24 11:24:32] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2024-05-24 11:24:32] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2024-05-24 11:24:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2024-05-24 11:24:33] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2024-05-24 11:24:33] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2024-05-24 11:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2024-05-24 11:24:33] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2024-05-24 11:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-24 11:24:33] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-05-24 11:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-24 11:24:34] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2024-05-24 11:24:34] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2024-05-24 11:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2024-05-24 11:24:34] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-05-24 11:24:34] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2024-05-24 11:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2024-05-24 11:24:35] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 0 ms to minimize.
[2024-05-24 11:24:35] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2024-05-24 11:24:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2024-05-24 11:24:35] [INFO ] After 6719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 933 ms.
[2024-05-24 11:24:36] [INFO ] After 9302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 594 ms.
Support contains 19 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 198 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 195 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:24:37] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:24:37] [INFO ] Invariant cache hit.
[2024-05-24 11:24:38] [INFO ] Implicit Places using invariants in 1366 ms returned []
[2024-05-24 11:24:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:24:38] [INFO ] Invariant cache hit.
[2024-05-24 11:24:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:24:44] [INFO ] Implicit Places using invariants and state equation in 6062 ms returned []
Implicit Place search using SMT with State Equation took 7442 ms to find 0 implicit places.
[2024-05-24 11:24:45] [INFO ] Redundant transitions in 404 ms returned []
[2024-05-24 11:24:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:24:45] [INFO ] Invariant cache hit.
[2024-05-24 11:24:48] [INFO ] Dead Transitions using invariants and state equation in 3676 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11739 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4157 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-24 11:24:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:24:52] [INFO ] Invariant cache hit.
[2024-05-24 11:24:53] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:24:53] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:24:53] [INFO ] After 393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19
[2024-05-24 11:24:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:24:53] [INFO ] After 278ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :19
[2024-05-24 11:24:55] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 1 ms to minimize.
[2024-05-24 11:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2024-05-24 11:24:56] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 1 ms to minimize.
[2024-05-24 11:24:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2024-05-24 11:24:56] [INFO ] After 2866ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:24:56] [INFO ] After 3443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:24:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2024-05-24 11:24:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:24:57] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-24 11:24:57] [INFO ] After 417ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2024-05-24 11:24:58] [INFO ] Deduced a trap composed of 3 places in 505 ms of which 1 ms to minimize.
[2024-05-24 11:24:58] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 0 ms to minimize.
[2024-05-24 11:24:58] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 0 ms to minimize.
[2024-05-24 11:24:59] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 1 ms to minimize.
[2024-05-24 11:24:59] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 1 ms to minimize.
[2024-05-24 11:24:59] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2024-05-24 11:25:00] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2024-05-24 11:25:00] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-24 11:25:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2886 ms
[2024-05-24 11:25:00] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-24 11:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-05-24 11:25:00] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 11:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-24 11:25:00] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-24 11:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-05-24 11:25:01] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2024-05-24 11:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-24 11:25:01] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-05-24 11:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 11:25:01] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-05-24 11:25:01] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-24 11:25:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2024-05-24 11:25:02] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-05-24 11:25:02] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-24 11:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2024-05-24 11:25:02] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 11:25:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 11:25:03] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2024-05-24 11:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-24 11:25:03] [INFO ] After 6442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 270 ms.
[2024-05-24 11:25:03] [INFO ] After 7300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Interrupted random walk after 887519 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=265 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=232 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=259 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=239 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=238 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=242 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=247 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=245 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=252 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=294 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=246 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=279 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=271 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=239 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=245 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=243 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 3866731 steps, run timeout after 111001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 3866731 steps, saw 2120725 distinct states, run finished after 111002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 19 properties.
[2024-05-24 11:27:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:27:32] [INFO ] Invariant cache hit.
[2024-05-24 11:27:32] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:27:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2024-05-24 11:27:33] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:27:34] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-24 11:27:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:27:35] [INFO ] After 1043ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2024-05-24 11:27:35] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 1 ms to minimize.
[2024-05-24 11:27:35] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2024-05-24 11:27:36] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2024-05-24 11:27:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 662 ms
[2024-05-24 11:27:36] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 1 ms to minimize.
[2024-05-24 11:27:36] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 0 ms to minimize.
[2024-05-24 11:27:36] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 1 ms to minimize.
[2024-05-24 11:27:37] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2024-05-24 11:27:37] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-24 11:27:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1093 ms
[2024-05-24 11:27:37] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2024-05-24 11:27:37] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 11:27:37] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-24 11:27:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 459 ms
[2024-05-24 11:27:38] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-05-24 11:27:38] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2024-05-24 11:27:38] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-05-24 11:27:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 555 ms
[2024-05-24 11:27:38] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-24 11:27:38] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 0 ms to minimize.
[2024-05-24 11:27:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2024-05-24 11:27:39] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-05-24 11:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-24 11:27:39] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-05-24 11:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-24 11:27:39] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 0 ms to minimize.
[2024-05-24 11:27:40] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2024-05-24 11:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2024-05-24 11:27:40] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-05-24 11:27:40] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-24 11:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2024-05-24 11:27:40] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2024-05-24 11:27:40] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2024-05-24 11:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2024-05-24 11:27:41] [INFO ] After 6723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 941 ms.
[2024-05-24 11:27:42] [INFO ] After 9327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 579 ms.
Support contains 19 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 177 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 192 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:27:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:27:42] [INFO ] Invariant cache hit.
[2024-05-24 11:27:43] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-24 11:27:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:27:43] [INFO ] Invariant cache hit.
[2024-05-24 11:27:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:27:49] [INFO ] Implicit Places using invariants and state equation in 5417 ms returned []
Implicit Place search using SMT with State Equation took 6328 ms to find 0 implicit places.
[2024-05-24 11:27:49] [INFO ] Redundant transitions in 204 ms returned []
[2024-05-24 11:27:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:27:49] [INFO ] Invariant cache hit.
[2024-05-24 11:27:52] [INFO ] Dead Transitions using invariants and state equation in 2949 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9682 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3579 ms. (steps per millisecond=27 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-24 11:27:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:27:56] [INFO ] Invariant cache hit.
[2024-05-24 11:27:56] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2024-05-24 11:27:56] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:27:56] [INFO ] After 388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19
[2024-05-24 11:27:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:27:56] [INFO ] After 305ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :19
[2024-05-24 11:27:58] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 1 ms to minimize.
[2024-05-24 11:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2024-05-24 11:27:59] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 0 ms to minimize.
[2024-05-24 11:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2024-05-24 11:27:59] [INFO ] After 2724ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:27:59] [INFO ] After 3281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:27:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:27:59] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:27:59] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-24 11:28:00] [INFO ] After 400ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2024-05-24 11:28:00] [INFO ] Deduced a trap composed of 3 places in 487 ms of which 0 ms to minimize.
[2024-05-24 11:28:01] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 0 ms to minimize.
[2024-05-24 11:28:01] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 0 ms to minimize.
[2024-05-24 11:28:02] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 1 ms to minimize.
[2024-05-24 11:28:02] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 0 ms to minimize.
[2024-05-24 11:28:02] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2024-05-24 11:28:02] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 1 ms to minimize.
[2024-05-24 11:28:03] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2024-05-24 11:28:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2788 ms
[2024-05-24 11:28:03] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-24 11:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-24 11:28:03] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2024-05-24 11:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-24 11:28:03] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2024-05-24 11:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-24 11:28:03] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2024-05-24 11:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-24 11:28:04] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-24 11:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-24 11:28:04] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-05-24 11:28:04] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-24 11:28:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2024-05-24 11:28:05] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 0 ms to minimize.
[2024-05-24 11:28:05] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2024-05-24 11:28:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2024-05-24 11:28:05] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-24 11:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-24 11:28:06] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2024-05-24 11:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-05-24 11:28:06] [INFO ] After 6302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 265 ms.
[2024-05-24 11:28:06] [INFO ] After 7119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263791 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263791 steps, saw 179886 distinct states, run finished after 3005 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:28:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:09] [INFO ] Invariant cache hit.
[2024-05-24 11:28:09] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:28:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 11:28:10] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:10] [INFO ] After 130ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:10] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-24 11:28:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-24 11:28:10] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 11:28:10] [INFO ] After 927ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 189 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261316 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261316 steps, saw 178415 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:28:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:13] [INFO ] Invariant cache hit.
[2024-05-24 11:28:13] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:28:14] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:28:14] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:14] [INFO ] After 131ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2024-05-24 11:28:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-05-24 11:28:14] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-24 11:28:14] [INFO ] After 936ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 173 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 176 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:28:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:15] [INFO ] Invariant cache hit.
[2024-05-24 11:28:16] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-05-24 11:28:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:16] [INFO ] Invariant cache hit.
[2024-05-24 11:28:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:21] [INFO ] Implicit Places using invariants and state equation in 5276 ms returned []
Implicit Place search using SMT with State Equation took 6256 ms to find 0 implicit places.
[2024-05-24 11:28:21] [INFO ] Redundant transitions in 337 ms returned []
[2024-05-24 11:28:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:21] [INFO ] Invariant cache hit.
[2024-05-24 11:28:24] [INFO ] Dead Transitions using invariants and state equation in 2341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9126 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 14 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 132 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 11:28:24] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 11:28:24] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 11:28:24] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:28:24] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:24] [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-24 11:28:24] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268444 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268444 steps, saw 182732 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:28:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:28:27] [INFO ] Computed 31 invariants in 11 ms
[2024-05-24 11:28:27] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 11:28:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 11:28:28] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:28] [INFO ] After 136ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:28] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-24 11:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-05-24 11:28:28] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-24 11:28:28] [INFO ] After 919ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 290 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262075 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262075 steps, saw 178846 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:28:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:31] [INFO ] Invariant cache hit.
[2024-05-24 11:28:32] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 11:28:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:28:32] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:32] [INFO ] After 176ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:32] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2024-05-24 11:28:33] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2024-05-24 11:28:33] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-24 11:28:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 576 ms
[2024-05-24 11:28:33] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-24 11:28:33] [INFO ] After 1384ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 210 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 203 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:28:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:33] [INFO ] Invariant cache hit.
[2024-05-24 11:28:35] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2024-05-24 11:28:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:35] [INFO ] Invariant cache hit.
[2024-05-24 11:28:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:41] [INFO ] Implicit Places using invariants and state equation in 5979 ms returned []
Implicit Place search using SMT with State Equation took 7434 ms to find 0 implicit places.
[2024-05-24 11:28:41] [INFO ] Redundant transitions in 322 ms returned []
[2024-05-24 11:28:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:41] [INFO ] Invariant cache hit.
[2024-05-24 11:28:43] [INFO ] Dead Transitions using invariants and state equation in 2083 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10054 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 77 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 11:28:43] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:28:43] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:28:43] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:28:43] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:44] [INFO ] After 25ms 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-24 11:28:44] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264286 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264286 steps, saw 180165 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:28:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:28:47] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 11:28:47] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2024-05-24 11:28:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:28:47] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:47] [INFO ] After 153ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:48] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2024-05-24 11:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-24 11:28:48] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-24 11:28:48] [INFO ] After 984ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 213 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265760 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265760 steps, saw 181214 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:28:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:51] [INFO ] Invariant cache hit.
[2024-05-24 11:28:51] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:28:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2024-05-24 11:28:51] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:28:52] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:52] [INFO ] After 171ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:28:52] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 4 ms to minimize.
[2024-05-24 11:28:52] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 11:28:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2024-05-24 11:28:52] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-24 11:28:52] [INFO ] After 1152ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 162 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:28:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:53] [INFO ] Invariant cache hit.
[2024-05-24 11:28:54] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-24 11:28:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:28:54] [INFO ] Invariant cache hit.
[2024-05-24 11:28:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:28:59] [INFO ] Implicit Places using invariants and state equation in 5915 ms returned []
Implicit Place search using SMT with State Equation took 6877 ms to find 0 implicit places.
[2024-05-24 11:29:00] [INFO ] Redundant transitions in 321 ms returned []
[2024-05-24 11:29:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:00] [INFO ] Invariant cache hit.
[2024-05-24 11:29:03] [INFO ] Dead Transitions using invariants and state equation in 3635 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11015 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 65 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 11:29:03] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 11:29:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-24 11:29:04] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:29:04] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:04] [INFO ] After 29ms 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-24 11:29:04] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264792 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264792 steps, saw 180537 distinct states, run finished after 3005 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:29:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:29:07] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 11:29:07] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2024-05-24 11:29:07] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:29:07] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:08] [INFO ] After 159ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:08] [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 48 ms.
[2024-05-24 11:29:08] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 182 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268015 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268015 steps, saw 182444 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:29:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:11] [INFO ] Invariant cache hit.
[2024-05-24 11:29:11] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2024-05-24 11:29:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:29:12] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:12] [INFO ] After 191ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:12] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2024-05-24 11:29:12] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2024-05-24 11:29:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2024-05-24 11:29:12] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-24 11:29:12] [INFO ] After 1260ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 163 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 162 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:29:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:13] [INFO ] Invariant cache hit.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9162538612517466313
[2024-05-24 11:29:14] [INFO ] Implicit Places using invariants in 1166 ms returned []
[2024-05-24 11:29:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:14] [INFO ] Invariant cache hit.
[2024-05-24 11:29:14] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9162538612517466313
Running compilation step : cd /tmp/ltsmin9162538612517466313;'/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'
[2024-05-24 11:29:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:20] [INFO ] Implicit Places using invariants and state equation in 6077 ms returned []
Implicit Place search using SMT with State Equation took 7246 ms to find 0 implicit places.
[2024-05-24 11:29:20] [INFO ] Redundant transitions in 328 ms returned []
[2024-05-24 11:29:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:20] [INFO ] Invariant cache hit.
[2024-05-24 11:29:24] [INFO ] Dead Transitions using invariants and state equation in 3681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11428 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 44 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 11:29:24] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:29:24] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-24 11:29:24] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:29:24] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:24] [INFO ] After 25ms 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-24 11:29:24] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265452 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265452 steps, saw 181018 distinct states, run finished after 3005 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:29:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:29:27] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 11:29:27] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:29:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:29:28] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:28] [INFO ] After 149ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:28] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2024-05-24 11:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-24 11:29:28] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-24 11:29:28] [INFO ] After 937ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 163 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267817 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267817 steps, saw 182311 distinct states, run finished after 3003 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:29:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:32] [INFO ] Invariant cache hit.
[2024-05-24 11:29:32] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 11:29:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2024-05-24 11:29:32] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:32] [INFO ] After 179ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:33] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2024-05-24 11:29:33] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2024-05-24 11:29:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2024-05-24 11:29:33] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-24 11:29:33] [INFO ] After 1243ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 166 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 168 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:29:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:33] [INFO ] Invariant cache hit.
[2024-05-24 11:29:34] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-24 11:29:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:34] [INFO ] Invariant cache hit.
[2024-05-24 11:29:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:40] [INFO ] Implicit Places using invariants and state equation in 5737 ms returned []
Implicit Place search using SMT with State Equation took 6678 ms to find 0 implicit places.
[2024-05-24 11:29:40] [INFO ] Redundant transitions in 324 ms returned []
[2024-05-24 11:29:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:40] [INFO ] Invariant cache hit.
[2024-05-24 11:29:44] [INFO ] Dead Transitions using invariants and state equation in 3638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10816 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 50 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 11:29:44] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:29:44] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:29:44] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:29:44] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:44] [INFO ] After 21ms 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-24 11:29:44] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Compilation finished in 30831 ms.
Running link step : cd /tmp/ltsmin9162538612517466313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin9162538612517466313;'/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' '-i' 'smplace_772==true'
Interrupted probabilistic random walk after 169895 steps, run timeout after 3008 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169895 steps, saw 119357 distinct states, run finished after 3008 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:29:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:29:47] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 11:29:48] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 40 ms returned sat
[2024-05-24 11:29:48] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 16 ms returned sat
[2024-05-24 11:29:49] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:49] [INFO ] After 336ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:49] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 1 ms to minimize.
[2024-05-24 11:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2024-05-24 11:29:49] [INFO ] After 752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-24 11:29:49] [INFO ] After 1968ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 412 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122804 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122804 steps, saw 89203 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:29:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:53] [INFO ] Invariant cache hit.
[2024-05-24 11:29:53] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:29:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-24 11:29:53] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:29:54] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:29:54] [INFO ] After 259ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:29:54] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2024-05-24 11:29:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-24 11:29:54] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-24 11:29:55] [INFO ] After 1364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 401 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 345 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:29:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:55] [INFO ] Invariant cache hit.
[2024-05-24 11:29:57] [INFO ] Implicit Places using invariants in 1661 ms returned []
[2024-05-24 11:29:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:29:57] [INFO ] Invariant cache hit.
[2024-05-24 11:29:58] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:30:09] [INFO ] Implicit Places using invariants and state equation in 12108 ms returned []
Implicit Place search using SMT with State Equation took 13779 ms to find 0 implicit places.
[2024-05-24 11:30:10] [INFO ] Redundant transitions in 685 ms returned []
[2024-05-24 11:30:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:10] [INFO ] Invariant cache hit.
[2024-05-24 11:30:14] [INFO ] Dead Transitions using invariants and state equation in 3761 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18588 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 171 transition count 342
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 162 transition count 342
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 162 transition count 333
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 775 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 866 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 957 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 967 place count 71 transition count 232
Applied a total of 967 rules in 110 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-05-24 11:30:14] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:30:14] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:30:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-24 11:30:14] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:30:14] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:14] [INFO ] After 33ms 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-24 11:30:14] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122067 steps, run timeout after 3012 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122067 steps, saw 88658 distinct states, run finished after 3012 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:30:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:30:17] [INFO ] Computed 31 invariants in 15 ms
[2024-05-24 11:30:17] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:30:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-24 11:30:18] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:30:18] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:18] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:30:18] [INFO ] After 244ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:18] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-24 11:30:19] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 396 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125444 steps, run timeout after 3011 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125444 steps, saw 90836 distinct states, run finished after 3011 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:30:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:22] [INFO ] Invariant cache hit.
[2024-05-24 11:30:22] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:30:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-24 11:30:23] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 19 ms returned sat
[2024-05-24 11:30:23] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:30:24] [INFO ] After 340ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:24] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-24 11:30:24] [INFO ] After 1454ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 379 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 387 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:30:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:25] [INFO ] Invariant cache hit.
[2024-05-24 11:30:26] [INFO ] Implicit Places using invariants in 1464 ms returned []
[2024-05-24 11:30:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:26] [INFO ] Invariant cache hit.
[2024-05-24 11:30:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:30:38] [INFO ] Implicit Places using invariants and state equation in 11603 ms returned []
Implicit Place search using SMT with State Equation took 13077 ms to find 0 implicit places.
[2024-05-24 11:30:38] [INFO ] Redundant transitions in 477 ms returned []
[2024-05-24 11:30:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:38] [INFO ] Invariant cache hit.
[2024-05-24 11:30:42] [INFO ] Dead Transitions using invariants and state equation in 3459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17452 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 119 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:30:42] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:30:42] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:30:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-24 11:30:42] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:30:42] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:42] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-24 11:30:42] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116655 steps, run timeout after 3016 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116655 steps, saw 85155 distinct states, run finished after 3016 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:30:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:30:45] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 11:30:46] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:30:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-24 11:30:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:30:46] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:46] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:30:47] [INFO ] After 220ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:47] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2024-05-24 11:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-24 11:30:47] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-24 11:30:47] [INFO ] After 1437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 383 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 119812 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119812 steps, saw 87202 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:30:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:51] [INFO ] Invariant cache hit.
[2024-05-24 11:30:51] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:30:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2024-05-24 11:30:51] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:30:52] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:30:52] [INFO ] After 207ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:30:52] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2024-05-24 11:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-05-24 11:30:52] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-24 11:30:52] [INFO ] After 1377ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 390 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 372 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:30:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:53] [INFO ] Invariant cache hit.
[2024-05-24 11:30:55] [INFO ] Implicit Places using invariants in 1632 ms returned []
[2024-05-24 11:30:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:30:55] [INFO ] Invariant cache hit.
[2024-05-24 11:30:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:31:06] [INFO ] Implicit Places using invariants and state equation in 11010 ms returned []
Implicit Place search using SMT with State Equation took 12644 ms to find 0 implicit places.
[2024-05-24 11:31:06] [INFO ] Redundant transitions in 472 ms returned []
[2024-05-24 11:31:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:06] [INFO ] Invariant cache hit.
[2024-05-24 11:31:10] [INFO ] Dead Transitions using invariants and state equation in 3762 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17295 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 72 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:31:10] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:31:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:31:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:31:10] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:31:10] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:10] [INFO ] After 20ms 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-24 11:31:10] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 115005 steps, run timeout after 3005 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115005 steps, saw 84023 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:31:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:31:13] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:31:14] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:31:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 46 ms returned sat
[2024-05-24 11:31:14] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 16 ms returned sat
[2024-05-24 11:31:15] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:31:15] [INFO ] After 228ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:15] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-24 11:31:15] [INFO ] After 1512ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 369 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118503 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118503 steps, saw 86306 distinct states, run finished after 3009 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:31:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:19] [INFO ] Invariant cache hit.
[2024-05-24 11:31:19] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:31:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 47 ms returned sat
[2024-05-24 11:31:19] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2024-05-24 11:31:20] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:31:20] [INFO ] After 267ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:20] [INFO ] After 403ms 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-24 11:31:21] [INFO ] After 1614ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 345 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 411 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:31:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:21] [INFO ] Invariant cache hit.
[2024-05-24 11:31:23] [INFO ] Implicit Places using invariants in 1495 ms returned []
[2024-05-24 11:31:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:23] [INFO ] Invariant cache hit.
[2024-05-24 11:31:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:31:36] [INFO ] Implicit Places using invariants and state equation in 12661 ms returned []
Implicit Place search using SMT with State Equation took 14158 ms to find 0 implicit places.
[2024-05-24 11:31:36] [INFO ] Redundant transitions in 585 ms returned []
[2024-05-24 11:31:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:36] [INFO ] Invariant cache hit.
[2024-05-24 11:31:39] [INFO ] Dead Transitions using invariants and state equation in 3277 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18475 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 96 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:31:40] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 11:31:40] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:31:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:31:40] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:31:40] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:40] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 11:31:40] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121682 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121682 steps, saw 88458 distinct states, run finished after 3013 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:31:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:31:43] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:31:43] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:31:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-24 11:31:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:31:44] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:31:44] [INFO ] After 304ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:44] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-24 11:31:45] [INFO ] After 1275ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 381 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116369 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116369 steps, saw 84990 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:31:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:48] [INFO ] Invariant cache hit.
[2024-05-24 11:31:48] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:31:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 49 ms returned sat
[2024-05-24 11:31:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 23 ms returned sat
[2024-05-24 11:31:49] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:31:50] [INFO ] After 268ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:31:50] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-24 11:31:50] [INFO ] After 1616ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 406 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 366 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:31:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:51] [INFO ] Invariant cache hit.
[2024-05-24 11:31:52] [INFO ] Implicit Places using invariants in 1546 ms returned []
[2024-05-24 11:31:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:31:52] [INFO ] Invariant cache hit.
[2024-05-24 11:31:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:32:04] [INFO ] Implicit Places using invariants and state equation in 12006 ms returned []
Implicit Place search using SMT with State Equation took 13566 ms to find 0 implicit places.
[2024-05-24 11:32:05] [INFO ] Redundant transitions in 458 ms returned []
[2024-05-24 11:32:05] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:05] [INFO ] Invariant cache hit.
[2024-05-24 11:32:08] [INFO ] Dead Transitions using invariants and state equation in 3351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17784 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 88 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:32:08] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:32:08] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:32:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2024-05-24 11:32:08] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:32:09] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:09] [INFO ] After 32ms 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-24 11:32:09] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 123079 steps, run timeout after 3009 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 123079 steps, saw 89394 distinct states, run finished after 3017 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:32:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:32:12] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:32:12] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:32:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2024-05-24 11:32:12] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:32:13] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:32:13] [INFO ] After 198ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:13] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2024-05-24 11:32:13] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2024-05-24 11:32:14] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2024-05-24 11:32:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 694 ms
[2024-05-24 11:32:14] [INFO ] After 954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-24 11:32:14] [INFO ] After 1855ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 348 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 119680 steps, run timeout after 3013 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119680 steps, saw 87083 distinct states, run finished after 3013 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:32:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:17] [INFO ] Invariant cache hit.
[2024-05-24 11:32:18] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:32:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2024-05-24 11:32:18] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-24 11:32:19] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:32:19] [INFO ] After 217ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:19] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-24 11:32:19] [INFO ] After 1468ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 372 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 378 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:32:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:20] [INFO ] Invariant cache hit.
[2024-05-24 11:32:21] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2024-05-24 11:32:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:21] [INFO ] Invariant cache hit.
[2024-05-24 11:32:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:32:34] [INFO ] Implicit Places using invariants and state equation in 12682 ms returned []
Implicit Place search using SMT with State Equation took 14222 ms to find 0 implicit places.
[2024-05-24 11:32:34] [INFO ] Redundant transitions in 500 ms returned []
[2024-05-24 11:32:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:35] [INFO ] Invariant cache hit.
[2024-05-24 11:32:38] [INFO ] Dead Transitions using invariants and state equation in 3492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18623 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 101 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:32:38] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:32:38] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:32:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:32:38] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:32:38] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:38] [INFO ] After 33ms 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-24 11:32:38] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116545 steps, run timeout after 3009 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116545 steps, saw 85097 distinct states, run finished after 3010 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:32:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:32:42] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:32:42] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:32:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 44 ms returned sat
[2024-05-24 11:32:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2024-05-24 11:32:43] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:32:43] [INFO ] After 222ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:43] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2024-05-24 11:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2024-05-24 11:32:43] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-24 11:32:44] [INFO ] After 1679ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 356 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121462 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121462 steps, saw 88356 distinct states, run finished after 3009 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:32:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:47] [INFO ] Invariant cache hit.
[2024-05-24 11:32:47] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:32:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2024-05-24 11:32:48] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-24 11:32:48] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:32:49] [INFO ] After 228ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:32:49] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-24 11:32:49] [INFO ] After 1487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 382 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 343 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:32:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:50] [INFO ] Invariant cache hit.
[2024-05-24 11:32:51] [INFO ] Implicit Places using invariants in 1674 ms returned []
[2024-05-24 11:32:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:32:51] [INFO ] Invariant cache hit.
[2024-05-24 11:32:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:33:03] [INFO ] Implicit Places using invariants and state equation in 11705 ms returned []
Implicit Place search using SMT with State Equation took 13381 ms to find 0 implicit places.
[2024-05-24 11:33:03] [INFO ] Redundant transitions in 431 ms returned []
[2024-05-24 11:33:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:03] [INFO ] Invariant cache hit.
[2024-05-24 11:33:07] [INFO ] Dead Transitions using invariants and state equation in 3734 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17932 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 74 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:33:07] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:33:07] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:33:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-24 11:33:07] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:33:07] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:07] [INFO ] After 31ms 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-24 11:33:07] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 113377 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113377 steps, saw 82953 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:33:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:33:11] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:33:11] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:33:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 33 ms returned sat
[2024-05-24 11:33:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:33:12] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:33:12] [INFO ] After 282ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:12] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2024-05-24 11:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-05-24 11:33:13] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-24 11:33:13] [INFO ] After 1807ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 356 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 113531 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113531 steps, saw 83056 distinct states, run finished after 3009 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:33:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:16] [INFO ] Invariant cache hit.
[2024-05-24 11:33:16] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:33:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 33 ms returned sat
[2024-05-24 11:33:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-24 11:33:17] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:17] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:33:18] [INFO ] After 210ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:18] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2024-05-24 11:33:18] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 0 ms to minimize.
[2024-05-24 11:33:18] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2024-05-24 11:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 876 ms
[2024-05-24 11:33:18] [INFO ] After 1157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-24 11:33:19] [INFO ] After 2134ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 352 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 358 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:33:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:19] [INFO ] Invariant cache hit.
[2024-05-24 11:33:21] [INFO ] Implicit Places using invariants in 1646 ms returned []
[2024-05-24 11:33:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:21] [INFO ] Invariant cache hit.
[2024-05-24 11:33:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:33:33] [INFO ] Implicit Places using invariants and state equation in 12481 ms returned []
Implicit Place search using SMT with State Equation took 14128 ms to find 0 implicit places.
[2024-05-24 11:33:34] [INFO ] Redundant transitions in 423 ms returned []
[2024-05-24 11:33:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:34] [INFO ] Invariant cache hit.
[2024-05-24 11:33:38] [INFO ] Dead Transitions using invariants and state equation in 3737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18679 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 112 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:33:38] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:33:38] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:33:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-24 11:33:38] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:33:38] [INFO ] After 19ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:38] [INFO ] After 32ms 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-24 11:33:38] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117722 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117722 steps, saw 85889 distinct states, run finished after 3013 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:33:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:33:41] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:33:41] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:33:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-24 11:33:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:33:42] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:33:43] [INFO ] After 277ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:43] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2024-05-24 11:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-24 11:33:43] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-24 11:33:43] [INFO ] After 1465ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 429 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 113685 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113685 steps, saw 83150 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:33:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:47] [INFO ] Invariant cache hit.
[2024-05-24 11:33:47] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:33:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-24 11:33:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-24 11:33:47] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:33:48] [INFO ] After 233ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:33:48] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-24 11:33:48] [INFO ] After 1171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 370 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 376 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:33:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:49] [INFO ] Invariant cache hit.
[2024-05-24 11:33:50] [INFO ] Implicit Places using invariants in 1669 ms returned []
[2024-05-24 11:33:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:33:50] [INFO ] Invariant cache hit.
[2024-05-24 11:33:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:34:03] [INFO ] Implicit Places using invariants and state equation in 12693 ms returned []
Implicit Place search using SMT with State Equation took 14364 ms to find 0 implicit places.
[2024-05-24 11:34:04] [INFO ] Redundant transitions in 550 ms returned []
[2024-05-24 11:34:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:04] [INFO ] Invariant cache hit.
[2024-05-24 11:34:08] [INFO ] Dead Transitions using invariants and state equation in 3908 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19245 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 130 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:34:08] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:34:08] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:34:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2024-05-24 11:34:08] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:34:08] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:08] [INFO ] After 38ms 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-24 11:34:08] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118162 steps, run timeout after 3004 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118162 steps, saw 86136 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:34:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:34:11] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:34:11] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:34:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 39 ms returned sat
[2024-05-24 11:34:12] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:34:12] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:34:12] [INFO ] After 233ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:13] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-24 11:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-24 11:34:13] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-24 11:34:13] [INFO ] After 1449ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 425 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116248 steps, run timeout after 3005 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116248 steps, saw 84897 distinct states, run finished after 3006 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:34:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:16] [INFO ] Invariant cache hit.
[2024-05-24 11:34:17] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:34:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2024-05-24 11:34:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-24 11:34:18] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:18] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:34:18] [INFO ] After 248ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:18] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-24 11:34:18] [INFO ] After 1504ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 406 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 419 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:34:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:19] [INFO ] Invariant cache hit.
[2024-05-24 11:34:21] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2024-05-24 11:34:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:21] [INFO ] Invariant cache hit.
[2024-05-24 11:34:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:34:33] [INFO ] Implicit Places using invariants and state equation in 12436 ms returned []
Implicit Place search using SMT with State Equation took 13996 ms to find 0 implicit places.
[2024-05-24 11:34:33] [INFO ] Redundant transitions in 528 ms returned []
[2024-05-24 11:34:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:34] [INFO ] Invariant cache hit.
[2024-05-24 11:34:37] [INFO ] Dead Transitions using invariants and state equation in 3884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18857 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 102 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:34:38] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:34:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:34:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 11:34:38] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:34:38] [INFO ] After 19ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:38] [INFO ] After 31ms 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-24 11:34:38] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108427 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108427 steps, saw 79487 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:34:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:34:41] [INFO ] Computed 31 invariants in 11 ms
[2024-05-24 11:34:41] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:34:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 54 ms returned sat
[2024-05-24 11:34:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:34:42] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:34:43] [INFO ] After 250ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:43] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2024-05-24 11:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-05-24 11:34:43] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 11:34:43] [INFO ] After 1938ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 458 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 119042 steps, run timeout after 3004 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119042 steps, saw 86644 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:34:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:47] [INFO ] Invariant cache hit.
[2024-05-24 11:34:47] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:34:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 34 ms returned sat
[2024-05-24 11:34:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-24 11:34:48] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:34:49] [INFO ] After 296ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:34:49] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-24 11:34:49] [INFO ] After 1597ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 402 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 367 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:34:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:50] [INFO ] Invariant cache hit.
[2024-05-24 11:34:51] [INFO ] Implicit Places using invariants in 1726 ms returned []
[2024-05-24 11:34:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:34:51] [INFO ] Invariant cache hit.
[2024-05-24 11:34:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:35:02] [INFO ] Implicit Places using invariants and state equation in 11098 ms returned []
Implicit Place search using SMT with State Equation took 12825 ms to find 0 implicit places.
[2024-05-24 11:35:03] [INFO ] Redundant transitions in 354 ms returned []
[2024-05-24 11:35:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:03] [INFO ] Invariant cache hit.
[2024-05-24 11:35:06] [INFO ] Dead Transitions using invariants and state equation in 3556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17113 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 101 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:35:06] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:35:06] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:35:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:35:07] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:35:07] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:07] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 11:35:07] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117304 steps, run timeout after 3005 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117304 steps, saw 85587 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:35:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:35:10] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:35:10] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:35:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 24 ms returned sat
[2024-05-24 11:35:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 19 ms returned sat
[2024-05-24 11:35:11] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:35:11] [INFO ] After 251ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:12] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2024-05-24 11:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-24 11:35:12] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-24 11:35:12] [INFO ] After 1475ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 359 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 120989 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120989 steps, saw 88035 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:35:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:15] [INFO ] Invariant cache hit.
[2024-05-24 11:35:15] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:35:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 31 ms returned sat
[2024-05-24 11:35:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-24 11:35:16] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:35:17] [INFO ] After 221ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:17] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-24 11:35:17] [INFO ] After 1542ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 354 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 345 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:35:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:18] [INFO ] Invariant cache hit.
[2024-05-24 11:35:19] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2024-05-24 11:35:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:19] [INFO ] Invariant cache hit.
[2024-05-24 11:35:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:35:32] [INFO ] Implicit Places using invariants and state equation in 12619 ms returned []
Implicit Place search using SMT with State Equation took 14238 ms to find 0 implicit places.
[2024-05-24 11:35:32] [INFO ] Redundant transitions in 399 ms returned []
[2024-05-24 11:35:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:32] [INFO ] Invariant cache hit.
[2024-05-24 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 3692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18699 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 78 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:35:36] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:35:36] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:35:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-05-24 11:35:36] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:35:36] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:36] [INFO ] After 32ms 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-24 11:35:36] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 113729 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113729 steps, saw 83180 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:35:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:35:40] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 11:35:40] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:35:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 29 ms returned sat
[2024-05-24 11:35:40] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 20 ms returned sat
[2024-05-24 11:35:41] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:35:41] [INFO ] After 226ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:41] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2024-05-24 11:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2024-05-24 11:35:41] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-24 11:35:41] [INFO ] After 1561ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 375 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 115742 steps, run timeout after 3004 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115742 steps, saw 84552 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:35:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:45] [INFO ] Invariant cache hit.
[2024-05-24 11:35:45] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:35:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 44 ms returned sat
[2024-05-24 11:35:45] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2024-05-24 11:35:46] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:46] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:35:46] [INFO ] After 276ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:35:47] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-24 11:35:47] [INFO ] After 1559ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 386 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 385 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:35:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:47] [INFO ] Invariant cache hit.
[2024-05-24 11:35:49] [INFO ] Implicit Places using invariants in 1705 ms returned []
[2024-05-24 11:35:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:35:49] [INFO ] Invariant cache hit.
[2024-05-24 11:35:50] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:36:01] [INFO ] Implicit Places using invariants and state equation in 11902 ms returned []
Implicit Place search using SMT with State Equation took 13612 ms to find 0 implicit places.
[2024-05-24 11:36:01] [INFO ] Redundant transitions in 401 ms returned []
[2024-05-24 11:36:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:36:02] [INFO ] Invariant cache hit.
[2024-05-24 11:36:05] [INFO ] Dead Transitions using invariants and state equation in 3485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17934 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 101 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:36:05] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:36:05] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:36:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:36:05] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:36:05] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:05] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 11:36:05] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122551 steps, run timeout after 3008 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122551 steps, saw 89012 distinct states, run finished after 3009 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:36:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 11:36:09] [INFO ] Computed 31 invariants in 3 ms
[2024-05-24 11:36:09] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:36:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-24 11:36:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-24 11:36:10] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:36:10] [INFO ] After 208ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:10] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2024-05-24 11:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-05-24 11:36:10] [INFO ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-24 11:36:10] [INFO ] After 1325ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 343 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117084 steps, run timeout after 3009 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 117084 steps, saw 85443 distinct states, run finished after 3009 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 11:36:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:36:14] [INFO ] Invariant cache hit.
[2024-05-24 11:36:14] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:36:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 45 ms returned sat
[2024-05-24 11:36:14] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 11:36:15] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:36:15] [INFO ] After 260ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:16] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 1 ms to minimize.
[2024-05-24 11:36:16] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2024-05-24 11:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2024-05-24 11:36:16] [INFO ] After 840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-24 11:36:16] [INFO ] After 2068ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 414 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 337 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-05-24 11:36:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:36:17] [INFO ] Invariant cache hit.
[2024-05-24 11:36:18] [INFO ] Implicit Places using invariants in 1697 ms returned []
[2024-05-24 11:36:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:36:18] [INFO ] Invariant cache hit.
[2024-05-24 11:36:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 11:36:31] [INFO ] Implicit Places using invariants and state equation in 12363 ms returned []
Implicit Place search using SMT with State Equation took 14065 ms to find 0 implicit places.
[2024-05-24 11:36:31] [INFO ] Redundant transitions in 394 ms returned []
[2024-05-24 11:36:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-05-24 11:36:31] [INFO ] Invariant cache hit.
[2024-05-24 11:36:35] [INFO ] Dead Transitions using invariants and state equation in 3413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18255 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 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 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 92 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2024-05-24 11:36:35] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:36:35] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:36:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2024-05-24 11:36:35] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:36:35] [INFO ] After 29ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 11:36:35] [INFO ] After 52ms 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-24 11:36:35] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 3476 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 500 transition count 637
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 227 place count 387 transition count 637
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 227 place count 387 transition count 616
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 279 place count 356 transition count 616
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 324 rules applied. Total rules applied 603 place count 194 transition count 454
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 682 place count 194 transition count 375
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 700 place count 185 transition count 375
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 709 place count 185 transition count 366
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 724 place count 185 transition count 351
Free-agglomeration rule applied 96 times.
Iterating global reduction 4 with 96 rules applied. Total rules applied 820 place count 185 transition count 255
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 916 place count 89 transition count 255
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 926 place count 89 transition count 255
Applied a total of 926 rules in 65 ms. Remains 89 /590 variables (removed 501) and now considering 255/3890 (removed 3635) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 255 rows 89 cols
[2024-05-24 11:36:35] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 11:36:35] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-24 11:36:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-24 11:36:36] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-24 11:36:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 11:36:36] [INFO ] After 227ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2024-05-24 11:36:36] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 274 ms.
[2024-05-24 11:36:37] [INFO ] After 1454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
[2024-05-24 11:36:37] [INFO ] Flatten gal took : 77 ms
[2024-05-24 11:36:37] [INFO ] Flatten gal took : 22 ms
[2024-05-24 11:36:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5838507774905643402.gal : 3 ms
[2024-05-24 11:36:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12078756763908549290.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5838507774905643402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12078756763908549290.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12078756763908549290.prop.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :1 after 8
Invariant property smplace_979 does not hold.
Invariant property smplace_774 does not hold.
Invariant property smplace_772 does not hold.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :8 after 50
Invariant property smplace_991 does not hold.
Invariant property smplace_990 does not hold.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :50 after 160
Invariant property smplace_980 does not hold.
Invariant property smplace_783 does not hold.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :160 after 616
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :616 after 708
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :708 after 800
Invariant property smplace_1002 does not hold.
Invariant property smplace_1001 does not hold.
Invariant property smplace_1000 does not hold.
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :800 after 2246
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :2246 after 2645
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :2645 after 3777
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :3777 after 4165
Invariant property smplace_1013 does not hold.
Invariant property smplace_1012 does not hold.
Invariant property smplace_1011 does not hold.
Invariant property smplace_1010 does not hold.
Invariant property smplace_794 does not hold.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4165 after 145800
Invariant property smplace_1024 does not hold.
Invariant property smplace_1022 does not hold.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :145800 after 9.0396e+06
Invariant property smplace_828 does not hold.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9.0396e+06 after 2.44069e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.44069e+08 after 7.48829e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.83708e+09,0.128211,6300,2,773,37,11775,7,0,615,6707,0
Total reachable state count : 1837080000
Verifying 19 reachability properties.
Invariant property smplace_772 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_772,4,0.128947,6300,2,92,37,11775,8,0,618,6707,0
Invariant property smplace_774 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_774,4,0.12929,6300,2,92,37,11775,9,0,620,6707,0
Invariant property smplace_783 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_783,16,0.129601,6300,2,97,37,11775,10,0,622,6707,0
Invariant property smplace_794 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_794,11664,0.129938,6300,2,357,37,11775,11,0,624,6707,0
Invariant property smplace_828 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_828,9.1854e+07,0.130292,6300,2,479,37,11775,12,0,626,6707,0
Invariant property smplace_840 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_840,3.0618e+08,0.130669,6300,2,625,37,11775,12,0,627,6707,0
Invariant property smplace_979 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_979,54,0.130988,6300,2,140,37,11775,13,0,629,6707,0
Invariant property smplace_980 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_980,24,0.131296,6300,2,100,37,11775,14,0,631,6707,0
Invariant property smplace_990 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_990,18,0.131585,6300,2,111,37,11775,15,0,633,6707,0
Invariant property smplace_991 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_991,18,0.131866,6300,2,111,37,11775,16,0,635,6707,0
Invariant property smplace_1000 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1000,324,0.132185,6300,2,231,37,11775,17,0,637,6707,0
Invariant property smplace_1001 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1001,324,0.132495,6300,2,231,37,11775,18,0,639,6707,0
Invariant property smplace_1002 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1002,324,0.132913,6300,2,231,37,11775,19,0,641,6707,0
Invariant property smplace_1010 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1010,11664,0.133555,6300,2,357,37,11775,20,0,643,6707,0
Invariant property smplace_1011 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1011,11664,0.133937,6300,2,357,37,11775,21,0,645,6707,0
Invariant property smplace_1012 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1012,11664,0.134309,6300,2,357,37,11775,22,0,647,6707,0
Invariant property smplace_1013 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1013,11664,0.13467,6300,2,357,37,11775,23,0,649,6707,0
Invariant property smplace_1022 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1022,174960,0.13503,6300,2,391,37,11775,24,0,651,6707,0
Invariant property smplace_1024 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1024,291600,0.135387,6300,2,399,37,11775,25,0,653,6707,0
LTSmin runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1298)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:33)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:708)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 11:36:38] [INFO ] Flatten gal took : 402 ms
[2024-05-24 11:36:38] [INFO ] Flatten gal took : 348 ms
[2024-05-24 11:36:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5337372529473293841.gal : 80 ms
[2024-05-24 11:36:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14340464838298205462.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5337372529473293841.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14340464838298205462.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability14340464838298205462.prop.
Detected timeout of ITS tools.
[2024-05-24 11:36:42] [INFO ] Flatten gal took : 318 ms
[2024-05-24 11:36:42] [INFO ] Applying decomposition
[2024-05-24 11:36:42] [INFO ] Flatten gal took : 265 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/graph852682306852294301.txt' '-o' '/tmp/graph852682306852294301.bin' '-w' '/tmp/graph852682306852294301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph852682306852294301.bin' '-l' '-1' '-v' '-w' '/tmp/graph852682306852294301.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:36:43] [INFO ] Decomposing Gal with order
[2024-05-24 11:36:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:36:44] [INFO ] Removed a total of 8726 redundant transitions.
[2024-05-24 11:36:44] [INFO ] Flatten gal took : 1153 ms
[2024-05-24 11:36:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 795 labels/synchronizations in 377 ms.
[2024-05-24 11:36:45] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1721584760036194945.gal : 82 ms
[2024-05-24 11:36:45] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2278228645129493836.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1721584760036194945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2278228645129493836.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability2278228645129493836.prop.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,19 properties remain. new max is 8
SDD size :16 after 42
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1824447166910867062
[2024-05-24 11:36:48] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1824447166910867062
Running compilation step : cd /tmp/ltsmin1824447166910867062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1824447166910867062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1824447166910867062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 11:36:51] [INFO ] Flatten gal took : 358 ms
[2024-05-24 11:36:51] [INFO ] Flatten gal took : 350 ms
[2024-05-24 11:36:51] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10015790728106679067.gal : 103 ms
[2024-05-24 11:36:51] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3899264600151491425.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10015790728106679067.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3899264600151491425.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability3899264600151491425.prop.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,19 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,19 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,19 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,19 properties remain. new max is 64
SDD size :9 after 25
SDD proceeding with computation,19 properties remain. new max is 128
SDD size :25 after 33
SDD proceeding with computation,19 properties remain. new max is 256
SDD size :33 after 85
SDD proceeding with computation,19 properties remain. new max is 512
SDD size :85 after 289
SDD proceeding with computation,19 properties remain. new max is 1024
SDD size :289 after 377
SDD proceeding with computation,19 properties remain. new max is 2048
SDD size :377 after 998
SDD proceeding with computation,19 properties remain. new max is 4096
SDD size :998 after 4106
Detected timeout of ITS tools.
[2024-05-24 11:37:22] [INFO ] Flatten gal took : 305 ms
[2024-05-24 11:37:22] [INFO ] Applying decomposition
[2024-05-24 11:37:22] [INFO ] Flatten gal took : 263 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/graph16416045006901298618.txt' '-o' '/tmp/graph16416045006901298618.bin' '-w' '/tmp/graph16416045006901298618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16416045006901298618.bin' '-l' '-1' '-v' '-w' '/tmp/graph16416045006901298618.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:37:23] [INFO ] Decomposing Gal with order
[2024-05-24 11:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:37:24] [INFO ] Removed a total of 8393 redundant transitions.
[2024-05-24 11:37:25] [INFO ] Flatten gal took : 1048 ms
[2024-05-24 11:37:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 745 labels/synchronizations in 364 ms.
[2024-05-24 11:37:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9984975153114442427.gal : 84 ms
[2024-05-24 11:37:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5845309944993083086.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9984975153114442427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5845309944993083086.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability5845309944993083086.prop.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :1 after 1242
SDD proceeding with computation,19 properties remain. new max is 8
SDD size :1242 after 1448
Invariant property smplace_772 does not hold.
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :1448 after 30911
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :30911 after 44234
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :44234 after 73753
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :73753 after 86532
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10910388279583982496
[2024-05-24 11:37:56] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10910388279583982496
Running compilation step : cd /tmp/ltsmin10910388279583982496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10910388279583982496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 6 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10910388279583982496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 6 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 11:38:02] [INFO ] Flatten gal took : 236 ms
[2024-05-24 11:38:02] [INFO ] Flatten gal took : 271 ms
[2024-05-24 11:38:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17590872388126033672.gal : 37 ms
[2024-05-24 11:38:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14290969100260964643.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17590872388126033672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14290969100260964643.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability14290969100260964643.prop.
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :9 after 25
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :25 after 33
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :33 after 85
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :85 after 289
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :289 after 377
SDD proceeding with computation,18 properties remain. new max is 2048
SDD size :377 after 998
SDD proceeding with computation,18 properties remain. new max is 4096
SDD size :998 after 4106
SDD proceeding with computation,18 properties remain. new max is 8192
SDD size :4106 after 6621
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 11003716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090364 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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 EisenbergMcGuire-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-smll-171636280700128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;