About the Execution of LTSMin+red for ASLink-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2919.451 | 3600000.00 | 10767925.00 | 3530.10 | TFF?T?FF??FFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117900131.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 ltsminxred
Input is ASLink-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900131
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K 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 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-08b-LTLCardinality-00
FORMULA_NAME ASLink-PT-08b-LTLCardinality-01
FORMULA_NAME ASLink-PT-08b-LTLCardinality-02
FORMULA_NAME ASLink-PT-08b-LTLCardinality-03
FORMULA_NAME ASLink-PT-08b-LTLCardinality-04
FORMULA_NAME ASLink-PT-08b-LTLCardinality-05
FORMULA_NAME ASLink-PT-08b-LTLCardinality-06
FORMULA_NAME ASLink-PT-08b-LTLCardinality-07
FORMULA_NAME ASLink-PT-08b-LTLCardinality-08
FORMULA_NAME ASLink-PT-08b-LTLCardinality-09
FORMULA_NAME ASLink-PT-08b-LTLCardinality-10
FORMULA_NAME ASLink-PT-08b-LTLCardinality-11
FORMULA_NAME ASLink-PT-08b-LTLCardinality-12
FORMULA_NAME ASLink-PT-08b-LTLCardinality-13
FORMULA_NAME ASLink-PT-08b-LTLCardinality-14
FORMULA_NAME ASLink-PT-08b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717225474237
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:04:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:04:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:04:37] [INFO ] Load time of PNML (sax parser for PT used): 788 ms
[2024-06-01 07:04:37] [INFO ] Transformed 3618 places.
[2024-06-01 07:04:37] [INFO ] Transformed 4459 transitions.
[2024-06-01 07:04:37] [INFO ] Found NUPN structural information;
[2024-06-01 07:04:37] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 1160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 3618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 224 places :
Symmetric choice reduction at 0 with 224 rule applications. Total rules 224 place count 3394 transition count 4235
Iterating global reduction 0 with 224 rules applied. Total rules applied 448 place count 3394 transition count 4235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 449 place count 3394 transition count 4234
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 537 place count 3306 transition count 4098
Iterating global reduction 1 with 88 rules applied. Total rules applied 625 place count 3306 transition count 4098
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 652 place count 3306 transition count 4071
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 664 place count 3294 transition count 4059
Iterating global reduction 2 with 12 rules applied. Total rules applied 676 place count 3294 transition count 4059
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 680 place count 3290 transition count 4048
Iterating global reduction 2 with 4 rules applied. Total rules applied 684 place count 3290 transition count 4048
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 687 place count 3287 transition count 4045
Iterating global reduction 2 with 3 rules applied. Total rules applied 690 place count 3287 transition count 4045
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 693 place count 3284 transition count 4035
Iterating global reduction 2 with 3 rules applied. Total rules applied 696 place count 3284 transition count 4035
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 697 place count 3283 transition count 4027
Iterating global reduction 2 with 1 rules applied. Total rules applied 698 place count 3283 transition count 4027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 699 place count 3282 transition count 4026
Iterating global reduction 2 with 1 rules applied. Total rules applied 700 place count 3282 transition count 4026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 701 place count 3281 transition count 4018
Iterating global reduction 2 with 1 rules applied. Total rules applied 702 place count 3281 transition count 4018
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 703 place count 3280 transition count 4010
Iterating global reduction 2 with 1 rules applied. Total rules applied 704 place count 3280 transition count 4010
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 705 place count 3279 transition count 4009
Iterating global reduction 2 with 1 rules applied. Total rules applied 706 place count 3279 transition count 4009
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 707 place count 3278 transition count 4001
Iterating global reduction 2 with 1 rules applied. Total rules applied 708 place count 3278 transition count 4001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 709 place count 3277 transition count 3993
Iterating global reduction 2 with 1 rules applied. Total rules applied 710 place count 3277 transition count 3993
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 711 place count 3276 transition count 3992
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 3276 transition count 3992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 713 place count 3275 transition count 3984
Iterating global reduction 2 with 1 rules applied. Total rules applied 714 place count 3275 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 715 place count 3274 transition count 3976
Iterating global reduction 2 with 1 rules applied. Total rules applied 716 place count 3274 transition count 3976
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 717 place count 3273 transition count 3975
Iterating global reduction 2 with 1 rules applied. Total rules applied 718 place count 3273 transition count 3975
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 719 place count 3272 transition count 3967
Iterating global reduction 2 with 1 rules applied. Total rules applied 720 place count 3272 transition count 3967
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 721 place count 3271 transition count 3959
Iterating global reduction 2 with 1 rules applied. Total rules applied 722 place count 3271 transition count 3959
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 723 place count 3270 transition count 3958
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 3270 transition count 3958
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 725 place count 3269 transition count 3950
Iterating global reduction 2 with 1 rules applied. Total rules applied 726 place count 3269 transition count 3950
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 727 place count 3268 transition count 3942
Iterating global reduction 2 with 1 rules applied. Total rules applied 728 place count 3268 transition count 3942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 729 place count 3267 transition count 3941
Iterating global reduction 2 with 1 rules applied. Total rules applied 730 place count 3267 transition count 3941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 731 place count 3266 transition count 3933
Iterating global reduction 2 with 1 rules applied. Total rules applied 732 place count 3266 transition count 3933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 733 place count 3265 transition count 3925
Iterating global reduction 2 with 1 rules applied. Total rules applied 734 place count 3265 transition count 3925
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 735 place count 3264 transition count 3924
Iterating global reduction 2 with 1 rules applied. Total rules applied 736 place count 3264 transition count 3924
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 737 place count 3263 transition count 3916
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 3263 transition count 3916
Applied a total of 738 rules in 11029 ms. Remains 3263 /3618 variables (removed 355) and now considering 3916/4459 (removed 543) transitions.
// Phase 1: matrix 3916 rows 3263 cols
[2024-06-01 07:04:49] [INFO ] Computed 355 invariants in 198 ms
[2024-06-01 07:04:54] [INFO ] Implicit Places using invariants in 4843 ms returned [3097, 3108, 3119, 3127, 3135, 3143, 3151, 3162, 3170, 3178, 3189]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4900 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3252/3618 places, 3916/4459 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3239 transition count 3903
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3239 transition count 3903
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3228 transition count 3892
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3228 transition count 3892
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3219 transition count 3883
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3219 transition count 3883
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3215 transition count 3879
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3215 transition count 3879
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3213 transition count 3877
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3213 transition count 3877
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3211 transition count 3875
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3211 transition count 3875
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3209 transition count 3873
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3209 transition count 3873
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3207 transition count 3871
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3207 transition count 3871
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3206 transition count 3870
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3206 transition count 3870
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3205 transition count 3869
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3205 transition count 3869
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3204 transition count 3868
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3204 transition count 3868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3203 transition count 3867
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3203 transition count 3867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3202 transition count 3866
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3202 transition count 3866
Applied a total of 100 rules in 5262 ms. Remains 3202 /3252 variables (removed 50) and now considering 3866/3916 (removed 50) transitions.
// Phase 1: matrix 3866 rows 3202 cols
[2024-06-01 07:04:59] [INFO ] Computed 344 invariants in 122 ms
[2024-06-01 07:05:02] [INFO ] Implicit Places using invariants in 2819 ms returned []
[2024-06-01 07:05:02] [INFO ] Invariant cache hit.
[2024-06-01 07:05:20] [INFO ] Implicit Places using invariants and state equation in 17755 ms returned []
Implicit Place search using SMT with State Equation took 20613 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3202/3618 places, 3866/4459 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41843 ms. Remains : 3202/3618 places, 3866/4459 transitions.
Support contains 15 out of 3202 places after structural reductions.
[2024-06-01 07:05:21] [INFO ] Flatten gal took : 575 ms
[2024-06-01 07:05:21] [INFO ] Flatten gal took : 208 ms
[2024-06-01 07:05:21] [INFO ] Input system was already deterministic with 3866 transitions.
RANDOM walk for 40000 steps (53 resets) in 2735 ms. (14 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
[2024-06-01 07:05:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 355/360 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 740/1100 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1100 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2100/3200 variables, 252/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3200 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3202 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3202 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3866/7068 variables, 3202/3546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7068 variables, 0/3546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7068/7068 variables, and 3546 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 262/262 constraints, State Equation: 3202/3202 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 355/360 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 740/1100 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1100 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2100/3200 variables, 252/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:05:34] [INFO ] Deduced a trap composed of 27 places in 4320 ms of which 371 ms to minimize.
SMT process timed out in 11006ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 3202 transition count 3273
Reduce places removed 593 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 596 rules applied. Total rules applied 1189 place count 2609 transition count 3270
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 1193 place count 2607 transition count 3268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1195 place count 2605 transition count 3268
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 867 Pre rules applied. Total rules applied 1195 place count 2605 transition count 2401
Deduced a syphon composed of 867 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 951 places and 0 transitions.
Iterating global reduction 4 with 1818 rules applied. Total rules applied 3013 place count 1654 transition count 2401
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3073 place count 1646 transition count 2349
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3125 place count 1594 transition count 2349
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3125 place count 1594 transition count 2316
Deduced a syphon composed of 33 places in 8 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3224 place count 1528 transition count 2316
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3224 place count 1528 transition count 2284
Deduced a syphon composed of 32 places in 23 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3288 place count 1496 transition count 2284
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 15 ms
Ensure Unique test removed 2 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 6 with 510 rules applied. Total rules applied 3798 place count 1240 transition count 2030
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3802 place count 1236 transition count 2026
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3807 place count 1235 transition count 2026
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3808 place count 1235 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3809 place count 1234 transition count 2025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3809 place count 1234 transition count 2024
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3811 place count 1233 transition count 2024
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3813 place count 1231 transition count 2022
Iterating global reduction 8 with 2 rules applied. Total rules applied 3815 place count 1231 transition count 2022
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3817 place count 1231 transition count 2020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3818 place count 1230 transition count 2020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3820 place count 1229 transition count 2025
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 3829 place count 1229 transition count 2016
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3838 place count 1220 transition count 2016
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 3845 place count 1220 transition count 2009
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3852 place count 1213 transition count 2009
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 3860 place count 1213 transition count 2009
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3861 place count 1212 transition count 2008
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 12 with 24 rules applied. Total rules applied 3885 place count 1196 transition count 2000
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 3893 place count 1188 transition count 2000
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 24 Pre rules applied. Total rules applied 3893 place count 1188 transition count 1976
Deduced a syphon composed of 24 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 14 with 49 rules applied. Total rules applied 3942 place count 1163 transition count 1976
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 3951 place count 1154 transition count 1976
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3951 place count 1154 transition count 1975
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3953 place count 1153 transition count 1975
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 9 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 15 with 34 rules applied. Total rules applied 3987 place count 1136 transition count 1958
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 3995 place count 1128 transition count 1950
Iterating global reduction 15 with 8 rules applied. Total rules applied 4003 place count 1128 transition count 1950
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4011 place count 1128 transition count 1942
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4019 place count 1120 transition count 1942
Applied a total of 4019 rules in 2036 ms. Remains 1120 /3202 variables (removed 2082) and now considering 1942/3866 (removed 1924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2037 ms. Remains : 1120/3202 places, 1942/3866 transitions.
RANDOM walk for 40000 steps (428 resets) in 1091 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (47 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 106709 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 3
Probabilistic random walk after 106709 steps, saw 24729 distinct states, run finished after 3018 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1942 rows 1120 cols
[2024-06-01 07:05:39] [INFO ] Computed 190 invariants in 56 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 163/196 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/292 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/298 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 352/650 variables, 55/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 68/718 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/723 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/723 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 269/992 variables, 47/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 43/1035 variables, 10/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1035 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/1036 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1036 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 82/1118 variables, 18/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1118 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/1119 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1119 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/1120 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1120 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1942/3062 variables, 1120/1310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3062 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/3062 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3062/3062 variables, and 1310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2988 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1120/1120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 163/196 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/292 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/298 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 352/650 variables, 55/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 68/718 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/723 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/723 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 269/992 variables, 47/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 43/1035 variables, 10/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1035 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/1036 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1036 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 82/1118 variables, 18/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1118 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/1119 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1119 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/1120 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1120 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1942/3062 variables, 1120/1310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3062 variables, 3/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3062 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/3062 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3062/3062 variables, and 1313 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3835 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1120/1120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6938ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3898 ms.
Support contains 5 out of 1120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1120/1120 places, 1942/1942 transitions.
Applied a total of 0 rules in 57 ms. Remains 1120 /1120 variables (removed 0) and now considering 1942/1942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1120/1120 places, 1942/1942 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1120/1120 places, 1942/1942 transitions.
Applied a total of 0 rules in 75 ms. Remains 1120 /1120 variables (removed 0) and now considering 1942/1942 (removed 0) transitions.
[2024-06-01 07:05:50] [INFO ] Invariant cache hit.
[2024-06-01 07:05:52] [INFO ] Implicit Places using invariants in 2094 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 149, 150, 152, 169, 187, 256, 260, 261, 272, 273, 275, 293, 311, 382, 386, 387, 398, 399, 401, 418, 436, 505, 509, 510, 521, 522, 524, 541, 559, 628, 632, 633, 644, 645, 647, 664, 682, 752, 756, 757, 768, 769, 771, 788, 806, 876, 880, 881, 892, 893, 895, 912, 930, 999, 1003, 1004, 1007, 1018, 1019, 1020, 1038, 1059, 1060, 1061, 1062]
[2024-06-01 07:05:52] [INFO ] Actually due to overlaps returned [1038, 1020, 48, 169, 293, 418, 541, 664, 788, 912, 31, 152, 275, 401, 524, 647, 771, 895, 149, 272, 398, 521, 644, 768, 892, 1018, 1059, 150, 273, 399, 522, 645, 769, 893, 1019, 1060, 1, 18, 260, 261, 386, 387, 509, 510, 632, 633, 756, 757, 880, 881, 1003, 1004, 66, 187, 311, 436, 559, 682, 806, 930, 1061, 19, 1007, 1062]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 2109 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1056/1120 places, 1942/1942 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1048 transition count 1802
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 908 transition count 1793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 907 transition count 1793
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 298 place count 907 transition count 1754
Deduced a syphon composed of 39 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 377 place count 867 transition count 1754
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 389 place count 863 transition count 1746
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 397 place count 855 transition count 1746
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 400 place count 852 transition count 1743
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 852 transition count 1743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 406 place count 852 transition count 1740
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 7 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 514 place count 798 transition count 1686
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 522 place count 790 transition count 1678
Iterating global reduction 6 with 8 rules applied. Total rules applied 530 place count 790 transition count 1678
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 538 place count 790 transition count 1670
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 542 place count 788 transition count 1671
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 559 place count 788 transition count 1654
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 577 place count 770 transition count 1654
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 599 place count 770 transition count 1654
Applied a total of 599 rules in 514 ms. Remains 770 /1056 variables (removed 286) and now considering 1654/1942 (removed 288) transitions.
// Phase 1: matrix 1654 rows 770 cols
[2024-06-01 07:05:53] [INFO ] Computed 112 invariants in 32 ms
[2024-06-01 07:05:54] [INFO ] Implicit Places using invariants in 1201 ms returned [73, 89, 95, 98, 100, 101, 104, 106, 159, 175, 181, 184, 186, 191, 192, 246, 263, 269, 272, 274, 279, 280, 333, 349, 355, 358, 360, 365, 366, 419, 435, 441, 444, 446, 451, 452, 505, 522, 528, 531, 533, 538, 539, 592, 608, 615, 618, 620, 625, 626, 679, 695, 701, 704, 706]
[2024-06-01 07:05:54] [INFO ] Actually due to overlaps returned [104, 191, 279, 365, 451, 538, 625, 106, 192, 280, 366, 452, 539, 626, 89, 95, 100, 175, 181, 186, 269, 274, 349, 355, 360, 435, 441, 446, 522, 528, 533, 608, 620, 695, 701, 706, 73, 101, 159, 246, 263, 333, 419, 505, 592, 615, 679]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1211 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 723/1120 places, 1654/1942 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 693 transition count 1624
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 693 transition count 1624
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 687 transition count 1618
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 687 transition count 1618
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 104 place count 671 transition count 1602
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 128 place count 671 transition count 1578
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 152 place count 647 transition count 1578
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 160 place count 647 transition count 1570
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 168 place count 639 transition count 1570
Applied a total of 168 rules in 171 ms. Remains 639 /723 variables (removed 84) and now considering 1570/1654 (removed 84) transitions.
// Phase 1: matrix 1570 rows 639 cols
[2024-06-01 07:05:54] [INFO ] Computed 65 invariants in 31 ms
[2024-06-01 07:05:56] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2024-06-01 07:05:56] [INFO ] Invariant cache hit.
[2024-06-01 07:05:58] [INFO ] Implicit Places using invariants and state equation in 2646 ms returned []
Implicit Place search using SMT with State Equation took 3909 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 639/1120 places, 1570/1942 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7991 ms. Remains : 639/1120 places, 1570/1942 transitions.
RANDOM walk for 40000 steps (669 resets) in 497 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (105 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 214464 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 3
Probabilistic random walk after 214464 steps, saw 50825 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 07:06:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 375/384 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/412 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 191/603 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/621 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 18/639 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1570/2209 variables, 639/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2209 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2209 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2209/2209 variables, and 704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 639/639 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 375/384 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/412 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 191/603 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/621 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:06:04] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 18/639 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1570/2209 variables, 639/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2209 variables, 3/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2209 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2209 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2209/2209 variables, and 708 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2254 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 639/639 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3579ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1320 ms.
Support contains 5 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1570/1570 transitions.
Applied a total of 0 rules in 33 ms. Remains 639 /639 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 639/639 places, 1570/1570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1570/1570 transitions.
Applied a total of 0 rules in 30 ms. Remains 639 /639 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
[2024-06-01 07:06:07] [INFO ] Invariant cache hit.
[2024-06-01 07:06:08] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-06-01 07:06:08] [INFO ] Invariant cache hit.
[2024-06-01 07:06:10] [INFO ] Implicit Places using invariants and state equation in 2725 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
[2024-06-01 07:06:10] [INFO ] Redundant transitions in 147 ms returned []
Running 1529 sub problems to find dead transitions.
[2024-06-01 07:06:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 1529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/2209 variables, and 59 constraints, problems are : Problem set: 0 solved, 1529 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 49/52 constraints, State Equation: 0/639 constraints, PredecessorRefiner: 1529/1529 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1529 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 1529 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/2209 variables, and 59 constraints, problems are : Problem set: 0 solved, 1529 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 49/52 constraints, State Equation: 0/639 constraints, PredecessorRefiner: 0/1529 constraints, Known Traps: 0/0 constraints]
After SMT, in 61703ms problems are : Problem set: 0 solved, 1529 unsolved
Search for dead transitions found 0 dead transitions in 61750ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65569 ms. Remains : 639/639 places, 1570/1570 transitions.
Computed a total of 131 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 4 out of 3202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3201 transition count 3865
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3201 transition count 3865
Applied a total of 2 rules in 889 ms. Remains 3201 /3202 variables (removed 1) and now considering 3865/3866 (removed 1) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2024-06-01 07:07:13] [INFO ] Computed 344 invariants in 92 ms
[2024-06-01 07:07:17] [INFO ] Implicit Places using invariants in 3452 ms returned []
[2024-06-01 07:07:17] [INFO ] Invariant cache hit.
[2024-06-01 07:07:47] [INFO ] Implicit Places using invariants and state equation in 30570 ms returned []
Implicit Place search using SMT with State Equation took 34033 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2024-06-01 07:07:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 13.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 7.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 3.0)
(s51 1.0)
(s52 1.0)
(s53 6.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 34.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 6.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 5.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 4.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 23.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 29.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 29.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 26.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 3.0)
(s417 1.0)
(s418 93.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 6.0)
(s454 0.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 5.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 23.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 0.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 0.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 0.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 0.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 4.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 25.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 25.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 22.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 4.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 93.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 0.0)
(s850 1.0)
(s851 0.0)
(s852 0.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 0.0)
(s865 1.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 0.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 23.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 2.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 0.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 0.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 10.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 0.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 0.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 7.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 0.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 0.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 0.0)
(s1085 4.0)
(s1086 1.0)
(s1087 0.0)
(s1088 0.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 21.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 21.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 18.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 4.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 1.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 1.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 1.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 1.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 1.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 1.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 1.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 0.0)
(s1208 0.0)
(s1209 1.0)
(s1210 0.0)
(s1211 0.0)
(s1212 1.0)
(s1213 0.0)
(s1214 1.0)
(s1215 1.0)
(s1216 0.0)
(s1217 0.0)
(s1218 1.0)
(s1219 1.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 0.0)
(s1227 1.0)
(s1228 1.0)
(s1229 0.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 16.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 0.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 0.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 10.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 0.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 0.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 7.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 0.0)
(s1432 1.0)
(s1433 0.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 4.0)
(s1442 1.0)
(s1443 0.0)
(s1444 1.0)
(s1445 1.0)
(s1446 0.0)
(s1447 0.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 17.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 17.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 14.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 4.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 28.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 1.0)
(s1569 0.0)
(s1570 0.0)
(s1571 1.0)
(s1572 0.0)
(s1573 0.0)
(s1574 1.0)
(s1575 1.0)
(s1576 0.0)
(s1577 1.0)
(s1578 0.0)
(s1579 0.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 0.0)
(s1586 1.0)
(s1587 1.0)
(s1588 0.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 1.0)
(s1613 0.0)
(s1614 0.0)
(s1615 1.0)
(s1616 0.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 0.0)
(s1690 0.0)
(s1691 1.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 1.0)
(s1697 0.0)
(s1698 0.0)
(s1699 1.0)
(s1700 0.0)
(s1701 0.0)
(s1702 1.0)
(s1703 0.0)
(s1704 0.0)
(s1705 1.0)
(s1706 0.0)
(s1707 1.0)
(s1708 0.0)
(s1709 0.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 0.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 0.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 0.0)
(s1732 0.0)
(s1733 1.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 0.0)
(s1745 0.0)
(s1746 1.0)
(s1747 1.0)
(s1748 0.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 0.0)
(s1759 0.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 0.0)
(s1768 0.0)
(s1769 1.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 5.0)
(s1775 1.0)
(s1776 1.0)
(s1777 0.0)
(s1778 0.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 3.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 0.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 0.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 4.0)
(s1801 1.0)
(s1802 0.0)
(s1803 1.0)
(s1804 1.0)
(s1805 0.0)
(s1806 0.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 13.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 13.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 10.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 4.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 73.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 0.0)
(s1892 1.0)
(s1893 1.0)
(s1894 6.0)
(s1895 0.0)
(s1896 1.0)
(s1897 1.0)
(s1898 0.0)
(s1899 0.0)
(s1900 1.0)
(s1901 1.0)
(s1902 0.0)
(s1903 0.0)
(s1904 1.0)
(s1905 1.0)
(s1906 0.0)
(s1907 0.0)
(s1908 1.0)
(s1909 1.0)
(s1910 0.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 0.0)
(s1915 0.0)
(s1916 1.0)
(s1917 1.0)
(s1918 0.0)
(s1919 0.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 0.0)
(s1926 0.0)
(s1927 1.0)
(s1928 0.0)
(s1929 0.0)
(s1930 1.0)
(s1931 1.0)
(s1932 0.0)
(s1933 1.0)
(s1934 0.0)
(s1935 0.0)
(s1936 1.0)
(s1937 1.0)
(s1938 0.0)
(s1939 1.0)
(s1940 1.0)
(s1941 0.0)
(s1942 0.0)
(s1943 1.0)
(s1944 0.0)
(s1945 1.0)
(s1946 1.0)
(s1947 0.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 16.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 0.0)
(s2081 1.0)
(s2082 0.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 10.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 0.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 0.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 7.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 0.0)
(s2151 1.0)
(s2152 1.0)
(s2153 0.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 0.0)
(s2162 4.0)
(s2163 1.0)
(s2164 0.0)
(s2165 0.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 9.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 9.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 6.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 4.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 28.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 23.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 0.0)
(s2409 1.0)
(s2410 0.0)
(s2411 0.0)
(s2412 1.0)
(s2413 0.0)
(s2414 0.0)
(s2415 0.0)
(s2416 0.0)
(s2417 0.0)
(s2418 0.0)
(s2419 1.0)
(s2420 0.0)
(s2421 0.0)
(s2422 0.0)
(s2423 1.0)
(s2424 0.0)
(s2425 1.0)
(s2426 1.0)
(s2427 0.0)
(s2428 1.0)
(s2429 1.0)
(s2430 0.0)
(s2431 1.0)
(s2432 1.0)
(s2433 1.0)
(s2434 1.0)
(s2435 1.0)
(s2436 1.0)
(s2437 0.0)
(s2438 1.0)
(s2439 1.0)
(s2440 1.0)
(s2441 1.0)
(s2442 1.0)
(s2443 1.0)
(s2444 0.0)
(s2445 1.0)
(s2446 1.0)
(s2447 1.0)
(s2448 1.0)
(s2449 0.0)
(s2450 0.0)
(s2451 1.0)
(s2452 0.0)
(s2453 0.0)
(s2454 0.0)
(s2455 1.0)
(s2456 1.0)
(s2457 0.0)
(s2458 1.0)
(s2459 1.0)
(s2460 0.0)
(s2461 1.0)
(s2462 0.0)
(s2463 0.0)
(s2464 1.0)
(s2465 1.0)
(s2466 1.0)
(s2467 1.0)
(s2468 1.0)
(s2469 1.0)
(s2470 1.0)
(s2471 1.0)
(s2472 1.0)
(s2473 1.0)
(s2474 1.0)
(s2475 1.0)
(s2476 0.0)
(s2477 1.0)
(s2478 1.0)
(s2479 1.0)
(s2480 0.0)
(s2481 1.0)
(s2482 1.0)
(s2483 1.0)
(s2484 1.0)
(s2485 0.0)
(s2486 0.0)
(s2487 1.0)
(s2488 1.0)
(s2489 0.0)
(s2490 1.0)
(s2491 1.0)
(s2492 1.0)
(s2493 0.0)
(s2494 0.0)
(s2495 1.0)
(s2496 0.0)
(s2497 1.0)
(s2498 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints]
After SMT, in 62706ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 62751ms
Starting structural reductions in LTL mode, iteration 1 : 3201/3202 places, 3865/3866 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97691 ms. Remains : 3201/3202 places, 3865/3866 transitions.
Stuttering acceptance computed with spot in 413 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-03
Product exploration explored 100000 steps with 132 reset in 894 ms.
Product exploration explored 100000 steps with 151 reset in 852 ms.
Computed a total of 131 stabilizing places and 131 stable transitions
Computed a total of 131 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (59 resets) in 379 ms. (105 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2024-06-01 07:08:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/259 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 756/1015 variables, 81/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2078/3093 variables, 244/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3093 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/3201 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3201 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7066/7066 variables, and 3545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3520 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 263/263 constraints, State Equation: 3201/3201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/259 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 756/1015 variables, 81/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2078/3093 variables, 244/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 25 places in 540 ms of which 7 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 30 places in 522 ms of which 7 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 24 places in 641 ms of which 9 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 71 places in 606 ms of which 9 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 72 places in 584 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3093 variables, 5/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3093 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 108/3201 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3201 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 8571ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3201 transition count 3270
Reduce places removed 595 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 598 rules applied. Total rules applied 1193 place count 2606 transition count 3267
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 1197 place count 2604 transition count 3265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1199 place count 2602 transition count 3265
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 867 Pre rules applied. Total rules applied 1199 place count 2602 transition count 2398
Deduced a syphon composed of 867 places in 14 ms
Ensure Unique test removed 84 places
Reduce places removed 951 places and 0 transitions.
Iterating global reduction 4 with 1818 rules applied. Total rules applied 3017 place count 1651 transition count 2398
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3077 place count 1643 transition count 2346
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3129 place count 1591 transition count 2346
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3129 place count 1591 transition count 2313
Deduced a syphon composed of 33 places in 14 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3228 place count 1525 transition count 2313
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3228 place count 1525 transition count 2281
Deduced a syphon composed of 32 places in 14 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3292 place count 1493 transition count 2281
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Deduced a syphon composed of 255 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 6 with 512 rules applied. Total rules applied 3804 place count 1236 transition count 2026
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3808 place count 1232 transition count 2022
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3813 place count 1231 transition count 2022
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3814 place count 1231 transition count 2021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3815 place count 1230 transition count 2021
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3815 place count 1230 transition count 2020
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3817 place count 1229 transition count 2020
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3819 place count 1227 transition count 2018
Iterating global reduction 8 with 2 rules applied. Total rules applied 3821 place count 1227 transition count 2018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3823 place count 1227 transition count 2016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3824 place count 1226 transition count 2016
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3826 place count 1225 transition count 2021
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 3835 place count 1225 transition count 2012
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3844 place count 1216 transition count 2012
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 3851 place count 1216 transition count 2005
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3858 place count 1209 transition count 2005
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 3866 place count 1209 transition count 2005
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3867 place count 1208 transition count 2004
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 12 with 24 rules applied. Total rules applied 3891 place count 1192 transition count 1996
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 3899 place count 1184 transition count 1996
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 24 Pre rules applied. Total rules applied 3899 place count 1184 transition count 1972
Deduced a syphon composed of 24 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 14 with 49 rules applied. Total rules applied 3948 place count 1159 transition count 1972
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 3957 place count 1150 transition count 1972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3957 place count 1150 transition count 1971
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3959 place count 1149 transition count 1971
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 15 with 34 rules applied. Total rules applied 3993 place count 1132 transition count 1954
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 4001 place count 1124 transition count 1946
Iterating global reduction 15 with 8 rules applied. Total rules applied 4009 place count 1124 transition count 1946
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4017 place count 1124 transition count 1938
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4025 place count 1116 transition count 1938
Applied a total of 4025 rules in 1474 ms. Remains 1116 /3201 variables (removed 2085) and now considering 1938/3865 (removed 1927) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1475 ms. Remains : 1116/3201 places, 1938/3865 transitions.
RANDOM walk for 40000 steps (417 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (49 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189361 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189361 steps, saw 42709 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1938 rows 1116 cols
[2024-06-01 07:09:06] [INFO ] Computed 190 invariants in 44 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/141 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/184 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/186 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/366 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/406 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/409 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/607 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/607 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/663 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/663 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/665 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 176/841 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/841 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 16/857 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/857 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/858 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/858 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 108/966 variables, 16/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/966 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 15/981 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/981 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1/982 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/982 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 97/1079 variables, 15/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1079 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1081 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1081 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 33/1114 variables, 10/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1114 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/1116 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1116 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1938/3054 variables, 1116/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3054 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/3054 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3054/3054 variables, and 1306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1116/1116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/141 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/184 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/186 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/366 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/406 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/409 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/607 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/607 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/663 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/663 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/665 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 176/841 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 73 places in 697 ms of which 9 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/841 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/841 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 16/857 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/857 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/858 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/858 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 108/966 variables, 16/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/966 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 15/981 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/981 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/982 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/982 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 97/1079 variables, 15/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1079 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/1081 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1081 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 33/1114 variables, 10/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1114 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/1116 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1116 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1938/3054 variables, 1116/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3054 variables, 1/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 109 places in 708 ms of which 9 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 115 places in 726 ms of which 10 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/3054 variables, 2/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3054 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/3054 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3054/3054 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1116/1116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 6110ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 2 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1938/1938 transitions.
Applied a total of 0 rules in 84 ms. Remains 1116 /1116 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1116/1116 places, 1938/1938 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1938/1938 transitions.
Applied a total of 0 rules in 81 ms. Remains 1116 /1116 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2024-06-01 07:09:13] [INFO ] Invariant cache hit.
[2024-06-01 07:09:15] [INFO ] Implicit Places using invariants in 1932 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 660, 678, 748, 752, 753, 764, 765, 767, 784, 802, 872, 876, 877, 888, 889, 891, 908, 926, 995, 999, 1000, 1003, 1014, 1015, 1016, 1034, 1055, 1056, 1057, 1058]
[2024-06-01 07:09:15] [INFO ] Actually due to overlaps returned [1034, 1016, 48, 168, 291, 414, 537, 660, 784, 908, 31, 151, 274, 397, 520, 643, 767, 891, 148, 271, 394, 517, 640, 764, 888, 1014, 1055, 149, 272, 395, 518, 641, 765, 889, 1015, 1056, 1, 18, 259, 260, 382, 383, 505, 506, 628, 629, 752, 753, 876, 877, 999, 1000, 66, 186, 309, 432, 555, 678, 802, 926, 1057, 19, 1003, 1058]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 1942 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1052/1116 places, 1938/1938 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1044 transition count 1798
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 904 transition count 1789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 903 transition count 1789
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 298 place count 903 transition count 1750
Deduced a syphon composed of 39 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 377 place count 863 transition count 1750
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 389 place count 859 transition count 1742
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 397 place count 851 transition count 1742
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 400 place count 848 transition count 1739
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 848 transition count 1739
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 406 place count 848 transition count 1736
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 5 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 514 place count 794 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 522 place count 786 transition count 1674
Iterating global reduction 6 with 8 rules applied. Total rules applied 530 place count 786 transition count 1674
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 538 place count 786 transition count 1666
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 542 place count 784 transition count 1667
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 558 place count 784 transition count 1651
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 575 place count 767 transition count 1651
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 598 place count 767 transition count 1651
Applied a total of 598 rules in 415 ms. Remains 767 /1052 variables (removed 285) and now considering 1651/1938 (removed 287) transitions.
// Phase 1: matrix 1651 rows 767 cols
[2024-06-01 07:09:15] [INFO ] Computed 112 invariants in 28 ms
[2024-06-01 07:09:16] [INFO ] Implicit Places using invariants in 1230 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 346, 352, 355, 357, 362, 363, 416, 432, 438, 441, 443, 448, 449, 502, 519, 525, 528, 530, 535, 536, 589, 605, 612, 615, 617, 622, 623, 676, 692, 698, 701, 703]
[2024-06-01 07:09:16] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 448, 535, 622, 105, 191, 277, 363, 449, 536, 623, 89, 95, 100, 174, 180, 185, 260, 266, 271, 346, 352, 357, 432, 438, 443, 519, 525, 530, 605, 617, 692, 698, 703, 73, 101, 158, 244, 330, 416, 502, 589, 612, 676]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1234 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 720/1116 places, 1651/1938 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 689 transition count 1620
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 689 transition count 1620
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 682 transition count 1613
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 682 transition count 1613
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 108 place count 666 transition count 1597
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 666 transition count 1573
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 156 place count 642 transition count 1573
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 642 transition count 1565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 172 place count 634 transition count 1565
Applied a total of 172 rules in 242 ms. Remains 634 /720 variables (removed 86) and now considering 1565/1651 (removed 86) transitions.
// Phase 1: matrix 1565 rows 634 cols
[2024-06-01 07:09:17] [INFO ] Computed 65 invariants in 25 ms
[2024-06-01 07:09:18] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2024-06-01 07:09:18] [INFO ] Invariant cache hit.
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3725 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 634/1116 places, 1565/1938 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7640 ms. Remains : 634/1116 places, 1565/1938 transitions.
RANDOM walk for 40000 steps (705 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249754 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249754 steps, saw 58037 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 07:09:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2199/2199 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2199/2199 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2418ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 247 ms.
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 27 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 634/634 places, 1565/1565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 28 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
[2024-06-01 07:09:26] [INFO ] Invariant cache hit.
[2024-06-01 07:09:27] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-06-01 07:09:27] [INFO ] Invariant cache hit.
[2024-06-01 07:09:30] [INFO ] Implicit Places using invariants and state equation in 2723 ms returned []
Implicit Place search using SMT with State Equation took 3761 ms to find 0 implicit places.
[2024-06-01 07:09:30] [INFO ] Redundant transitions in 155 ms returned []
Running 1524 sub problems to find dead transitions.
[2024-06-01 07:09:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 1524/1524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 0/1524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61381ms problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 61412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65371 ms. Remains : 634/634 places, 1565/1565 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 46 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:10:32] [INFO ] Invariant cache hit.
[2024-06-01 07:10:32] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:10:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 07:10:32] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 45 ms returned sat
[2024-06-01 07:10:33] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:10:33] [INFO ] After 1009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:10:33] [INFO ] After 1355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1633 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 3201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Applied a total of 0 rules in 512 ms. Remains 3201 /3201 variables (removed 0) and now considering 3865/3865 (removed 0) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2024-06-01 07:10:34] [INFO ] Computed 344 invariants in 89 ms
[2024-06-01 07:10:38] [INFO ] Implicit Places using invariants in 3605 ms returned []
[2024-06-01 07:10:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:07] [INFO ] Implicit Places using invariants and state equation in 29466 ms returned []
Implicit Place search using SMT with State Equation took 33075 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2024-06-01 07:11:08] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints]
After SMT, in 62692ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 62757ms
Finished structural reductions in LTL mode , in 1 iterations and 96356 ms. Remains : 3201/3201 places, 3865/3865 transitions.
Computed a total of 131 stabilizing places and 131 stable transitions
Computed a total of 131 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (51 resets) in 428 ms. (93 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2024-06-01 07:12:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/259 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 756/1015 variables, 81/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2078/3093 variables, 244/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3093 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/3201 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3201 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7066/7066 variables, and 3545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 263/263 constraints, State Equation: 3201/3201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/259 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 756/1015 variables, 81/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2078/3093 variables, 244/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 25 places in 611 ms of which 6 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 30 places in 776 ms of which 11 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 24 places in 643 ms of which 9 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 71 places in 627 ms of which 8 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 72 places in 705 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3093 variables, 5/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3093/7066 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 251/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 8130ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3201 transition count 3270
Reduce places removed 595 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 598 rules applied. Total rules applied 1193 place count 2606 transition count 3267
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 1197 place count 2604 transition count 3265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1199 place count 2602 transition count 3265
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 867 Pre rules applied. Total rules applied 1199 place count 2602 transition count 2398
Deduced a syphon composed of 867 places in 8 ms
Ensure Unique test removed 84 places
Reduce places removed 951 places and 0 transitions.
Iterating global reduction 4 with 1818 rules applied. Total rules applied 3017 place count 1651 transition count 2398
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3077 place count 1643 transition count 2346
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3129 place count 1591 transition count 2346
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3129 place count 1591 transition count 2313
Deduced a syphon composed of 33 places in 8 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3228 place count 1525 transition count 2313
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3228 place count 1525 transition count 2281
Deduced a syphon composed of 32 places in 8 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3292 place count 1493 transition count 2281
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Deduced a syphon composed of 255 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 6 with 512 rules applied. Total rules applied 3804 place count 1236 transition count 2026
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3808 place count 1232 transition count 2022
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3813 place count 1231 transition count 2022
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3814 place count 1231 transition count 2021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3815 place count 1230 transition count 2021
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3815 place count 1230 transition count 2020
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3817 place count 1229 transition count 2020
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3819 place count 1227 transition count 2018
Iterating global reduction 8 with 2 rules applied. Total rules applied 3821 place count 1227 transition count 2018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3823 place count 1227 transition count 2016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3824 place count 1226 transition count 2016
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3826 place count 1225 transition count 2021
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 3835 place count 1225 transition count 2012
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3844 place count 1216 transition count 2012
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 3851 place count 1216 transition count 2005
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3858 place count 1209 transition count 2005
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 3866 place count 1209 transition count 2005
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3867 place count 1208 transition count 2004
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 12 with 24 rules applied. Total rules applied 3891 place count 1192 transition count 1996
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 3899 place count 1184 transition count 1996
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 24 Pre rules applied. Total rules applied 3899 place count 1184 transition count 1972
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 14 with 49 rules applied. Total rules applied 3948 place count 1159 transition count 1972
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 3957 place count 1150 transition count 1972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3957 place count 1150 transition count 1971
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3959 place count 1149 transition count 1971
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 15 with 34 rules applied. Total rules applied 3993 place count 1132 transition count 1954
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 4001 place count 1124 transition count 1946
Iterating global reduction 15 with 8 rules applied. Total rules applied 4009 place count 1124 transition count 1946
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4017 place count 1124 transition count 1938
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4025 place count 1116 transition count 1938
Applied a total of 4025 rules in 1172 ms. Remains 1116 /3201 variables (removed 2085) and now considering 1938/3865 (removed 1927) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1173 ms. Remains : 1116/3201 places, 1938/3865 transitions.
RANDOM walk for 40000 steps (428 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 166777 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 166777 steps, saw 37805 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 1938 rows 1116 cols
[2024-06-01 07:12:23] [INFO ] Computed 190 invariants in 48 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/141 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/184 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/186 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/366 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/406 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/409 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/607 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/607 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/663 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/663 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/665 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 176/841 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/841 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 16/857 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/857 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/858 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/858 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 108/966 variables, 16/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/966 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 15/981 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/981 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1/982 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/982 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 97/1079 variables, 15/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1079 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1081 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1081 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 33/1114 variables, 10/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1114 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/1116 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1116 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1938/3054 variables, 1116/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3054 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/3054 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3054/3054 variables, and 1306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1116/1116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/141 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/184 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/186 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/366 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/406 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/409 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/607 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/607 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/663 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/663 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/665 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 176/841 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 73 places in 718 ms of which 9 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/841 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/841 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 16/857 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/857 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/858 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/858 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 108/966 variables, 16/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/966 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 15/981 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/981 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/982 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/982 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 97/1079 variables, 15/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1079 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/1081 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1081 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 33/1114 variables, 10/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1114 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/1116 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1116 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1938/3054 variables, 1116/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3054 variables, 1/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 109 places in 789 ms of which 10 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 115 places in 790 ms of which 10 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/3054 variables, 2/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3054 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/3054 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3054/3054 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5197 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 135/135 constraints, State Equation: 1116/1116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 6952ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 278 ms.
Support contains 2 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1938/1938 transitions.
Applied a total of 0 rules in 80 ms. Remains 1116 /1116 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1116/1116 places, 1938/1938 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1938/1938 transitions.
Applied a total of 0 rules in 80 ms. Remains 1116 /1116 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2024-06-01 07:12:31] [INFO ] Invariant cache hit.
[2024-06-01 07:12:33] [INFO ] Implicit Places using invariants in 2176 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 660, 678, 748, 752, 753, 764, 765, 767, 784, 802, 872, 876, 877, 888, 889, 891, 908, 926, 995, 999, 1000, 1003, 1014, 1015, 1016, 1034, 1055, 1056, 1057, 1058]
[2024-06-01 07:12:33] [INFO ] Actually due to overlaps returned [1034, 1016, 48, 168, 291, 414, 537, 660, 784, 908, 31, 151, 274, 397, 520, 643, 767, 891, 148, 271, 394, 517, 640, 764, 888, 1014, 1055, 149, 272, 395, 518, 641, 765, 889, 1015, 1056, 1, 18, 259, 260, 382, 383, 505, 506, 628, 629, 752, 753, 876, 877, 999, 1000, 66, 186, 309, 432, 555, 678, 802, 926, 1057, 19, 1003, 1058]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 2181 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1052/1116 places, 1938/1938 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1044 transition count 1798
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 904 transition count 1789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 903 transition count 1789
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 298 place count 903 transition count 1750
Deduced a syphon composed of 39 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 377 place count 863 transition count 1750
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 389 place count 859 transition count 1742
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 397 place count 851 transition count 1742
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 400 place count 848 transition count 1739
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 848 transition count 1739
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 406 place count 848 transition count 1736
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 5 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 514 place count 794 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 522 place count 786 transition count 1674
Iterating global reduction 6 with 8 rules applied. Total rules applied 530 place count 786 transition count 1674
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 538 place count 786 transition count 1666
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 542 place count 784 transition count 1667
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 558 place count 784 transition count 1651
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 575 place count 767 transition count 1651
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 598 place count 767 transition count 1651
Applied a total of 598 rules in 431 ms. Remains 767 /1052 variables (removed 285) and now considering 1651/1938 (removed 287) transitions.
// Phase 1: matrix 1651 rows 767 cols
[2024-06-01 07:12:33] [INFO ] Computed 112 invariants in 28 ms
[2024-06-01 07:12:35] [INFO ] Implicit Places using invariants in 1731 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 346, 352, 355, 357, 362, 363, 416, 432, 438, 441, 443, 448, 449, 502, 519, 525, 528, 530, 535, 536, 589, 605, 612, 615, 617, 622, 623, 676, 692, 698, 701, 703]
[2024-06-01 07:12:35] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 448, 535, 622, 105, 191, 277, 363, 449, 536, 623, 89, 95, 100, 174, 180, 185, 260, 266, 271, 346, 352, 357, 432, 438, 443, 519, 525, 530, 605, 617, 692, 698, 703, 73, 101, 158, 244, 330, 416, 502, 589, 612, 676]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1735 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 720/1116 places, 1651/1938 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 689 transition count 1620
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 689 transition count 1620
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 682 transition count 1613
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 682 transition count 1613
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 108 place count 666 transition count 1597
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 666 transition count 1573
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 156 place count 642 transition count 1573
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 642 transition count 1565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 172 place count 634 transition count 1565
Applied a total of 172 rules in 277 ms. Remains 634 /720 variables (removed 86) and now considering 1565/1651 (removed 86) transitions.
// Phase 1: matrix 1565 rows 634 cols
[2024-06-01 07:12:35] [INFO ] Computed 65 invariants in 24 ms
[2024-06-01 07:12:37] [INFO ] Implicit Places using invariants in 1425 ms returned []
[2024-06-01 07:12:37] [INFO ] Invariant cache hit.
[2024-06-01 07:12:40] [INFO ] Implicit Places using invariants and state equation in 3126 ms returned []
Implicit Place search using SMT with State Equation took 4559 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 634/1116 places, 1565/1938 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9263 ms. Remains : 634/1116 places, 1565/1938 transitions.
RANDOM walk for 40000 steps (694 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (111 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188510 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188510 steps, saw 46359 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 07:12:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2199/2199 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2199/2199 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2075ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 392 ms.
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 55 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 634/634 places, 1565/1565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 58 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
[2024-06-01 07:12:46] [INFO ] Invariant cache hit.
[2024-06-01 07:12:47] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-06-01 07:12:47] [INFO ] Invariant cache hit.
[2024-06-01 07:12:49] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 3620 ms to find 0 implicit places.
[2024-06-01 07:12:49] [INFO ] Redundant transitions in 29 ms returned []
Running 1524 sub problems to find dead transitions.
[2024-06-01 07:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 1524/1524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 0/1524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61446ms problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 61460ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65179 ms. Remains : 634/634 places, 1565/1565 transitions.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 136 reset in 824 ms.
Product exploration explored 100000 steps with 143 reset in 845 ms.
Support contains 4 out of 3201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Applied a total of 0 rules in 557 ms. Remains 3201 /3201 variables (removed 0) and now considering 3865/3865 (removed 0) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2024-06-01 07:13:54] [INFO ] Computed 344 invariants in 89 ms
[2024-06-01 07:13:58] [INFO ] Implicit Places using invariants in 3498 ms returned []
[2024-06-01 07:13:58] [INFO ] Invariant cache hit.
[2024-06-01 07:14:27] [INFO ] Implicit Places using invariants and state equation in 29260 ms returned []
Implicit Place search using SMT with State Equation took 32762 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2024-06-01 07:14:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints]
After SMT, in 62936ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 63000ms
Finished structural reductions in LTL mode , in 1 iterations and 96334 ms. Remains : 3201/3201 places, 3865/3865 transitions.
Treatment of property ASLink-PT-08b-LTLCardinality-03 finished in 498291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U G((G(X(p1)) U p0)))))'
Support contains 3 out of 3202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3201 transition count 3270
Reduce places removed 595 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 598 rules applied. Total rules applied 1193 place count 2606 transition count 3267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1195 place count 2604 transition count 3267
Performed 868 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 868 Pre rules applied. Total rules applied 1195 place count 2604 transition count 2399
Deduced a syphon composed of 868 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 952 places and 0 transitions.
Iterating global reduction 3 with 1820 rules applied. Total rules applied 3015 place count 1652 transition count 2399
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3075 place count 1644 transition count 2347
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3127 place count 1592 transition count 2347
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3127 place count 1592 transition count 2314
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3226 place count 1526 transition count 2314
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3226 place count 1526 transition count 2282
Deduced a syphon composed of 32 places in 9 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3290 place count 1494 transition count 2282
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 253
Deduced a syphon composed of 253 places in 8 ms
Ensure Unique test removed 2 places
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 5 with 508 rules applied. Total rules applied 3798 place count 1239 transition count 2029
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3802 place count 1235 transition count 2025
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3807 place count 1234 transition count 2025
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 3808 place count 1234 transition count 2024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3809 place count 1233 transition count 2024
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3809 place count 1233 transition count 2023
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3811 place count 1232 transition count 2023
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3813 place count 1230 transition count 2021
Iterating global reduction 7 with 2 rules applied. Total rules applied 3815 place count 1230 transition count 2021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3817 place count 1230 transition count 2019
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3818 place count 1229 transition count 2019
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3820 place count 1228 transition count 2024
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3822 place count 1226 transition count 2022
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3846 place count 1210 transition count 2014
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3854 place count 1202 transition count 2014
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3854 place count 1202 transition count 1990
Deduced a syphon composed of 24 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3903 place count 1177 transition count 1990
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3920 place count 1160 transition count 1990
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3920 place count 1160 transition count 1989
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3922 place count 1159 transition count 1989
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 3972 place count 1134 transition count 1964
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 3988 place count 1118 transition count 1948
Iterating global reduction 12 with 16 rules applied. Total rules applied 4004 place count 1118 transition count 1948
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4012 place count 1110 transition count 1940
Iterating global reduction 12 with 8 rules applied. Total rules applied 4020 place count 1110 transition count 1940
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4028 place count 1110 transition count 1932
Applied a total of 4028 rules in 1449 ms. Remains 1110 /3202 variables (removed 2092) and now considering 1932/3866 (removed 1934) transitions.
// Phase 1: matrix 1932 rows 1110 cols
[2024-06-01 07:15:32] [INFO ] Computed 182 invariants in 43 ms
[2024-06-01 07:15:34] [INFO ] Implicit Places using invariants in 1991 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 291, 309, 329, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 761, 762, 764, 781, 799, 819, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 996, 1007, 1008, 1009, 1027, 1048, 1049, 1050, 1051]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 2000 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1037/3202 places, 1932/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 1037 transition count 1799
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 904 transition count 1799
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 266 place count 904 transition count 1760
Deduced a syphon composed of 39 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 345 place count 864 transition count 1760
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 860 transition count 1752
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 365 place count 852 transition count 1752
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 368 place count 849 transition count 1749
Iterating global reduction 4 with 3 rules applied. Total rules applied 371 place count 849 transition count 1749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 374 place count 849 transition count 1746
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 5 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 498 place count 787 transition count 1684
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 502 place count 785 transition count 1685
Applied a total of 502 rules in 252 ms. Remains 785 /1037 variables (removed 252) and now considering 1685/1932 (removed 247) transitions.
// Phase 1: matrix 1685 rows 785 cols
[2024-06-01 07:15:34] [INFO ] Computed 104 invariants in 28 ms
[2024-06-01 07:15:36] [INFO ] Implicit Places using invariants in 1517 ms returned [88, 94, 99, 175, 181, 186, 266, 272, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 618, 624, 629, 706, 712, 717, 782]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1520 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/3202 places, 1685/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 759 transition count 1684
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 743 transition count 1668
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 743 transition count 1668
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 49 place count 728 transition count 1653
Iterating global reduction 2 with 15 rules applied. Total rules applied 64 place count 728 transition count 1653
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 721 transition count 1646
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 721 transition count 1646
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 713 transition count 1638
Applied a total of 94 rules in 227 ms. Remains 713 /760 variables (removed 47) and now considering 1638/1685 (removed 47) transitions.
// Phase 1: matrix 1638 rows 713 cols
[2024-06-01 07:15:36] [INFO ] Computed 79 invariants in 26 ms
[2024-06-01 07:15:38] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2024-06-01 07:15:38] [INFO ] Invariant cache hit.
[2024-06-01 07:15:41] [INFO ] Implicit Places using invariants and state equation in 3373 ms returned []
Implicit Place search using SMT with State Equation took 4768 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 713/3202 places, 1638/3866 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 10216 ms. Remains : 713/3202 places, 1638/3866 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-05
Product exploration explored 100000 steps with 1164 reset in 557 ms.
Product exploration explored 100000 steps with 1165 reset in 505 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (460 resets) in 466 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 419 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 556 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 487 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (70 resets) in 714 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 571 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (69 resets) in 576 ms. (69 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 160659 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 6
Probabilistic random walk after 160659 steps, saw 38684 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 07:15:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 233/242 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/252 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 171/423 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 9/432 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 196/628 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 48/676 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 37/713 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/713 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1638/2351 variables, 713/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2351 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/2351 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2351/2351 variables, and 792 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2294 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 713/713 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 233/242 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/252 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 171/423 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 37 places in 319 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/432 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 196/628 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 48/676 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 37/713 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/713 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1638/2351 variables, 713/793 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2351 variables, 6/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2351 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/2351 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2351/2351 variables, and 799 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 713/713 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 6711ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 4850 ms.
Support contains 3 out of 713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 713/713 places, 1638/1638 transitions.
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 713 transition count 1598
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 88 place count 673 transition count 1590
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 673 transition count 1566
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 136 place count 649 transition count 1566
Applied a total of 136 rules in 102 ms. Remains 649 /713 variables (removed 64) and now considering 1566/1638 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 649/713 places, 1566/1638 transitions.
RANDOM walk for 40000 steps (680 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (113 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 210084 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 210084 steps, saw 56241 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1566 rows 649 cols
[2024-06-01 07:16:02] [INFO ] Computed 79 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/195 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/376 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/381 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 183/564 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/612 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/649 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1566/2215 variables, 649/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2215 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2215 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2215/2215 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 649/649 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/195 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/376 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/381 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 183/564 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/612 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/649 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1566/2215 variables, 649/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2215 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2215 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2215 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2215/2215 variables, and 729 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 649/649 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 422 ms.
Support contains 3 out of 649 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 1566/1566 transitions.
Applied a total of 0 rules in 45 ms. Remains 649 /649 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 649/649 places, 1566/1566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 1566/1566 transitions.
Applied a total of 0 rules in 35 ms. Remains 649 /649 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
[2024-06-01 07:16:05] [INFO ] Invariant cache hit.
[2024-06-01 07:16:06] [INFO ] Implicit Places using invariants in 1156 ms returned [88, 90, 160, 161, 235, 236, 306, 307, 377, 378, 448, 449, 519, 520]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 635/649 places, 1566/1566 transitions.
Applied a total of 0 rules in 48 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1245 ms. Remains : 635/649 places, 1566/1566 transitions.
RANDOM walk for 40000 steps (685 resets) in 328 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 203069 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 203069 steps, saw 54436 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1566 rows 635 cols
[2024-06-01 07:16:09] [INFO ] Computed 65 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/221 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/228 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/381 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/396 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/543 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/560 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/611 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/633 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/635 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1566/2201 variables, 635/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2201 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2201 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2201/2201 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/221 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/228 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/381 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/396 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/543 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/560 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/611 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/633 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/635 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/635 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1566/2201 variables, 635/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2201 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2201 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2201 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2201/2201 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2640ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 302 ms.
Support contains 3 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1566/1566 transitions.
Applied a total of 0 rules in 42 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 635/635 places, 1566/1566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1566/1566 transitions.
Applied a total of 0 rules in 43 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
[2024-06-01 07:16:12] [INFO ] Invariant cache hit.
[2024-06-01 07:16:13] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2024-06-01 07:16:13] [INFO ] Invariant cache hit.
[2024-06-01 07:16:16] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 3876 ms to find 0 implicit places.
[2024-06-01 07:16:16] [INFO ] Redundant transitions in 49 ms returned []
Running 1525 sub problems to find dead transitions.
[2024-06-01 07:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/634 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 634/2201 variables, and 61 constraints, problems are : Problem set: 0 solved, 1525 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 50/51 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 1525/1525 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1525 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/634 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
(s41 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/2201 variables, and 62 constraints, problems are : Problem set: 0 solved, 1525 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 50/51 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 0/1525 constraints, Known Traps: 1/1 constraints]
After SMT, in 61340ms problems are : Problem set: 0 solved, 1525 unsolved
Search for dead transitions found 0 dead transitions in 61365ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65345 ms. Remains : 635/635 places, 1566/1566 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 46 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:17:17] [INFO ] Invariant cache hit.
[2024-06-01 07:17:18] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:17:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 07:17:18] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 52 ms returned sat
[2024-06-01 07:17:19] [INFO ] After 1069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:17:19] [INFO ] After 1166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:17:19] [INFO ] After 1502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1771 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 363 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1638/1638 transitions.
Applied a total of 0 rules in 55 ms. Remains 713 /713 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
// Phase 1: matrix 1638 rows 713 cols
[2024-06-01 07:17:20] [INFO ] Computed 79 invariants in 26 ms
[2024-06-01 07:17:21] [INFO ] Implicit Places using invariants in 1488 ms returned []
[2024-06-01 07:17:21] [INFO ] Invariant cache hit.
[2024-06-01 07:17:25] [INFO ] Implicit Places using invariants and state equation in 3379 ms returned []
Implicit Place search using SMT with State Equation took 4873 ms to find 0 implicit places.
[2024-06-01 07:17:25] [INFO ] Redundant transitions in 32 ms returned []
Running 1581 sub problems to find dead transitions.
[2024-06-01 07:17:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s72 1.0)
(s73 4.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 6.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2351 variables, and 51 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 43/66 constraints, State Equation: 0/713 constraints, PredecessorRefiner: 1581/1581 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2351 variables, and 51 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 43/66 constraints, State Equation: 0/713 constraints, PredecessorRefiner: 0/1581 constraints, Known Traps: 0/0 constraints]
After SMT, in 61106ms problems are : Problem set: 0 solved, 1581 unsolved
Search for dead transitions found 0 dead transitions in 61121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66091 ms. Remains : 713/713 places, 1638/1638 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 218 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (458 resets) in 1958 ms. (20 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (75 resets) in 416 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (71 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (73 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (70 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 148219 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 148219 steps, saw 36971 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 07:18:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 233/242 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/252 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 171/423 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 9/432 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 196/628 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 48/676 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 37/713 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/713 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1638/2351 variables, 713/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2351 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/2351 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2351/2351 variables, and 792 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 713/713 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 233/242 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/252 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 171/423 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/432 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 196/628 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 48/676 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 37/713 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/713 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1638/2351 variables, 713/793 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2351 variables, 6/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2351 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/2351 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2351/2351 variables, and 799 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4614 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 713/713 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 6794ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 5 properties in 12849 ms.
Support contains 3 out of 713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 713/713 places, 1638/1638 transitions.
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 713 transition count 1598
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 88 place count 673 transition count 1590
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 673 transition count 1566
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 136 place count 649 transition count 1566
Applied a total of 136 rules in 98 ms. Remains 649 /713 variables (removed 64) and now considering 1566/1638 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 649/713 places, 1566/1638 transitions.
RANDOM walk for 40000 steps (647 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (98 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 202499 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 202499 steps, saw 54255 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1566 rows 649 cols
[2024-06-01 07:18:53] [INFO ] Computed 79 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/195 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/376 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/381 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 183/564 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/612 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/649 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1566/2215 variables, 649/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2215 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2215 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2215/2215 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 649/649 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/195 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/202 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/376 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/381 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 183/564 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/612 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/649 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1566/2215 variables, 649/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2215 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2215 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2215 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2215/2215 variables, and 729 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 649/649 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2398ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 381 ms.
Support contains 3 out of 649 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 1566/1566 transitions.
Applied a total of 0 rules in 46 ms. Remains 649 /649 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 649/649 places, 1566/1566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 1566/1566 transitions.
Applied a total of 0 rules in 46 ms. Remains 649 /649 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
[2024-06-01 07:18:56] [INFO ] Invariant cache hit.
[2024-06-01 07:18:58] [INFO ] Implicit Places using invariants in 1146 ms returned [88, 90, 160, 161, 235, 236, 306, 307, 377, 378, 448, 449, 519, 520]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 635/649 places, 1566/1566 transitions.
Applied a total of 0 rules in 46 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1245 ms. Remains : 635/649 places, 1566/1566 transitions.
RANDOM walk for 40000 steps (690 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (111 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 205786 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 205786 steps, saw 55187 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1566 rows 635 cols
[2024-06-01 07:19:01] [INFO ] Computed 65 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/221 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/228 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/381 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/396 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/543 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/560 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/611 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/633 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/635 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1566/2201 variables, 635/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2201 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2201 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2201/2201 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/221 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/228 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/381 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/396 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/543 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/560 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/611 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/633 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/635 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/635 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1566/2201 variables, 635/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2201 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2201 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2201 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2201/2201 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2737ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 323 ms.
Support contains 3 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1566/1566 transitions.
Applied a total of 0 rules in 45 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 635/635 places, 1566/1566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1566/1566 transitions.
Applied a total of 0 rules in 47 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
[2024-06-01 07:19:04] [INFO ] Invariant cache hit.
[2024-06-01 07:19:05] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2024-06-01 07:19:05] [INFO ] Invariant cache hit.
[2024-06-01 07:19:07] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 3484 ms to find 0 implicit places.
[2024-06-01 07:19:07] [INFO ] Redundant transitions in 48 ms returned []
Running 1525 sub problems to find dead transitions.
[2024-06-01 07:19:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
SMT process timed out in 31207ms, After SMT, problems are : Problem set: 0 solved, 1525 unsolved
Search for dead transitions found 0 dead transitions in 31232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34824 ms. Remains : 635/635 places, 1566/1566 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 46 ms. Remains 635 /635 variables (removed 0) and now considering 1566/1566 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:19:39] [INFO ] Invariant cache hit.
[2024-06-01 07:19:39] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:19:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 07:19:39] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 51 ms returned sat
[2024-06-01 07:19:40] [INFO ] After 1059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:19:40] [INFO ] After 1149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:19:40] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1727 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 15 factoid took 381 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1147 reset in 519 ms.
Product exploration explored 100000 steps with 1128 reset in 518 ms.
Support contains 3 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1638/1638 transitions.
Applied a total of 0 rules in 30 ms. Remains 713 /713 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
// Phase 1: matrix 1638 rows 713 cols
[2024-06-01 07:19:42] [INFO ] Computed 79 invariants in 18 ms
[2024-06-01 07:19:43] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-06-01 07:19:43] [INFO ] Invariant cache hit.
[2024-06-01 07:19:46] [INFO ] Implicit Places using invariants and state equation in 3006 ms returned []
Implicit Place search using SMT with State Equation took 4063 ms to find 0 implicit places.
[2024-06-01 07:19:46] [INFO ] Redundant transitions in 51 ms returned []
Running 1581 sub problems to find dead transitions.
[2024-06-01 07:19:46] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
SMT process timed out in 31069ms, After SMT, problems are : Problem set: 0 solved, 1581 unsolved
Search for dead transitions found 0 dead transitions in 31095ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35249 ms. Remains : 713/713 places, 1638/1638 transitions.
Treatment of property ASLink-PT-08b-LTLCardinality-05 finished in 287100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3201 transition count 3270
Reduce places removed 595 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 598 rules applied. Total rules applied 1193 place count 2606 transition count 3267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1195 place count 2604 transition count 3267
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 867 Pre rules applied. Total rules applied 1195 place count 2604 transition count 2400
Deduced a syphon composed of 867 places in 8 ms
Ensure Unique test removed 83 places
Reduce places removed 950 places and 0 transitions.
Iterating global reduction 3 with 1817 rules applied. Total rules applied 3012 place count 1654 transition count 2400
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3072 place count 1646 transition count 2348
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3124 place count 1594 transition count 2348
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3124 place count 1594 transition count 2316
Deduced a syphon composed of 32 places in 7 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 3220 place count 1530 transition count 2316
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 3220 place count 1530 transition count 2285
Deduced a syphon composed of 31 places in 8 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 3282 place count 1499 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3283 place count 1498 transition count 2284
Iterating global reduction 5 with 1 rules applied. Total rules applied 3284 place count 1498 transition count 2284
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 7 ms
Ensure Unique test removed 3 places
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 5 with 515 rules applied. Total rules applied 3799 place count 1239 transition count 2028
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3803 place count 1235 transition count 2024
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3808 place count 1234 transition count 2024
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 3809 place count 1234 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3810 place count 1233 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3810 place count 1233 transition count 2022
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3812 place count 1232 transition count 2022
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3814 place count 1230 transition count 2020
Iterating global reduction 7 with 2 rules applied. Total rules applied 3816 place count 1230 transition count 2020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3818 place count 1230 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3819 place count 1229 transition count 2018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3821 place count 1228 transition count 2023
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3823 place count 1226 transition count 2021
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3847 place count 1210 transition count 2013
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3855 place count 1202 transition count 2013
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3855 place count 1202 transition count 1989
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3904 place count 1177 transition count 1989
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3921 place count 1160 transition count 1989
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3921 place count 1160 transition count 1988
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3923 place count 1159 transition count 1988
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 3973 place count 1134 transition count 1963
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 3989 place count 1118 transition count 1947
Iterating global reduction 12 with 16 rules applied. Total rules applied 4005 place count 1118 transition count 1947
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4013 place count 1110 transition count 1939
Iterating global reduction 12 with 8 rules applied. Total rules applied 4021 place count 1110 transition count 1939
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4029 place count 1110 transition count 1931
Applied a total of 4029 rules in 1140 ms. Remains 1110 /3202 variables (removed 2092) and now considering 1931/3866 (removed 1935) transitions.
// Phase 1: matrix 1931 rows 1110 cols
[2024-06-01 07:20:19] [INFO ] Computed 183 invariants in 42 ms
[2024-06-01 07:20:21] [INFO ] Implicit Places using invariants in 1697 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 469, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 761, 762, 764, 781, 799, 819, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 996, 1007, 1008, 1009, 1027, 1048, 1049, 1050, 1051]
[2024-06-01 07:20:21] [INFO ] Actually due to overlaps returned [1027, 1009, 48, 168, 290, 412, 537, 659, 781, 903, 31, 148, 151, 270, 273, 392, 395, 517, 520, 639, 642, 761, 764, 883, 886, 1007, 1048, 149, 271, 393, 518, 640, 762, 884, 1008, 1049, 1, 18, 257, 258, 379, 380, 504, 505, 626, 627, 748, 749, 870, 871, 992, 993, 1050, 19, 66, 86, 137, 186, 206, 308, 328, 430, 450, 555, 575, 677, 697, 799, 819, 921, 941, 996, 1051]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1708 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1037/3202 places, 1931/3866 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 1036 transition count 1799
Reduce places removed 132 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 904 transition count 1798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 903 transition count 1798
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 267 place count 903 transition count 1759
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 346 place count 863 transition count 1759
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 358 place count 859 transition count 1751
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 366 place count 851 transition count 1751
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 369 place count 848 transition count 1748
Iterating global reduction 5 with 3 rules applied. Total rules applied 372 place count 848 transition count 1748
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 375 place count 848 transition count 1745
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 497 place count 787 transition count 1684
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 501 place count 785 transition count 1685
Applied a total of 501 rules in 154 ms. Remains 785 /1037 variables (removed 252) and now considering 1685/1931 (removed 246) transitions.
// Phase 1: matrix 1685 rows 785 cols
[2024-06-01 07:20:21] [INFO ] Computed 104 invariants in 17 ms
[2024-06-01 07:20:22] [INFO ] Implicit Places using invariants in 1095 ms returned [88, 94, 99, 176, 182, 187, 264, 270, 275, 354, 360, 365, 442, 448, 453, 530, 536, 541, 618, 624, 629, 706, 712, 717, 782]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1098 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/3202 places, 1685/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 759 transition count 1684
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 743 transition count 1668
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 743 transition count 1668
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 727 transition count 1652
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 727 transition count 1652
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 719 transition count 1644
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 719 transition count 1644
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 711 transition count 1636
Applied a total of 98 rules in 230 ms. Remains 711 /760 variables (removed 49) and now considering 1636/1685 (removed 49) transitions.
// Phase 1: matrix 1636 rows 711 cols
[2024-06-01 07:20:22] [INFO ] Computed 79 invariants in 26 ms
[2024-06-01 07:20:23] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2024-06-01 07:20:23] [INFO ] Invariant cache hit.
[2024-06-01 07:20:26] [INFO ] Implicit Places using invariants and state equation in 2776 ms returned []
Implicit Place search using SMT with State Equation took 3928 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 711/3202 places, 1636/3866 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8261 ms. Remains : 711/3202 places, 1636/3866 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-08
Product exploration explored 100000 steps with 1088 reset in 478 ms.
Product exploration explored 100000 steps with 1162 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 3141 steps (34 resets) in 21 ms. (142 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1636/1636 transitions.
Applied a total of 0 rules in 39 ms. Remains 711 /711 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2024-06-01 07:20:27] [INFO ] Invariant cache hit.
[2024-06-01 07:20:28] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-06-01 07:20:28] [INFO ] Invariant cache hit.
[2024-06-01 07:20:31] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 4074 ms to find 0 implicit places.
[2024-06-01 07:20:31] [INFO ] Redundant transitions in 42 ms returned []
Running 1579 sub problems to find dead transitions.
[2024-06-01 07:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1579 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1579 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/2347 variables, and 48 constraints, problems are : Problem set: 0 solved, 1579 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 40/66 constraints, State Equation: 0/711 constraints, PredecessorRefiner: 1579/1579 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1579 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1579 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/2347 variables, and 48 constraints, problems are : Problem set: 0 solved, 1579 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 40/66 constraints, State Equation: 0/711 constraints, PredecessorRefiner: 0/1579 constraints, Known Traps: 0/0 constraints]
After SMT, in 61077ms problems are : Problem set: 0 solved, 1579 unsolved
Search for dead transitions found 0 dead transitions in 61098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65270 ms. Remains : 711/711 places, 1636/1636 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 3616 steps (32 resets) in 28 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1146 reset in 487 ms.
Product exploration explored 100000 steps with 1152 reset in 491 ms.
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1636/1636 transitions.
Applied a total of 0 rules in 29 ms. Remains 711 /711 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2024-06-01 07:21:34] [INFO ] Invariant cache hit.
[2024-06-01 07:21:35] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2024-06-01 07:21:35] [INFO ] Invariant cache hit.
[2024-06-01 07:21:38] [INFO ] Implicit Places using invariants and state equation in 2673 ms returned []
Implicit Place search using SMT with State Equation took 3861 ms to find 0 implicit places.
[2024-06-01 07:21:38] [INFO ] Redundant transitions in 31 ms returned []
Running 1579 sub problems to find dead transitions.
[2024-06-01 07:21:38] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1579 unsolved
SMT process timed out in 31106ms, After SMT, problems are : Problem set: 0 solved, 1579 unsolved
Search for dead transitions found 0 dead transitions in 31122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35055 ms. Remains : 711/711 places, 1636/1636 transitions.
Treatment of property ASLink-PT-08b-LTLCardinality-08 finished in 111573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3201 transition count 3270
Reduce places removed 595 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 598 rules applied. Total rules applied 1193 place count 2606 transition count 3267
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1196 place count 2604 transition count 3266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1197 place count 2603 transition count 3266
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 866 Pre rules applied. Total rules applied 1197 place count 2603 transition count 2400
Deduced a syphon composed of 866 places in 12 ms
Ensure Unique test removed 83 places
Reduce places removed 949 places and 0 transitions.
Iterating global reduction 4 with 1815 rules applied. Total rules applied 3012 place count 1654 transition count 2400
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3072 place count 1646 transition count 2348
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3124 place count 1594 transition count 2348
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3124 place count 1594 transition count 2316
Deduced a syphon composed of 32 places in 12 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 3220 place count 1530 transition count 2316
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 3220 place count 1530 transition count 2285
Deduced a syphon composed of 31 places in 11 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 3282 place count 1499 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3283 place count 1498 transition count 2284
Iterating global reduction 6 with 1 rules applied. Total rules applied 3284 place count 1498 transition count 2284
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 7 ms
Ensure Unique test removed 3 places
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 6 with 515 rules applied. Total rules applied 3799 place count 1239 transition count 2028
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3803 place count 1235 transition count 2024
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3808 place count 1234 transition count 2024
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3809 place count 1234 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3810 place count 1233 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3810 place count 1233 transition count 2022
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3812 place count 1232 transition count 2022
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3814 place count 1230 transition count 2020
Iterating global reduction 8 with 2 rules applied. Total rules applied 3816 place count 1230 transition count 2020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3818 place count 1230 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3819 place count 1229 transition count 2018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3821 place count 1228 transition count 2023
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3823 place count 1226 transition count 2021
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 24 rules applied. Total rules applied 3847 place count 1210 transition count 2013
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3855 place count 1202 transition count 2013
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 24 Pre rules applied. Total rules applied 3855 place count 1202 transition count 1989
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 49 rules applied. Total rules applied 3904 place count 1177 transition count 1989
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 12 with 17 rules applied. Total rules applied 3921 place count 1160 transition count 1989
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3921 place count 1160 transition count 1988
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3923 place count 1159 transition count 1988
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 13 with 50 rules applied. Total rules applied 3973 place count 1134 transition count 1963
Discarding 16 places :
Symmetric choice reduction at 13 with 16 rule applications. Total rules 3989 place count 1118 transition count 1947
Iterating global reduction 13 with 16 rules applied. Total rules applied 4005 place count 1118 transition count 1947
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 4013 place count 1110 transition count 1939
Iterating global reduction 13 with 8 rules applied. Total rules applied 4021 place count 1110 transition count 1939
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 4029 place count 1110 transition count 1931
Applied a total of 4029 rules in 1185 ms. Remains 1110 /3202 variables (removed 2092) and now considering 1931/3866 (removed 1935) transitions.
// Phase 1: matrix 1931 rows 1110 cols
[2024-06-01 07:22:11] [INFO ] Computed 183 invariants in 32 ms
[2024-06-01 07:22:13] [INFO ] Implicit Places using invariants in 2188 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 625, 626, 638, 639, 641, 658, 676, 696, 748, 749, 761, 762, 764, 781, 799, 819, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 996, 1007, 1008, 1009, 1027, 1048, 1049, 1050, 1051]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 2194 ms to find 74 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1036/3202 places, 1931/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1036 transition count 1799
Reduce places removed 132 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 265 place count 904 transition count 1798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 903 transition count 1798
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 266 place count 903 transition count 1759
Deduced a syphon composed of 39 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 345 place count 863 transition count 1759
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 357 place count 859 transition count 1751
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 365 place count 851 transition count 1751
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 368 place count 848 transition count 1748
Iterating global reduction 5 with 3 rules applied. Total rules applied 371 place count 848 transition count 1748
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 374 place count 848 transition count 1745
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 5 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 498 place count 786 transition count 1683
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 502 place count 784 transition count 1684
Applied a total of 502 rules in 241 ms. Remains 784 /1036 variables (removed 252) and now considering 1684/1931 (removed 247) transitions.
// Phase 1: matrix 1684 rows 784 cols
[2024-06-01 07:22:13] [INFO ] Computed 104 invariants in 26 ms
[2024-06-01 07:22:14] [INFO ] Implicit Places using invariants in 1158 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 528, 534, 540, 617, 623, 628, 705, 711, 716, 781]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1162 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/3202 places, 1684/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 759 transition count 1683
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 17 place count 744 transition count 1668
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 744 transition count 1668
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 47 place count 729 transition count 1653
Iterating global reduction 2 with 15 rules applied. Total rules applied 62 place count 729 transition count 1653
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 721 transition count 1645
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 721 transition count 1645
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 713 transition count 1637
Applied a total of 94 rules in 140 ms. Remains 713 /760 variables (removed 47) and now considering 1637/1684 (removed 47) transitions.
// Phase 1: matrix 1637 rows 713 cols
[2024-06-01 07:22:14] [INFO ] Computed 80 invariants in 26 ms
[2024-06-01 07:22:16] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2024-06-01 07:22:16] [INFO ] Invariant cache hit.
[2024-06-01 07:22:18] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 713/3202 places, 1637/3866 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8836 ms. Remains : 713/3202 places, 1637/3866 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-09
Product exploration explored 100000 steps with 1109 reset in 314 ms.
Product exploration explored 100000 steps with 1100 reset in 513 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 2307 steps (25 resets) in 30 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1637/1637 transitions.
Applied a total of 0 rules in 31 ms. Remains 713 /713 variables (removed 0) and now considering 1637/1637 (removed 0) transitions.
[2024-06-01 07:22:20] [INFO ] Invariant cache hit.
[2024-06-01 07:22:20] [INFO ] Implicit Places using invariants in 781 ms returned []
[2024-06-01 07:22:20] [INFO ] Invariant cache hit.
[2024-06-01 07:22:23] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 3470 ms to find 0 implicit places.
[2024-06-01 07:22:23] [INFO ] Redundant transitions in 31 ms returned []
Running 1580 sub problems to find dead transitions.
[2024-06-01 07:22:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1580 unsolved
SMT process timed out in 30899ms, After SMT, problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 30915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34456 ms. Remains : 713/713 places, 1637/1637 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 2044 steps (18 resets) in 16 ms. (120 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1143 reset in 369 ms.
Product exploration explored 100000 steps with 1138 reset in 344 ms.
Support contains 2 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1637/1637 transitions.
Applied a total of 0 rules in 31 ms. Remains 713 /713 variables (removed 0) and now considering 1637/1637 (removed 0) transitions.
[2024-06-01 07:22:55] [INFO ] Invariant cache hit.
[2024-06-01 07:22:56] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-06-01 07:22:56] [INFO ] Invariant cache hit.
[2024-06-01 07:22:59] [INFO ] Implicit Places using invariants and state equation in 2682 ms returned []
Implicit Place search using SMT with State Equation took 3609 ms to find 0 implicit places.
[2024-06-01 07:22:59] [INFO ] Redundant transitions in 46 ms returned []
Running 1580 sub problems to find dead transitions.
[2024-06-01 07:22:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1580 unsolved
SMT process timed out in 31145ms, After SMT, problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 31169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34878 ms. Remains : 713/713 places, 1637/1637 transitions.
Treatment of property ASLink-PT-08b-LTLCardinality-09 finished in 81101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 3202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 3201 transition count 3271
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 597 rules applied. Total rules applied 1191 place count 2607 transition count 3268
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1194 place count 2605 transition count 3267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1195 place count 2604 transition count 3267
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 866 Pre rules applied. Total rules applied 1195 place count 2604 transition count 2401
Deduced a syphon composed of 866 places in 14 ms
Ensure Unique test removed 83 places
Reduce places removed 949 places and 0 transitions.
Iterating global reduction 4 with 1815 rules applied. Total rules applied 3010 place count 1655 transition count 2401
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 60 rules applied. Total rules applied 3070 place count 1646 transition count 2350
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 3121 place count 1595 transition count 2350
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3121 place count 1595 transition count 2317
Deduced a syphon composed of 33 places in 11 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3220 place count 1529 transition count 2317
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3220 place count 1529 transition count 2285
Deduced a syphon composed of 32 places in 11 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3284 place count 1497 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3285 place count 1496 transition count 2284
Iterating global reduction 6 with 1 rules applied. Total rules applied 3286 place count 1496 transition count 2284
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 8 ms
Ensure Unique test removed 2 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 6 with 510 rules applied. Total rules applied 3796 place count 1240 transition count 2030
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3800 place count 1236 transition count 2026
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3805 place count 1235 transition count 2026
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3806 place count 1235 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3807 place count 1234 transition count 2025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3807 place count 1234 transition count 2024
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3809 place count 1233 transition count 2024
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3811 place count 1231 transition count 2022
Iterating global reduction 8 with 2 rules applied. Total rules applied 3813 place count 1231 transition count 2022
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3815 place count 1231 transition count 2020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3816 place count 1230 transition count 2020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3818 place count 1229 transition count 2025
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3820 place count 1227 transition count 2023
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 22 rules applied. Total rules applied 3842 place count 1212 transition count 2016
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3849 place count 1205 transition count 2016
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 22 Pre rules applied. Total rules applied 3849 place count 1205 transition count 1994
Deduced a syphon composed of 22 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 12 with 45 rules applied. Total rules applied 3894 place count 1182 transition count 1994
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 3910 place count 1166 transition count 1994
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3910 place count 1166 transition count 1993
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3912 place count 1165 transition count 1993
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 13 with 48 rules applied. Total rules applied 3960 place count 1141 transition count 1969
Discarding 15 places :
Symmetric choice reduction at 13 with 15 rule applications. Total rules 3975 place count 1126 transition count 1954
Iterating global reduction 13 with 15 rules applied. Total rules applied 3990 place count 1126 transition count 1954
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 3997 place count 1119 transition count 1947
Iterating global reduction 13 with 7 rules applied. Total rules applied 4004 place count 1119 transition count 1947
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 4011 place count 1119 transition count 1940
Applied a total of 4011 rules in 1358 ms. Remains 1119 /3202 variables (removed 2083) and now considering 1940/3866 (removed 1926) transitions.
// Phase 1: matrix 1940 rows 1119 cols
[2024-06-01 07:23:32] [INFO ] Computed 184 invariants in 42 ms
[2024-06-01 07:23:34] [INFO ] Implicit Places using invariants in 1724 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 386, 401, 402, 404, 421, 439, 459, 510, 511, 523, 524, 526, 543, 561, 581, 632, 633, 645, 646, 648, 666, 684, 704, 755, 756, 768, 769, 771, 788, 806, 826, 877, 878, 890, 891, 893, 911, 929, 950, 1001, 1002, 1005, 1016, 1017, 1018, 1036, 1057, 1058, 1059, 1060]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 1726 ms to find 71 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1048/3202 places, 1940/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1048 transition count 1808
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 916 transition count 1808
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 264 place count 916 transition count 1769
Deduced a syphon composed of 39 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 343 place count 876 transition count 1769
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 355 place count 872 transition count 1761
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 363 place count 864 transition count 1761
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 366 place count 861 transition count 1758
Iterating global reduction 4 with 3 rules applied. Total rules applied 369 place count 861 transition count 1758
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 372 place count 861 transition count 1755
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 4 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 498 place count 798 transition count 1692
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 502 place count 796 transition count 1693
Applied a total of 502 rules in 162 ms. Remains 796 /1048 variables (removed 252) and now considering 1693/1940 (removed 247) transitions.
// Phase 1: matrix 1693 rows 796 cols
[2024-06-01 07:23:34] [INFO ] Computed 108 invariants in 17 ms
[2024-06-01 07:23:35] [INFO ] Implicit Places using invariants in 1207 ms returned [88, 94, 99, 174, 180, 185, 267, 273, 278, 362, 368, 373, 450, 456, 461, 539, 545, 550, 627, 633, 638, 717, 723, 728, 793]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1216 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 771/3202 places, 1693/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 771 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 770 transition count 1692
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 754 transition count 1676
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 754 transition count 1676
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 738 transition count 1660
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 738 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 730 transition count 1652
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 730 transition count 1652
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 722 transition count 1644
Applied a total of 98 rules in 226 ms. Remains 722 /771 variables (removed 49) and now considering 1644/1693 (removed 49) transitions.
// Phase 1: matrix 1644 rows 722 cols
[2024-06-01 07:23:35] [INFO ] Computed 83 invariants in 24 ms
[2024-06-01 07:23:37] [INFO ] Implicit Places using invariants in 1402 ms returned []
[2024-06-01 07:23:37] [INFO ] Invariant cache hit.
[2024-06-01 07:23:40] [INFO ] Implicit Places using invariants and state equation in 3208 ms returned []
Implicit Place search using SMT with State Equation took 4617 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 722/3202 places, 1644/3866 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9313 ms. Remains : 722/3202 places, 1644/3866 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-11
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-11 finished in 9483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : ASLink-PT-08b-LTLCardinality-03
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 3202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3202/3202 places, 3866/3866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 3201 transition count 3272
Reduce places removed 593 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 596 rules applied. Total rules applied 1189 place count 2608 transition count 3269
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 1194 place count 2606 transition count 3266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1197 place count 2603 transition count 3266
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 865 Pre rules applied. Total rules applied 1197 place count 2603 transition count 2401
Deduced a syphon composed of 865 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 949 places and 0 transitions.
Iterating global reduction 4 with 1814 rules applied. Total rules applied 3011 place count 1654 transition count 2401
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3071 place count 1646 transition count 2349
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3123 place count 1594 transition count 2349
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3123 place count 1594 transition count 2316
Deduced a syphon composed of 33 places in 11 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3222 place count 1528 transition count 2316
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3222 place count 1528 transition count 2284
Deduced a syphon composed of 32 places in 11 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3286 place count 1496 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3287 place count 1495 transition count 2283
Iterating global reduction 6 with 1 rules applied. Total rules applied 3288 place count 1495 transition count 2283
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 6 with 510 rules applied. Total rules applied 3798 place count 1239 transition count 2029
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3802 place count 1235 transition count 2025
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3807 place count 1234 transition count 2025
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3808 place count 1234 transition count 2024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3809 place count 1233 transition count 2024
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3809 place count 1233 transition count 2023
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3811 place count 1232 transition count 2023
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3813 place count 1230 transition count 2021
Iterating global reduction 8 with 2 rules applied. Total rules applied 3815 place count 1230 transition count 2021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3817 place count 1230 transition count 2019
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3818 place count 1229 transition count 2019
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3820 place count 1228 transition count 2024
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3822 place count 1226 transition count 2022
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 24 rules applied. Total rules applied 3846 place count 1210 transition count 2014
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3854 place count 1202 transition count 2014
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 24 Pre rules applied. Total rules applied 3854 place count 1202 transition count 1990
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 49 rules applied. Total rules applied 3903 place count 1177 transition count 1990
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 12 with 17 rules applied. Total rules applied 3920 place count 1160 transition count 1990
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3920 place count 1160 transition count 1989
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3922 place count 1159 transition count 1989
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 13 with 50 rules applied. Total rules applied 3972 place count 1134 transition count 1964
Discarding 16 places :
Symmetric choice reduction at 13 with 16 rule applications. Total rules 3988 place count 1118 transition count 1948
Iterating global reduction 13 with 16 rules applied. Total rules applied 4004 place count 1118 transition count 1948
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 4012 place count 1110 transition count 1940
Iterating global reduction 13 with 8 rules applied. Total rules applied 4020 place count 1110 transition count 1940
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 4028 place count 1110 transition count 1932
Applied a total of 4028 rules in 1221 ms. Remains 1110 /3202 variables (removed 2092) and now considering 1932/3866 (removed 1934) transitions.
// Phase 1: matrix 1932 rows 1110 cols
[2024-06-01 07:23:42] [INFO ] Computed 182 invariants in 42 ms
[2024-06-01 07:23:44] [INFO ] Implicit Places using invariants in 2479 ms returned [1, 18, 19, 31, 48, 66, 86, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 747, 748, 760, 761, 763, 780, 798, 818, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 996, 1007, 1008, 1009, 1027, 1048, 1049, 1050, 1051]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 2485 ms to find 73 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1037/3202 places, 1932/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 1037 transition count 1801
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 906 transition count 1800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 905 transition count 1800
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 264 place count 905 transition count 1761
Deduced a syphon composed of 39 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 343 place count 865 transition count 1761
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 355 place count 861 transition count 1753
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 363 place count 853 transition count 1753
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 366 place count 850 transition count 1750
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 850 transition count 1750
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 372 place count 850 transition count 1747
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 5 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 496 place count 788 transition count 1685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 500 place count 786 transition count 1686
Applied a total of 500 rules in 268 ms. Remains 786 /1037 variables (removed 251) and now considering 1686/1932 (removed 246) transitions.
// Phase 1: matrix 1686 rows 786 cols
[2024-06-01 07:23:44] [INFO ] Computed 104 invariants in 28 ms
[2024-06-01 07:23:46] [INFO ] Implicit Places using invariants in 1294 ms returned [88, 96, 101, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 529, 535, 540, 617, 624, 707, 713, 718, 783]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1297 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 762/3202 places, 1686/3866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 762 transition count 1685
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 761 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 760 transition count 1684
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 18 place count 746 transition count 1670
Iterating global reduction 3 with 14 rules applied. Total rules applied 32 place count 746 transition count 1670
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 45 place count 733 transition count 1657
Iterating global reduction 3 with 13 rules applied. Total rules applied 58 place count 733 transition count 1657
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 727 transition count 1651
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 727 transition count 1651
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 86 place count 719 transition count 1643
Applied a total of 86 rules in 237 ms. Remains 719 /762 variables (removed 43) and now considering 1643/1686 (removed 43) transitions.
// Phase 1: matrix 1643 rows 719 cols
[2024-06-01 07:23:46] [INFO ] Computed 80 invariants in 27 ms
[2024-06-01 07:23:47] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2024-06-01 07:23:47] [INFO ] Invariant cache hit.
[2024-06-01 07:23:50] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 4502 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 719/3202 places, 1643/3866 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 10013 ms. Remains : 719/3202 places, 1643/3866 transitions.
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-03
Product exploration explored 100000 steps with 1124 reset in 507 ms.
Product exploration explored 100000 steps with 1177 reset in 488 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (449 resets) in 267 ms. (149 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (71 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-06-01 07:23:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/198 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/456 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/486 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/655 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/661 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 58/719 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1643/2362 variables, 719/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2362 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2362 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2362/2362 variables, and 799 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/198 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/456 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/486 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/655 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/661 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 58/719 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1643/2362 variables, 719/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2362 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2362 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2362 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2362/2362 variables, and 800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2233ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1643/1643 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 1642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 718 transition count 1642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 718 transition count 1641
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 717 transition count 1641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 716 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 715 transition count 1639
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 715 transition count 1639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 714 transition count 1638
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 714 transition count 1638
Free-agglomeration rule applied 39 times.
Iterating global reduction 2 with 39 rules applied. Total rules applied 49 place count 714 transition count 1599
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 96 place count 675 transition count 1591
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 119 place count 675 transition count 1568
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 142 place count 652 transition count 1568
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 652 transition count 1568
Applied a total of 143 rules in 340 ms. Remains 652 /719 variables (removed 67) and now considering 1568/1643 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 652/719 places, 1568/1643 transitions.
RANDOM walk for 40000 steps (681 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 183670 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183670 steps, saw 48075 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 1568 rows 652 cols
[2024-06-01 07:23:58] [INFO ] Computed 80 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/167 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/394 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/414 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 159/573 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/578 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/652 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1568/2220 variables, 652/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2220 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2220 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 732 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/167 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/394 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/414 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 159/573 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/578 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/652 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1568/2220 variables, 652/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2220 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2220 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2220 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2606ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1568/1568 transitions.
Applied a total of 0 rules in 28 ms. Remains 652 /652 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 652/652 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1568/1568 transitions.
Applied a total of 0 rules in 28 ms. Remains 652 /652 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-01 07:24:00] [INFO ] Invariant cache hit.
[2024-06-01 07:24:02] [INFO ] Implicit Places using invariants in 1134 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 444, 445, 515, 517, 522, 523]
[2024-06-01 07:24:02] [INFO ] Actually due to overlaps returned [88, 159, 230, 301, 372, 444, 522, 89, 160, 231, 302, 373, 445, 523, 517]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1140 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/652 places, 1568/1568 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 636 transition count 1567
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 636 transition count 1567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 635 transition count 1566
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 635 transition count 1565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 634 transition count 1565
Applied a total of 6 rules in 162 ms. Remains 634 /637 variables (removed 3) and now considering 1565/1568 (removed 3) transitions.
// Phase 1: matrix 1565 rows 634 cols
[2024-06-01 07:24:02] [INFO ] Computed 65 invariants in 24 ms
[2024-06-01 07:24:03] [INFO ] Implicit Places using invariants in 1324 ms returned []
[2024-06-01 07:24:03] [INFO ] Invariant cache hit.
[2024-06-01 07:24:06] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 4542 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 634/652 places, 1565/1568 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5872 ms. Remains : 634/652 places, 1565/1568 transitions.
RANDOM walk for 40000 steps (662 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (107 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 202743 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 202743 steps, saw 53755 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 07:24:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2199/2199 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2199/2199 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1941ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 46 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 634/634 places, 1565/1565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 46 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
[2024-06-01 07:24:12] [INFO ] Invariant cache hit.
[2024-06-01 07:24:12] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-06-01 07:24:12] [INFO ] Invariant cache hit.
[2024-06-01 07:24:15] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3888 ms to find 0 implicit places.
[2024-06-01 07:24:15] [INFO ] Redundant transitions in 48 ms returned []
Running 1524 sub problems to find dead transitions.
[2024-06-01 07:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 1524/1524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 0/1524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61246ms problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 61270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65264 ms. Remains : 634/634 places, 1565/1565 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 28 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:25:17] [INFO ] Invariant cache hit.
[2024-06-01 07:25:17] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:25:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 07:25:17] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 45 ms returned sat
[2024-06-01 07:25:18] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:25:18] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:25:18] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1405 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 243 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1643/1643 transitions.
Applied a total of 0 rules in 36 ms. Remains 719 /719 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
// Phase 1: matrix 1643 rows 719 cols
[2024-06-01 07:25:19] [INFO ] Computed 80 invariants in 16 ms
[2024-06-01 07:25:20] [INFO ] Implicit Places using invariants in 1243 ms returned []
[2024-06-01 07:25:20] [INFO ] Invariant cache hit.
[2024-06-01 07:25:23] [INFO ] Implicit Places using invariants and state equation in 2790 ms returned []
Implicit Place search using SMT with State Equation took 4042 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-06-01 07:25:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
SMT process timed out in 31161ms, After SMT, problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 31186ms
Finished structural reductions in LTL mode , in 1 iterations and 35269 ms. Remains : 719/719 places, 1643/1643 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (460 resets) in 267 ms. (149 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2024-06-01 07:25:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/198 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/456 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/486 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/655 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/661 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 58/719 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1643/2362 variables, 719/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2362 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2362 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2362/2362 variables, and 799 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/198 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/456 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/486 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/655 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/661 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 58/719 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1643/2362 variables, 719/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2362 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2362 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2362 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2362/2362 variables, and 800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 2 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1643/1643 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 1642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 718 transition count 1642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 718 transition count 1641
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 717 transition count 1641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 716 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 715 transition count 1639
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 715 transition count 1639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 714 transition count 1638
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 714 transition count 1638
Free-agglomeration rule applied 39 times.
Iterating global reduction 2 with 39 rules applied. Total rules applied 49 place count 714 transition count 1599
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 96 place count 675 transition count 1591
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 119 place count 675 transition count 1568
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 142 place count 652 transition count 1568
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 652 transition count 1568
Applied a total of 143 rules in 315 ms. Remains 652 /719 variables (removed 67) and now considering 1568/1643 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 652/719 places, 1568/1643 transitions.
RANDOM walk for 40000 steps (682 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (108 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 216323 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 216323 steps, saw 57813 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1568 rows 652 cols
[2024-06-01 07:26:01] [INFO ] Computed 80 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/167 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/394 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/414 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 159/573 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/578 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/652 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1568/2220 variables, 652/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2220 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2220 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 732 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/167 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/394 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/414 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 159/573 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/578 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/652 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1568/2220 variables, 652/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2220 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2220 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2220 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1568/1568 transitions.
Applied a total of 0 rules in 47 ms. Remains 652 /652 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 652/652 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1568/1568 transitions.
Applied a total of 0 rules in 47 ms. Remains 652 /652 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-01 07:26:03] [INFO ] Invariant cache hit.
[2024-06-01 07:26:05] [INFO ] Implicit Places using invariants in 1205 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 444, 445, 515, 517, 522, 523]
[2024-06-01 07:26:05] [INFO ] Actually due to overlaps returned [88, 159, 230, 301, 372, 444, 522, 89, 160, 231, 302, 373, 445, 523, 517]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1214 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/652 places, 1568/1568 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 636 transition count 1567
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 636 transition count 1567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 635 transition count 1566
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 635 transition count 1565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 634 transition count 1565
Applied a total of 6 rules in 164 ms. Remains 634 /637 variables (removed 3) and now considering 1565/1568 (removed 3) transitions.
// Phase 1: matrix 1565 rows 634 cols
[2024-06-01 07:26:05] [INFO ] Computed 65 invariants in 24 ms
[2024-06-01 07:26:06] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2024-06-01 07:26:06] [INFO ] Invariant cache hit.
[2024-06-01 07:26:09] [INFO ] Implicit Places using invariants and state equation in 2891 ms returned []
Implicit Place search using SMT with State Equation took 4163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 634/652 places, 1565/1568 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5589 ms. Remains : 634/652 places, 1565/1568 transitions.
RANDOM walk for 40000 steps (633 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (114 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 204759 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 204759 steps, saw 54531 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 07:26:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2199 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2199/2199 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/201 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/401 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/427 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 145/572 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/577 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 57/634 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1565/2199 variables, 634/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2199 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2199/2199 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 28 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 634/634 places, 1565/1565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 28 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
[2024-06-01 07:26:14] [INFO ] Invariant cache hit.
[2024-06-01 07:26:15] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-06-01 07:26:15] [INFO ] Invariant cache hit.
[2024-06-01 07:26:18] [INFO ] Implicit Places using invariants and state equation in 2914 ms returned []
Implicit Place search using SMT with State Equation took 3865 ms to find 0 implicit places.
[2024-06-01 07:26:18] [INFO ] Redundant transitions in 48 ms returned []
Running 1524 sub problems to find dead transitions.
[2024-06-01 07:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
SMT process timed out in 31347ms, After SMT, problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 31372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35331 ms. Remains : 634/634 places, 1565/1565 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 27 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:26:50] [INFO ] Invariant cache hit.
[2024-06-01 07:26:50] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:26:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 07:26:50] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 48 ms returned sat
[2024-06-01 07:26:51] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:26:51] [INFO ] After 919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:26:51] [INFO ] After 1213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1410 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1090 reset in 508 ms.
Product exploration explored 100000 steps with 1110 reset in 436 ms.
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1643/1643 transitions.
Applied a total of 0 rules in 23 ms. Remains 719 /719 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
// Phase 1: matrix 1643 rows 719 cols
[2024-06-01 07:26:53] [INFO ] Computed 80 invariants in 25 ms
[2024-06-01 07:26:54] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2024-06-01 07:26:54] [INFO ] Invariant cache hit.
[2024-06-01 07:26:58] [INFO ] Implicit Places using invariants and state equation in 3235 ms returned []
Implicit Place search using SMT with State Equation took 4583 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-06-01 07:26:58] [INFO ] Invariant cache hit.
(s555 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
SMT process timed out in 31099ms, After SMT, problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 31127ms
Finished structural reductions in LTL mode , in 1 iterations and 35739 ms. Remains : 719/719 places, 1643/1643 transitions.
Treatment of property ASLink-PT-08b-LTLCardinality-03 finished in 229004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U G((G(X(p1)) U p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 07:27:30] [INFO ] Flatten gal took : 239 ms
[2024-06-01 07:27:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 07:27:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3202 places, 3866 transitions and 11925 arcs took 48 ms.
Total runtime 1373781 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
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="ASLink-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-08b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;