About the Execution of LTSMin+red for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1625.184 | 3600000.00 | 3701320.00 | 6160.50 | ? ? ? 1 ? ? ? ? ? ? ? ? ? ? ? ? | 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.r488-tall-171631132900565.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 DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900565
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717195465195
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:44:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:44:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:44:26] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-31 22:44:26] [INFO ] Transformed 1064 places.
[2024-05-31 22:44:26] [INFO ] Transformed 998 transitions.
[2024-05-31 22:44:26] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 998 rows 1064 cols
[2024-05-31 22:44:26] [INFO ] Invariants computation overflowed in 138 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (335 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 160003 steps (4545 resets) in 278 ms. (573 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 998 rows 1064 cols
[2024-05-31 22:44:27] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-31 22:44:28] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-31 22:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:28] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 426 places in 385 ms of which 54 ms to minimize.
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 468 places in 319 ms of which 6 ms to minimize.
[2024-05-31 22:44:30] [INFO ] Deduced a trap composed of 469 places in 311 ms of which 6 ms to minimize.
[2024-05-31 22:44:30] [INFO ] Deduced a trap composed of 470 places in 307 ms of which 6 ms to minimize.
[2024-05-31 22:44:30] [INFO ] Deduced a trap composed of 435 places in 318 ms of which 6 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 137 places in 298 ms of which 6 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 401 places in 295 ms of which 6 ms to minimize.
[2024-05-31 22:44:31] [INFO ] Deduced a trap composed of 415 places in 293 ms of which 6 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 6 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 421 places in 295 ms of which 6 ms to minimize.
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 435 places in 292 ms of which 6 ms to minimize.
[2024-05-31 22:44:33] [INFO ] Deduced a trap composed of 431 places in 297 ms of which 5 ms to minimize.
[2024-05-31 22:44:33] [INFO ] Deduced a trap composed of 8 places in 348 ms of which 6 ms to minimize.
[2024-05-31 22:44:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 22:44:36] [INFO ] [Real]Absence check using state equation in 2315 ms returned unknown
[2024-05-31 22:44:37] [INFO ] [Real]Absence check using state equation in 1800 ms returned unknown
[2024-05-31 22:44:39] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2024-05-31 22:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:40] [INFO ] [Nat]Absence check using state equation in 1297 ms returned sat
[2024-05-31 22:44:41] [INFO ] Deduced a trap composed of 29 places in 296 ms of which 5 ms to minimize.
[2024-05-31 22:44:41] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 5 ms to minimize.
[2024-05-31 22:44:41] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 6 ms to minimize.
[2024-05-31 22:44:42] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 6 ms to minimize.
[2024-05-31 22:44:42] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 6 ms to minimize.
[2024-05-31 22:44:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1724 ms
[2024-05-31 22:44:42] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-31 22:44:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 22:44:45] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-31 22:44:45] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 3 ms to minimize.
[2024-05-31 22:44:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:45] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2024-05-31 22:44:46] [INFO ] Deduced a trap composed of 414 places in 299 ms of which 6 ms to minimize.
[2024-05-31 22:44:46] [INFO ] Deduced a trap composed of 294 places in 284 ms of which 5 ms to minimize.
[2024-05-31 22:44:46] [INFO ] Deduced a trap composed of 441 places in 291 ms of which 6 ms to minimize.
[2024-05-31 22:44:47] [INFO ] Deduced a trap composed of 420 places in 288 ms of which 7 ms to minimize.
[2024-05-31 22:44:47] [INFO ] Deduced a trap composed of 417 places in 293 ms of which 6 ms to minimize.
[2024-05-31 22:44:47] [INFO ] Deduced a trap composed of 415 places in 294 ms of which 6 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 411 places in 291 ms of which 6 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 6 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 55 places in 286 ms of which 6 ms to minimize.
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 420 places in 287 ms of which 6 ms to minimize.
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 375 places in 280 ms of which 6 ms to minimize.
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 385 places in 283 ms of which 5 ms to minimize.
[2024-05-31 22:44:50] [INFO ] Deduced a trap composed of 427 places in 292 ms of which 5 ms to minimize.
[2024-05-31 22:44:50] [INFO ] Deduced a trap composed of 409 places in 287 ms of which 6 ms to minimize.
[2024-05-31 22:44:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 22:44:51] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2024-05-31 22:44:51] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 5 ms to minimize.
[2024-05-31 22:44:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:52] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 4 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 89 places in 238 ms of which 5 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 79 places in 250 ms of which 5 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 149 places in 240 ms of which 4 ms to minimize.
[2024-05-31 22:44:54] [INFO ] Deduced a trap composed of 103 places in 245 ms of which 4 ms to minimize.
[2024-05-31 22:44:54] [INFO ] Deduced a trap composed of 77 places in 234 ms of which 5 ms to minimize.
[2024-05-31 22:44:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1842 ms
[2024-05-31 22:44:54] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-31 22:44:56] [INFO ] Added : 140 causal constraints over 28 iterations in 2334 ms. Result :unknown
[2024-05-31 22:44:59] [INFO ] [Real]Absence check using state equation in 1955 ms returned unknown
[2024-05-31 22:44:59] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-05-31 22:44:59] [INFO ] Deduced a trap composed of 388 places in 293 ms of which 6 ms to minimize.
[2024-05-31 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:00] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-05-31 22:45:00] [INFO ] Deduced a trap composed of 388 places in 299 ms of which 6 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 6 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 6 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 6 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1900 ms
[2024-05-31 22:45:02] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-31 22:45:05] [INFO ] Added : 165 causal constraints over 33 iterations in 2657 ms. Result :unknown
[2024-05-31 22:45:06] [INFO ] [Real]Absence check using state equation in 1262 ms returned unknown
[2024-05-31 22:45:07] [INFO ] [Real]Absence check using state equation in 1344 ms returned unknown
[2024-05-31 22:45:09] [INFO ] [Real]Absence check using state equation in 1517 ms returned unknown
[2024-05-31 22:45:10] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-05-31 22:45:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:10] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2024-05-31 22:45:10] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 6 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 7 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 6 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1131 ms
[2024-05-31 22:45:11] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-31 22:45:12] [INFO ] Added : 20 causal constraints over 4 iterations in 1269 ms. Result :unknown
[2024-05-31 22:45:14] [INFO ] [Real]Absence check using state equation in 1734 ms returned unknown
[2024-05-31 22:45:15] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 233 places in 170 ms of which 3 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:16] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2024-05-31 22:45:17] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 52 ms.
[2024-05-31 22:45:18] [INFO ] Added : 20 causal constraints over 4 iterations in 1490 ms. Result :unknown
[2024-05-31 22:45:23] [INFO ] [Real]Absence check using state equation in 4901 ms returned unknown
[2024-05-31 22:45:23] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2024-05-31 22:45:24] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-31 22:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:24] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2024-05-31 22:45:24] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-31 22:45:25] [INFO ] Added : 20 causal constraints over 4 iterations in 825 ms. Result :sat
Minimization took 519 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1057 transition count 771
Reduce places removed 225 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 765
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 466 place count 826 transition count 765
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 466 place count 826 transition count 723
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 550 place count 784 transition count 723
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 3 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 902 place count 608 transition count 547
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 974 place count 572 transition count 547
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1051 place count 572 transition count 470
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1128 place count 495 transition count 470
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1208 place count 495 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1209 place count 494 transition count 469
Applied a total of 1209 rules in 297 ms. Remains 494 /1064 variables (removed 570) and now considering 469/998 (removed 529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 494/1064 places, 469/998 transitions.
Found an invariant !
This invariant on transitions {29=1, 40=1, 43=1, 55=2, 65=2, 131=1, 142=1, 259=2, 295=1, 300=1, 417=1, 436=1, 468=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 40=1, 43=1, 131=1, 142=1, 295=1, 300=1, 417=1, 436=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1227 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 469 rows 494 cols
[2024-05-31 22:56:27] [INFO ] Computed 100 invariants in 86 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (123887 resets) in 1004 ms. (995 steps per ms)
BEST_FIRST walk for 16000007 steps (1333591 resets) in 10598 ms. (1509 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:56:38] [INFO ] Invariant cache hit.
[2024-05-31 22:56:38] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-31 22:56:38] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 36 ms returned sat
[2024-05-31 22:56:39] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2024-05-31 22:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:56:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:56:39] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2024-05-31 22:56:40] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2024-05-31 22:56:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:56:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:56:46] [INFO ] [Nat]Added 75 Read/Feed constraints in 5647 ms returned sat
[2024-05-31 22:56:46] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 39 ms.
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 7 ms to minimize.
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:57:04] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 3 ms to minimize.
[2024-05-31 22:57:04] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 7 ms to minimize.
[2024-05-31 22:57:04] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:57:04] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 11 ms to minimize.
[2024-05-31 22:57:05] [INFO ] Deduced a trap composed of 191 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:57:05] [INFO ] Deduced a trap composed of 196 places in 154 ms of which 2 ms to minimize.
[2024-05-31 22:57:05] [INFO ] Deduced a trap composed of 192 places in 157 ms of which 3 ms to minimize.
[2024-05-31 22:57:05] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:57:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2709 ms
[2024-05-31 22:57:05] [INFO ] Added : 384 causal constraints over 77 iterations in 19698 ms. Result :sat
Minimization took 4509 ms.
[2024-05-31 22:57:10] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:10] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 22:57:10] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-31 22:57:10] [INFO ] [Real]Added 75 Read/Feed constraints in 242 ms returned sat
[2024-05-31 22:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:11] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:57:11] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-31 22:57:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 375 ms returned sat
[2024-05-31 22:57:11] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 22:57:12] [INFO ] Added : 54 causal constraints over 11 iterations in 441 ms. Result :sat
Minimization took 1039 ms.
[2024-05-31 22:57:13] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:13] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 38 ms returned sat
[2024-05-31 22:57:13] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-05-31 22:57:13] [INFO ] [Real]Added 75 Read/Feed constraints in 287 ms returned sat
[2024-05-31 22:57:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 412 ms returned sat
[2024-05-31 22:57:14] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 22:57:16] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:57:16] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2024-05-31 22:57:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1713 ms
[2024-05-31 22:57:18] [INFO ] Added : 131 causal constraints over 27 iterations in 3509 ms. Result :sat
Minimization took 1294 ms.
[2024-05-31 22:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:19] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned unsat
[2024-05-31 22:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:19] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 22:57:20] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-05-31 22:57:21] [INFO ] [Real]Added 75 Read/Feed constraints in 1774 ms returned sat
[2024-05-31 22:57:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-31 22:57:21] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:57:22] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-31 22:57:25] [INFO ] [Nat]Added 75 Read/Feed constraints in 3597 ms returned sat
[2024-05-31 22:57:25] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 2 ms to minimize.
[2024-05-31 22:57:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-05-31 22:57:26] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-31 22:57:40] [INFO ] Added : 376 causal constraints over 76 iterations in 14383 ms. Result :sat
Minimization took 3593 ms.
[2024-05-31 22:57:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:44] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:57:44] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-31 22:57:45] [INFO ] [Real]Added 75 Read/Feed constraints in 670 ms returned sat
[2024-05-31 22:57:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:45] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 22:57:45] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-31 22:57:46] [INFO ] [Nat]Added 75 Read/Feed constraints in 1279 ms returned sat
[2024-05-31 22:57:46] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 3 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 631 ms
[2024-05-31 22:57:52] [INFO ] Added : 233 causal constraints over 48 iterations in 5860 ms. Result :sat
Minimization took 2555 ms.
[2024-05-31 22:57:55] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:57:55] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 36 ms returned sat
[2024-05-31 22:57:55] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2024-05-31 22:57:56] [INFO ] [Real]Added 75 Read/Feed constraints in 571 ms returned sat
[2024-05-31 22:57:56] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 22:57:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:57:56] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:57:57] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-05-31 22:57:58] [INFO ] [Nat]Added 75 Read/Feed constraints in 1294 ms returned sat
[2024-05-31 22:57:58] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 32 ms.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-31 22:58:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 736 ms
[2024-05-31 22:58:02] [INFO ] Added : 198 causal constraints over 40 iterations in 4380 ms. Result :sat
Minimization took 1877 ms.
[2024-05-31 22:58:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:04] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 22:58:05] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:58:05] [INFO ] [Real]Added 75 Read/Feed constraints in 163 ms returned sat
[2024-05-31 22:58:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 22:58:05] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 22:58:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 239 ms returned sat
[2024-05-31 22:58:05] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 42 ms.
[2024-05-31 22:58:06] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:58:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2024-05-31 22:58:06] [INFO ] Added : 45 causal constraints over 10 iterations in 671 ms. Result :sat
Minimization took 1020 ms.
[2024-05-31 22:58:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:07] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:58:07] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-31 22:58:08] [INFO ] [Real]Added 75 Read/Feed constraints in 461 ms returned sat
[2024-05-31 22:58:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:08] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 22:58:08] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-31 22:58:09] [INFO ] [Nat]Added 75 Read/Feed constraints in 882 ms returned sat
[2024-05-31 22:58:09] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 32 ms.
[2024-05-31 22:58:12] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 2 ms to minimize.
[2024-05-31 22:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-31 22:58:12] [INFO ] Added : 174 causal constraints over 36 iterations in 2998 ms. Result :sat
Minimization took 1549 ms.
[2024-05-31 22:58:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:14] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-31 22:58:14] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 22:58:14] [INFO ] [Real]Added 75 Read/Feed constraints in 289 ms returned sat
[2024-05-31 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:58:14] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2024-05-31 22:58:14] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-31 22:58:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 949 ms returned sat
[2024-05-31 22:58:15] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 22:58:17] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-05-31 22:58:17] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-05-31 22:58:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 634 ms
[2024-05-31 22:58:18] [INFO ] Added : 125 causal constraints over 26 iterations in 2354 ms. Result :sat
Minimization took 1617 ms.
[2024-05-31 22:58:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:20] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 22:58:20] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-05-31 22:58:20] [INFO ] [Real]Added 75 Read/Feed constraints in 418 ms returned sat
[2024-05-31 22:58:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:58:20] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 22:58:21] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-05-31 22:58:21] [INFO ] [Nat]Added 75 Read/Feed constraints in 658 ms returned sat
[2024-05-31 22:58:21] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 22:58:24] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 2 ms to minimize.
[2024-05-31 22:58:24] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:58:24] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-31 22:58:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 648 ms
[2024-05-31 22:58:24] [INFO ] Added : 146 causal constraints over 30 iterations in 2933 ms. Result :sat
Minimization took 1708 ms.
[2024-05-31 22:58:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:58:26] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:58:26] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-31 22:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:58:26] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 34 ms returned sat
[2024-05-31 22:58:27] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-31 22:58:28] [INFO ] [Nat]Added 75 Read/Feed constraints in 1726 ms returned sat
[2024-05-31 22:58:29] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 42 ms.
[2024-05-31 22:58:35] [INFO ] Added : 256 causal constraints over 52 iterations in 6186 ms. Result :sat
Minimization took 3473 ms.
[2024-05-31 22:58:38] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:38] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:58:39] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-05-31 22:58:39] [INFO ] [Real]Added 75 Read/Feed constraints in 733 ms returned sat
[2024-05-31 22:58:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:58:40] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 22:58:40] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-31 22:58:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 1680 ms returned sat
[2024-05-31 22:58:42] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 2 ms to minimize.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-05-31 22:58:47] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 895 ms
[2024-05-31 22:58:48] [INFO ] Added : 241 causal constraints over 49 iterations in 6082 ms. Result :sat
Minimization took 2339 ms.
[2024-05-31 22:58:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:58:50] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 22:58:50] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2024-05-31 22:58:52] [INFO ] [Real]Added 75 Read/Feed constraints in 1456 ms returned sat
[2024-05-31 22:58:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:58:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:58:52] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 22:58:52] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-31 22:58:54] [INFO ] [Nat]Added 75 Read/Feed constraints in 2150 ms returned sat
[2024-05-31 22:58:54] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 22:58:59] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
[2024-05-31 22:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-31 22:59:00] [INFO ] Added : 214 causal constraints over 44 iterations in 5198 ms. Result :sat
Minimization took 2409 ms.
[2024-05-31 22:59:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:59:02] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:59:02] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-31 22:59:03] [INFO ] [Real]Added 75 Read/Feed constraints in 422 ms returned sat
[2024-05-31 22:59:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:59:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:59:03] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:59:03] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-31 22:59:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 661 ms returned sat
[2024-05-31 22:59:04] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 22:59:04] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 26 ms.
[2024-05-31 22:59:06] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-31 22:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-31 22:59:06] [INFO ] Added : 113 causal constraints over 23 iterations in 1645 ms. Result :sat
Minimization took 1296 ms.
[2024-05-31 22:59:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:59:07] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 22:59:07] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-31 22:59:07] [INFO ] [Real]Added 75 Read/Feed constraints in 166 ms returned sat
[2024-05-31 22:59:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:59:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:59:08] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2024-05-31 22:59:08] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-31 22:59:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 268 ms returned sat
[2024-05-31 22:59:08] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 22:59:09] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 3 ms to minimize.
[2024-05-31 22:59:09] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-31 22:59:09] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 2 ms to minimize.
[2024-05-31 22:59:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 701 ms
[2024-05-31 22:59:09] [INFO ] Added : 50 causal constraints over 10 iterations in 1127 ms. Result :sat
Minimization took 1029 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA DoubleExponent-PT-020-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 469/469 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 494 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 493 transition count 468
Applied a total of 2 rules in 37 ms. Remains 493 /494 variables (removed 1) and now considering 468/469 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 493/494 places, 468/469 transitions.
Found an invariant !
This invariant on transitions {29=1, 40=1, 43=1, 55=2, 65=2, 129=1, 140=1, 257=2, 293=1, 298=1, 415=1, 434=1, 466=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 40=1, 43=1, 129=1, 140=1, 293=1, 298=1, 415=1, 434=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1078 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 468 rows 493 cols
[2024-05-31 23:01:35] [INFO ] Computed 100 invariants in 78 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (107703 resets) in 950 ms. (1051 steps per ms)
BEST_FIRST walk for 15000009 steps (1130196 resets) in 10615 ms. (1412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 23:01:47] [INFO ] Invariant cache hit.
[2024-05-31 23:01:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:01:47] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:01:49] [INFO ] [Real]Absence check using state equation in 1925 ms returned sat
[2024-05-31 23:01:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:01:49] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-31 23:01:51] [INFO ] [Nat]Absence check using state equation in 1972 ms returned sat
[2024-05-31 23:01:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:01:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:02:00] [INFO ] [Nat]Added 75 Read/Feed constraints in 8785 ms returned sat
[2024-05-31 23:02:00] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-31 23:02:16] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:02:16] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-31 23:02:16] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-31 23:02:16] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-31 23:02:16] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:02:16] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:02:18] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:02:18] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 1 ms to minimize.
[2024-05-31 23:02:18] [INFO ] Deduced a trap composed of 118 places in 93 ms of which 1 ms to minimize.
[2024-05-31 23:02:18] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 1 ms to minimize.
[2024-05-31 23:02:18] [INFO ] Deduced a trap composed of 126 places in 94 ms of which 1 ms to minimize.
[2024-05-31 23:02:18] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 1 ms to minimize.
[2024-05-31 23:02:19] [INFO ] Deduced a trap composed of 117 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:02:19] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-31 23:02:19] [INFO ] Deduced a trap composed of 129 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:02:19] [INFO ] Deduced a trap composed of 130 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:02:19] [INFO ] Deduced a trap composed of 140 places in 91 ms of which 2 ms to minimize.
[2024-05-31 23:02:19] [INFO ] Deduced a trap composed of 141 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 1 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 143 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 139 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 146 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 145 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:02:21] [INFO ] Deduced a trap composed of 137 places in 93 ms of which 1 ms to minimize.
[2024-05-31 23:02:21] [INFO ] Deduced a trap composed of 137 places in 89 ms of which 1 ms to minimize.
[2024-05-31 23:02:21] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5661 ms
[2024-05-31 23:02:21] [INFO ] Added : 371 causal constraints over 75 iterations in 21229 ms. Result :sat
Minimization took 4501 ms.
[2024-05-31 23:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:02:26] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-31 23:02:26] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-05-31 23:02:26] [INFO ] [Real]Added 75 Read/Feed constraints in 235 ms returned sat
[2024-05-31 23:02:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:02:26] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 23:02:27] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2024-05-31 23:02:27] [INFO ] [Nat]Added 75 Read/Feed constraints in 268 ms returned sat
[2024-05-31 23:02:27] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 23:02:28] [INFO ] Added : 91 causal constraints over 19 iterations in 1015 ms. Result :sat
Minimization took 1168 ms.
[2024-05-31 23:02:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:02:29] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 23:02:29] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-31 23:02:30] [INFO ] [Real]Added 75 Read/Feed constraints in 343 ms returned sat
[2024-05-31 23:02:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:02:30] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 23:02:30] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-31 23:02:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 645 ms returned sat
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 3 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 2 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2024-05-31 23:02:31] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-31 23:02:35] [INFO ] Added : 173 causal constraints over 35 iterations in 3798 ms. Result :sat
Minimization took 1996 ms.
[2024-05-31 23:02:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:02:37] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:02:37] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-31 23:02:39] [INFO ] [Real]Added 75 Read/Feed constraints in 1374 ms returned sat
[2024-05-31 23:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:02:39] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:02:39] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-05-31 23:02:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 3196 ms returned sat
[2024-05-31 23:02:43] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-31 23:02:43] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-31 23:02:52] [INFO ] Added : 335 causal constraints over 67 iterations in 9657 ms. Result :sat
Minimization took 3568 ms.
[2024-05-31 23:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:02:56] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 23:02:56] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-05-31 23:02:57] [INFO ] [Real]Added 75 Read/Feed constraints in 1046 ms returned sat
[2024-05-31 23:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:02:57] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 23:02:58] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2024-05-31 23:02:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 1653 ms returned sat
[2024-05-31 23:02:59] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-31 23:03:06] [INFO ] Added : 266 causal constraints over 54 iterations in 6581 ms. Result :sat
Minimization took 1905 ms.
[2024-05-31 23:03:08] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:08] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:03:08] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2024-05-31 23:03:09] [INFO ] [Real]Added 75 Read/Feed constraints in 541 ms returned sat
[2024-05-31 23:03:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:09] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-31 23:03:09] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-31 23:03:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 1373 ms returned sat
[2024-05-31 23:03:11] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 32 ms.
[2024-05-31 23:03:13] [INFO ] Added : 157 causal constraints over 32 iterations in 2136 ms. Result :sat
Minimization took 1512 ms.
[2024-05-31 23:03:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:15] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 23:03:15] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-31 23:03:15] [INFO ] [Real]Added 75 Read/Feed constraints in 160 ms returned sat
[2024-05-31 23:03:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:03:15] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 23:03:15] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-31 23:03:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 326 ms returned sat
[2024-05-31 23:03:16] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 23:03:16] [INFO ] Added : 43 causal constraints over 9 iterations in 414 ms. Result :sat
Minimization took 1100 ms.
[2024-05-31 23:03:17] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:17] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:03:17] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-31 23:03:18] [INFO ] [Real]Added 75 Read/Feed constraints in 453 ms returned sat
[2024-05-31 23:03:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:03:18] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 38 ms returned sat
[2024-05-31 23:03:18] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2024-05-31 23:03:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 892 ms returned sat
[2024-05-31 23:03:19] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 23:03:22] [INFO ] Added : 174 causal constraints over 35 iterations in 2872 ms. Result :sat
Minimization took 1444 ms.
[2024-05-31 23:03:24] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:24] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 35 ms returned sat
[2024-05-31 23:03:24] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-05-31 23:03:24] [INFO ] [Real]Added 75 Read/Feed constraints in 272 ms returned sat
[2024-05-31 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:03:24] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 23:03:24] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-31 23:03:25] [INFO ] [Nat]Added 75 Read/Feed constraints in 826 ms returned sat
[2024-05-31 23:03:25] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-31 23:03:27] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 23:03:27] [INFO ] Added : 102 causal constraints over 21 iterations in 1662 ms. Result :sat
Minimization took 1783 ms.
[2024-05-31 23:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:03:29] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 35 ms returned sat
[2024-05-31 23:03:29] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-31 23:03:30] [INFO ] [Real]Added 75 Read/Feed constraints in 392 ms returned sat
[2024-05-31 23:03:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:30] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 23:03:30] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-05-31 23:03:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 948 ms returned sat
[2024-05-31 23:03:31] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 32 ms.
[2024-05-31 23:03:34] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:03:34] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
[2024-05-31 23:03:35] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-05-31 23:03:35] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:03:35] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:03:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1002 ms
[2024-05-31 23:03:35] [INFO ] Added : 184 causal constraints over 37 iterations in 4246 ms. Result :sat
Minimization took 1631 ms.
[2024-05-31 23:03:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:37] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:03:37] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-31 23:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:37] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-31 23:03:38] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2024-05-31 23:03:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:03:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 4531 ms returned sat
[2024-05-31 23:03:42] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-31 23:03:48] [INFO ] Added : 225 causal constraints over 45 iterations in 5823 ms. Result :sat
Minimization took 2490 ms.
[2024-05-31 23:03:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:03:51] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:03:51] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-31 23:03:51] [INFO ] [Real]Added 75 Read/Feed constraints in 516 ms returned sat
[2024-05-31 23:03:51] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 23:03:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:52] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-31 23:03:52] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2024-05-31 23:03:54] [INFO ] [Nat]Added 75 Read/Feed constraints in 1716 ms returned sat
[2024-05-31 23:03:54] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 23:03:56] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 2 ms to minimize.
[2024-05-31 23:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 23:03:56] [INFO ] Added : 161 causal constraints over 33 iterations in 2527 ms. Result :sat
Minimization took 1633 ms.
[2024-05-31 23:03:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:03:58] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 23:03:58] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-31 23:03:59] [INFO ] [Real]Added 75 Read/Feed constraints in 1000 ms returned sat
[2024-05-31 23:03:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2024-05-31 23:04:00] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-31 23:04:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 2011 ms returned sat
[2024-05-31 23:04:02] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-31 23:04:18] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-31 23:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2024-05-31 23:04:18] [INFO ] Added : 364 causal constraints over 74 iterations in 16898 ms. Result :sat
Minimization took 3354 ms.
[2024-05-31 23:04:22] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:04:22] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-31 23:04:22] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-31 23:04:22] [INFO ] [Real]Added 75 Read/Feed constraints in 163 ms returned sat
[2024-05-31 23:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:04:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 23:04:22] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:04:23] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-31 23:04:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 990 ms returned sat
[2024-05-31 23:04:24] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 31 ms.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 23:04:25] [INFO ] Added : 81 causal constraints over 17 iterations in 1002 ms. Result :sat
Minimization took 1507 ms.
[2024-05-31 23:04:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:04:26] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:04:27] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-31 23:04:27] [INFO ] [Real]Added 75 Read/Feed constraints in 147 ms returned sat
[2024-05-31 23:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:04:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 23:04:27] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-31 23:04:27] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2024-05-31 23:04:27] [INFO ] [Nat]Added 75 Read/Feed constraints in 165 ms returned sat
[2024-05-31 23:04:27] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-31 23:04:28] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-05-31 23:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-31 23:04:28] [INFO ] Added : 77 causal constraints over 16 iterations in 1150 ms. Result :sat
Minimization took 1777 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 468/468 transitions.
Applied a total of 0 rules in 16 ms. Remains 493 /493 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 493/493 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 468/468 transitions.
Applied a total of 0 rules in 15 ms. Remains 493 /493 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-31 23:06:52] [INFO ] Invariant cache hit.
[2024-05-31 23:06:53] [INFO ] Implicit Places using invariants in 808 ms returned [14, 19, 47, 75, 80, 103, 108, 157, 162, 163, 190, 211, 218, 225, 239, 244, 267, 273, 297, 302, 323, 329, 350, 355, 376, 382, 403, 405, 409, 429, 436, 458, 463, 467, 485, 491]
[2024-05-31 23:06:53] [INFO ] Actually due to overlaps returned [163, 225, 80, 75, 157, 162]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 814 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 487/493 places, 468/468 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 465
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 484 transition count 465
Applied a total of 6 rules in 28 ms. Remains 484 /487 variables (removed 3) and now considering 465/468 (removed 3) transitions.
// Phase 1: matrix 465 rows 484 cols
[2024-05-31 23:06:53] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:06:54] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 465 rows 484 cols
[2024-05-31 23:06:54] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:06:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:07:02] [INFO ] Implicit Places using invariants and state equation in 8146 ms returned [14, 19, 47, 100, 105, 183, 204, 211, 230, 235, 258, 264, 288, 293, 314, 320, 341, 346, 367, 373, 394, 396, 400, 420, 427, 449, 454, 458, 476, 482]
[2024-05-31 23:07:02] [INFO ] Actually due to overlaps returned [183, 458, 100, 396, 105]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 8480 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 479/493 places, 465/468 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 479 transition count 463
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 477 transition count 463
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 477 transition count 463
Applied a total of 5 rules in 49 ms. Remains 477 /479 variables (removed 2) and now considering 463/465 (removed 2) transitions.
// Phase 1: matrix 463 rows 477 cols
[2024-05-31 23:07:02] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:07:02] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 463 rows 477 cols
[2024-05-31 23:07:02] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:07:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:07:09] [INFO ] Implicit Places using invariants and state equation in 6686 ms returned [14, 19, 47, 200, 207, 226, 231, 254, 260, 284, 289, 310, 316, 337, 342, 363, 369, 390, 395, 415, 422, 444, 449, 469, 475]
[2024-05-31 23:07:09] [INFO ] Actually due to overlaps returned [207, 47, 200]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 6991 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 474/493 places, 463/468 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 463
Applied a total of 1 rules in 41 ms. Remains 474 /474 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 474 cols
[2024-05-31 23:07:09] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:07:09] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 463 rows 474 cols
[2024-05-31 23:07:09] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:07:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:07:16] [INFO ] Implicit Places using invariants and state equation in 6981 ms returned [14, 19, 223, 228, 251, 257, 281, 286, 307, 313, 334, 339, 360, 366, 387, 392, 412, 419, 441, 446, 466, 472]
[2024-05-31 23:07:16] [INFO ] Actually due to overlaps returned [228, 223]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7279 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 472/493 places, 463/468 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 462
Applied a total of 2 rules in 27 ms. Remains 471 /472 variables (removed 1) and now considering 462/463 (removed 1) transitions.
// Phase 1: matrix 462 rows 471 cols
[2024-05-31 23:07:16] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:07:16] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 462 rows 471 cols
[2024-05-31 23:07:16] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:07:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:07:23] [INFO ] Implicit Places using invariants and state equation in 6600 ms returned [14, 19, 248, 254, 278, 283, 304, 310, 331, 336, 357, 363, 384, 389, 409, 416, 438, 443, 463, 469]
[2024-05-31 23:07:23] [INFO ] Actually due to overlaps returned [254, 248]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6904 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 469/493 places, 462/468 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 461
Applied a total of 2 rules in 26 ms. Remains 468 /469 variables (removed 1) and now considering 461/462 (removed 1) transitions.
// Phase 1: matrix 461 rows 468 cols
[2024-05-31 23:07:23] [INFO ] Computed 82 invariants in 56 ms
[2024-05-31 23:07:24] [INFO ] Implicit Places using invariants in 569 ms returned [14, 19, 275, 280, 301, 307, 328, 333, 354, 360, 381, 386, 406, 413, 435, 440, 460, 466]
[2024-05-31 23:07:24] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 571 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 466/493 places, 461/468 transitions.
Applied a total of 0 rules in 12 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 31244 ms. Remains : 466/493 places, 461/468 transitions.
Found an invariant !
This invariant on transitions {26=1, 39=1, 119=1, 270=1, 275=1, 392=1, 411=1, 449=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 39=1, 119=1, 270=1, 275=1, 392=1, 411=1, 449=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1246 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 461 rows 466 cols
[2024-05-31 23:07:26] [INFO ] Invariants computation overflowed in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (125286 resets) in 906 ms. (1102 steps per ms)
BEST_FIRST walk for 15000004 steps (1251045 resets) in 9704 ms. (1545 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 461 rows 466 cols
[2024-05-31 23:07:36] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:07:37] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-31 23:07:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:07:37] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2024-05-31 23:07:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:07:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:07:47] [INFO ] [Nat]Added 75 Read/Feed constraints in 9046 ms returned unknown
[2024-05-31 23:07:47] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 23:07:48] [INFO ] [Real]Added 75 Read/Feed constraints in 767 ms returned sat
[2024-05-31 23:07:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:07:48] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2024-05-31 23:07:49] [INFO ] [Nat]Added 75 Read/Feed constraints in 1112 ms returned sat
[2024-05-31 23:07:49] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 27 ms.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 127 places in 181 ms of which 3 ms to minimize.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 3 ms to minimize.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-31 23:07:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 665 ms
[2024-05-31 23:07:52] [INFO ] Added : 106 causal constraints over 22 iterations in 2204 ms. Result :sat
Minimization took 1532 ms.
[2024-05-31 23:07:53] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-31 23:07:55] [INFO ] [Real]Added 75 Read/Feed constraints in 1180 ms returned sat
[2024-05-31 23:07:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:07:55] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2024-05-31 23:07:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 1134 ms returned sat
[2024-05-31 23:07:56] [INFO ] Deduced a trap composed of 133 places in 172 ms of which 4 ms to minimize.
[2024-05-31 23:07:57] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:07:57] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:07:57] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 2 ms to minimize.
[2024-05-31 23:07:57] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:07:58] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:07:58] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:07:58] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 3 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 127 places in 165 ms of which 2 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 2 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 2 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 3 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 2 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 150 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 2 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:04] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:04] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 2 ms to minimize.
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 3 ms to minimize.
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 149 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:08:06] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 2 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 3 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 113 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 153 places in 180 ms of which 2 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 147 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 2 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 149 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 2 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:14] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-05-31 23:08:14] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:08:14] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-31 23:08:14] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:14] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:08:15] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 147 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 2 ms to minimize.
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 2 ms to minimize.
[2024-05-31 23:08:18] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 3 ms to minimize.
[2024-05-31 23:08:20] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:20] [INFO ] Deduced a trap composed of 149 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 2 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 2 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 2 ms to minimize.
[2024-05-31 23:08:23] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:08:23] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 2 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 148 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 2 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 2 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 2 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 2 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 2 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:30] [INFO ] Deduced a trap composed of 155 places in 173 ms of which 2 ms to minimize.
[2024-05-31 23:08:30] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 153 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 5 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 148 places in 163 ms of which 3 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 2 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Trap strengthening (SAT) tested/added 123/122 trap constraints in 37957 ms
[2024-05-31 23:08:34] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 25 ms.
[2024-05-31 23:08:40] [INFO ] Added : 135 causal constraints over 27 iterations in 5555 ms. Result :unknown
[2024-05-31 23:08:40] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-31 23:08:41] [INFO ] [Real]Added 75 Read/Feed constraints in 956 ms returned sat
[2024-05-31 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:08:41] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-05-31 23:08:43] [INFO ] [Nat]Added 75 Read/Feed constraints in 2015 ms returned sat
[2024-05-31 23:08:43] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 30 ms.
[2024-05-31 23:08:59] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-31 23:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-31 23:08:59] [INFO ] Added : 393 causal constraints over 79 iterations in 15832 ms. Result :sat
Minimization took 4503 ms.
[2024-05-31 23:09:04] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-31 23:09:05] [INFO ] [Real]Added 75 Read/Feed constraints in 768 ms returned sat
[2024-05-31 23:09:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:09:05] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-31 23:09:07] [INFO ] [Nat]Added 75 Read/Feed constraints in 1756 ms returned sat
[2024-05-31 23:09:07] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 28 ms.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 3 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1706 ms
[2024-05-31 23:09:18] [INFO ] Added : 350 causal constraints over 71 iterations in 11487 ms. Result :sat
Minimization took 2595 ms.
[2024-05-31 23:09:22] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2024-05-31 23:09:22] [INFO ] [Real]Added 75 Read/Feed constraints in 433 ms returned sat
[2024-05-31 23:09:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:09:23] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2024-05-31 23:09:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 962 ms returned sat
[2024-05-31 23:09:24] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 27 ms.
[2024-05-31 23:09:26] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-05-31 23:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2024-05-31 23:09:26] [INFO ] Added : 180 causal constraints over 37 iterations in 2603 ms. Result :sat
Minimization took 1010 ms.
[2024-05-31 23:09:27] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-31 23:09:28] [INFO ] [Real]Added 75 Read/Feed constraints in 1002 ms returned sat
[2024-05-31 23:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:09:29] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:09:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 188 ms returned sat
[2024-05-31 23:09:29] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 3 ms to minimize.
[2024-05-31 23:09:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 23:09:29] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 28 ms.
[2024-05-31 23:09:29] [INFO ] Added : 41 causal constraints over 9 iterations in 351 ms. Result :sat
Minimization took 319 ms.
[2024-05-31 23:09:30] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-31 23:09:31] [INFO ] [Real]Added 75 Read/Feed constraints in 1308 ms returned sat
[2024-05-31 23:09:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:09:32] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-31 23:09:32] [INFO ] [Nat]Added 75 Read/Feed constraints in 781 ms returned sat
[2024-05-31 23:09:32] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 36 ms.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 3 ms to minimize.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 2 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 2 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 159 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 160 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:09:40] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:09:40] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:09:40] [INFO ] Deduced a trap composed of 135 places in 168 ms of which 2 ms to minimize.
[2024-05-31 23:09:40] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:09:41] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
[2024-05-31 23:09:41] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 2 ms to minimize.
[2024-05-31 23:09:41] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 2 ms to minimize.
[2024-05-31 23:09:41] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 3 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 157 places in 163 ms of which 2 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 2 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:09:44] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:09:44] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:09:44] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:09:44] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 2 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 2 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:09:46] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:09:46] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:09:46] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 2 ms to minimize.
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 3 ms to minimize.
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:09:48] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:09:48] [INFO ] Deduced a trap composed of 151 places in 163 ms of which 3 ms to minimize.
[2024-05-31 23:09:48] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:09:48] [INFO ] Deduced a trap composed of 128 places in 165 ms of which 2 ms to minimize.
[2024-05-31 23:09:49] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 3 ms to minimize.
[2024-05-31 23:09:49] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 2 ms to minimize.
[2024-05-31 23:09:49] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 3 ms to minimize.
[2024-05-31 23:09:49] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 3 ms to minimize.
[2024-05-31 23:09:49] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:09:50] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 3 ms to minimize.
[2024-05-31 23:09:50] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 3 ms to minimize.
[2024-05-31 23:09:50] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 4 ms to minimize.
[2024-05-31 23:09:50] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 12780 ms
[2024-05-31 23:09:50] [INFO ] Added : 232 causal constraints over 47 iterations in 17891 ms. Result :sat
Minimization took 3477 ms.
[2024-05-31 23:09:54] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2024-05-31 23:09:55] [INFO ] [Real]Added 75 Read/Feed constraints in 635 ms returned sat
[2024-05-31 23:09:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:09:55] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-05-31 23:09:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 987 ms returned sat
[2024-05-31 23:09:56] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 28 ms.
[2024-05-31 23:10:03] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-31 23:10:03] [INFO ] Added : 204 causal constraints over 42 iterations in 6603 ms. Result :sat
Minimization took 1238 ms.
[2024-05-31 23:10:05] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-05-31 23:10:05] [INFO ] [Real]Added 75 Read/Feed constraints in 316 ms returned sat
[2024-05-31 23:10:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:06] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-05-31 23:10:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 757 ms returned sat
[2024-05-31 23:10:06] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 28 ms.
[2024-05-31 23:10:14] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:10:14] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:10:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2024-05-31 23:10:14] [INFO ] Added : 210 causal constraints over 43 iterations in 7521 ms. Result :sat
Minimization took 1779 ms.
[2024-05-31 23:10:16] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-05-31 23:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:16] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-05-31 23:10:21] [INFO ] [Nat]Added 75 Read/Feed constraints in 4399 ms returned sat
[2024-05-31 23:10:21] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 27 ms.
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 149 places in 153 ms of which 3 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 3 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-05-31 23:10:36] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-31 23:10:36] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:10:36] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-31 23:10:36] [INFO ] Deduced a trap composed of 164 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 2 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 170 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 160 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 163 places in 140 ms of which 3 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 172 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 176 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 163 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 181 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 169 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 174 places in 134 ms of which 2 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 3 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 179 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 157 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 183 places in 135 ms of which 2 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Deduced a trap composed of 152 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 8098 ms
[2024-05-31 23:10:42] [INFO ] Added : 272 causal constraints over 55 iterations in 21561 ms.(timeout) Result :sat
Minimization took 4507 ms.
[2024-05-31 23:10:47] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-31 23:10:48] [INFO ] [Real]Added 75 Read/Feed constraints in 545 ms returned sat
[2024-05-31 23:10:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:48] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2024-05-31 23:10:49] [INFO ] [Nat]Added 75 Read/Feed constraints in 1088 ms returned sat
[2024-05-31 23:10:49] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 40 ms.
[2024-05-31 23:10:51] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:10:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2024-05-31 23:10:52] [INFO ] Added : 139 causal constraints over 28 iterations in 2240 ms. Result :sat
Minimization took 973 ms.
[2024-05-31 23:10:53] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-31 23:10:54] [INFO ] [Real]Added 75 Read/Feed constraints in 929 ms returned sat
[2024-05-31 23:10:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:54] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-31 23:10:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 1787 ms returned sat
[2024-05-31 23:10:56] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 26 ms.
[2024-05-31 23:11:10] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:11:10] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 3 ms to minimize.
[2024-05-31 23:11:10] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 3 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2408 ms
[2024-05-31 23:11:12] [INFO ] Added : 364 causal constraints over 73 iterations in 16515 ms. Result :sat
Minimization took 4501 ms.
[2024-05-31 23:11:17] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-31 23:11:18] [INFO ] [Real]Added 75 Read/Feed constraints in 407 ms returned sat
[2024-05-31 23:11:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:18] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-31 23:11:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 645 ms returned sat
[2024-05-31 23:11:19] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 29 ms.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2024-05-31 23:11:23] [INFO ] Added : 158 causal constraints over 33 iterations in 4291 ms. Result :sat
Minimization took 1350 ms.
[2024-05-31 23:11:25] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2024-05-31 23:11:25] [INFO ] [Real]Added 75 Read/Feed constraints in 788 ms returned sat
[2024-05-31 23:11:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:26] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-05-31 23:11:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 177 ms returned sat
[2024-05-31 23:11:26] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 26 ms.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 798 ms
[2024-05-31 23:11:28] [INFO ] Added : 79 causal constraints over 18 iterations in 1942 ms. Result :sat
Minimization took 736 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Applied a total of 0 rules in 10 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 466/466 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Applied a total of 0 rules in 9 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 466 cols
[2024-05-31 23:12:38] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:12:38] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 461 rows 466 cols
[2024-05-31 23:12:38] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-31 23:12:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:12:44] [INFO ] Implicit Places using invariants and state equation in 5883 ms returned [14, 19, 299, 305, 326, 331, 352, 358, 379, 384, 404, 411, 433, 438, 458, 464]
[2024-05-31 23:12:44] [INFO ] Actually due to overlaps returned [305, 299]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6166 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/466 places, 461/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 460
Applied a total of 2 rules in 22 ms. Remains 463 /464 variables (removed 1) and now considering 460/461 (removed 1) transitions.
// Phase 1: matrix 460 rows 463 cols
[2024-05-31 23:12:44] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:12:45] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 460 rows 463 cols
[2024-05-31 23:12:45] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-31 23:12:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:12:53] [INFO ] Implicit Places using invariants and state equation in 8387 ms returned [14, 19, 323, 328, 349, 355, 376, 381, 401, 408, 430, 435, 455, 461]
[2024-05-31 23:12:53] [INFO ] Actually due to overlaps returned [328, 323]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8663 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/466 places, 460/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 459
Applied a total of 2 rules in 18 ms. Remains 460 /461 variables (removed 1) and now considering 459/460 (removed 1) transitions.
// Phase 1: matrix 459 rows 460 cols
[2024-05-31 23:12:53] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:12:53] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 459 rows 460 cols
[2024-05-31 23:12:53] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 23:12:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:13:01] [INFO ] Implicit Places using invariants and state equation in 7546 ms returned [14, 19, 346, 352, 373, 378, 398, 405, 427, 432, 452, 458]
[2024-05-31 23:13:01] [INFO ] Actually due to overlaps returned [352, 346]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7819 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 458/466 places, 459/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 458
Applied a total of 2 rules in 18 ms. Remains 457 /458 variables (removed 1) and now considering 458/459 (removed 1) transitions.
// Phase 1: matrix 458 rows 457 cols
[2024-05-31 23:13:01] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:13:01] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 458 rows 457 cols
[2024-05-31 23:13:01] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:13:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:13:29] [INFO ] Implicit Places using invariants and state equation in 28252 ms returned [14, 19, 370, 375, 395, 402, 424, 429, 449, 455]
[2024-05-31 23:13:29] [INFO ] Actually due to overlaps returned [375, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 28527 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 455/466 places, 458/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 457
Applied a total of 2 rules in 16 ms. Remains 454 /455 variables (removed 1) and now considering 457/458 (removed 1) transitions.
// Phase 1: matrix 457 rows 454 cols
[2024-05-31 23:13:29] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:13:30] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 457 rows 454 cols
[2024-05-31 23:13:30] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:13:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:13:36] [INFO ] Implicit Places using invariants and state equation in 6919 ms returned [14, 19, 392, 399, 421, 426, 446, 452]
[2024-05-31 23:13:36] [INFO ] Actually due to overlaps returned [399, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7177 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/466 places, 457/461 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 457
Applied a total of 1 rules in 18 ms. Remains 452 /452 variables (removed 0) and now considering 457/457 (removed 0) transitions.
// Phase 1: matrix 457 rows 452 cols
[2024-05-31 23:13:37] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:13:37] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 457 rows 452 cols
[2024-05-31 23:13:37] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:13:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:13:43] [INFO ] Implicit Places using invariants and state equation in 6174 ms returned [14, 19, 419, 424, 444, 450]
[2024-05-31 23:13:43] [INFO ] Actually due to overlaps returned [424, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6442 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 450/466 places, 457/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 456
Applied a total of 2 rules in 17 ms. Remains 449 /450 variables (removed 1) and now considering 456/457 (removed 1) transitions.
// Phase 1: matrix 456 rows 449 cols
[2024-05-31 23:13:43] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:13:43] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 456 rows 449 cols
[2024-05-31 23:13:43] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 23:13:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:13:56] [INFO ] Implicit Places using invariants and state equation in 12290 ms returned [14, 19, 441, 447]
[2024-05-31 23:13:56] [INFO ] Actually due to overlaps returned [441, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12551 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 447/466 places, 456/461 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 446 transition count 455
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 446 transition count 455
Applied a total of 3 rules in 22 ms. Remains 446 /447 variables (removed 1) and now considering 455/456 (removed 1) transitions.
// Phase 1: matrix 455 rows 446 cols
[2024-05-31 23:13:56] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:13:56] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 455 rows 446 cols
[2024-05-31 23:13:56] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-31 23:13:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:14:02] [INFO ] Implicit Places using invariants and state equation in 5877 ms returned [444]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6117 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 445/466 places, 455/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 454
Applied a total of 2 rules in 17 ms. Remains 444 /445 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:14:02] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-31 23:14:02] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:14:02] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:14:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:14:06] [INFO ] Implicit Places using invariants and state equation in 4200 ms returned []
Implicit Place search using SMT with State Equation took 4447 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 444/466 places, 454/461 transitions.
Finished structural reductions in REACHABILITY mode , in 9 iterations and 88069 ms. Remains : 444/466 places, 454/461 transitions.
Found an invariant !
This invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:24:07] [INFO ] Invariants computation overflowed in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (125429 resets) in 909 ms. (1098 steps per ms)
BEST_FIRST walk for 15000007 steps (1249156 resets) in 9629 ms. (1557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:24:17] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:24:19] [INFO ] [Real]Absence check using state equation in 2238 ms returned sat
[2024-05-31 23:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:24:22] [INFO ] [Nat]Absence check using state equation in 2545 ms returned sat
[2024-05-31 23:24:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:24:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:24:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 7198 ms returned sat
[2024-05-31 23:24:29] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:24:30] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:24:30] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:24:30] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:24:30] [INFO ] Deduced a trap composed of 147 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:24:31] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:24:31] [INFO ] Deduced a trap composed of 147 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:24:31] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:24:32] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-31 23:24:32] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-05-31 23:24:32] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:32] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 3 ms to minimize.
[2024-05-31 23:24:33] [INFO ] Deduced a trap composed of 151 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:24:33] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
[2024-05-31 23:24:33] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:24:33] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:34] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 2 ms to minimize.
[2024-05-31 23:24:34] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
[2024-05-31 23:24:34] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:34] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:24:35] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:24:35] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:24:35] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:35] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:24:36] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:36] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:36] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 3 ms to minimize.
[2024-05-31 23:24:37] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:37] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:24:37] [INFO ] Deduced a trap composed of 154 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:24:38] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:24:38] [INFO ] Deduced a trap composed of 155 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:24:38] [INFO ] Deduced a trap composed of 140 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:39] [INFO ] Deduced a trap composed of 155 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:24:39] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 4 ms to minimize.
[2024-05-31 23:24:40] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:24:40] [INFO ] Deduced a trap composed of 153 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:24:40] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 3 ms to minimize.
[2024-05-31 23:24:41] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:24:41] [INFO ] Deduced a trap composed of 160 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:24:41] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 150 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 3 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-05-31 23:24:44] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-31 23:24:44] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 3 ms to minimize.
[2024-05-31 23:24:44] [INFO ] Deduced a trap composed of 157 places in 134 ms of which 2 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 151 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 2 ms to minimize.
[2024-05-31 23:24:45] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:24:46] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:24:46] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-31 23:24:47] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:24:47] [INFO ] Deduced a trap composed of 157 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:24:47] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:24:48] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:24:48] [INFO ] Deduced a trap composed of 154 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:24:49] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 2 ms to minimize.
[2024-05-31 23:24:49] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 2 ms to minimize.
[2024-05-31 23:24:50] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 2 ms to minimize.
[2024-05-31 23:24:50] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-05-31 23:24:50] [INFO ] Deduced a trap composed of 151 places in 132 ms of which 3 ms to minimize.
[2024-05-31 23:24:50] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 21145 ms
[2024-05-31 23:24:50] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:25:05] [INFO ] Added : 320 causal constraints over 64 iterations in 14063 ms. Result :unknown
[2024-05-31 23:25:05] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-31 23:25:05] [INFO ] [Real]Added 75 Read/Feed constraints in 253 ms returned sat
[2024-05-31 23:25:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:06] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2024-05-31 23:25:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 174 ms returned sat
[2024-05-31 23:25:06] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-31 23:25:07] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-31 23:25:07] [INFO ] Added : 77 causal constraints over 16 iterations in 937 ms. Result :sat
Minimization took 829 ms.
[2024-05-31 23:25:08] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-31 23:25:09] [INFO ] [Real]Added 75 Read/Feed constraints in 806 ms returned sat
[2024-05-31 23:25:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:10] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2024-05-31 23:25:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 1015 ms returned sat
[2024-05-31 23:25:11] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-31 23:25:11] [INFO ] Deduced a trap composed of 117 places in 152 ms of which 3 ms to minimize.
[2024-05-31 23:25:11] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-05-31 23:25:11] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 2 ms to minimize.
[2024-05-31 23:25:12] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 2 ms to minimize.
[2024-05-31 23:25:12] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-31 23:25:12] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 3 ms to minimize.
[2024-05-31 23:25:12] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:25:13] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 3 ms to minimize.
[2024-05-31 23:25:13] [INFO ] Deduced a trap composed of 148 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:25:14] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 2 ms to minimize.
[2024-05-31 23:25:14] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:25:15] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 2 ms to minimize.
[2024-05-31 23:25:16] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 2 ms to minimize.
[2024-05-31 23:25:17] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2024-05-31 23:25:17] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-31 23:25:17] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-31 23:25:17] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:18] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:18] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:18] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 3 ms to minimize.
[2024-05-31 23:25:18] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2024-05-31 23:25:21] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 3 ms to minimize.
[2024-05-31 23:25:21] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-05-31 23:25:21] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 3 ms to minimize.
[2024-05-31 23:25:21] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-05-31 23:25:22] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:25:22] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-05-31 23:25:22] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 2 ms to minimize.
[2024-05-31 23:25:24] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 2 ms to minimize.
[2024-05-31 23:25:24] [INFO ] Deduced a trap composed of 152 places in 152 ms of which 2 ms to minimize.
[2024-05-31 23:25:24] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-31 23:25:24] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 2 ms to minimize.
[2024-05-31 23:25:24] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
[2024-05-31 23:25:25] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-31 23:25:25] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:25] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:25:26] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:25:26] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 3 ms to minimize.
[2024-05-31 23:25:26] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 3 ms to minimize.
[2024-05-31 23:25:27] [INFO ] Deduced a trap composed of 121 places in 155 ms of which 2 ms to minimize.
[2024-05-31 23:25:27] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:27] [INFO ] Deduced a trap composed of 117 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:25:28] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 3 ms to minimize.
[2024-05-31 23:25:28] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:25:29] [INFO ] Deduced a trap composed of 148 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:29] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 3 ms to minimize.
[2024-05-31 23:25:30] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:30] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:30] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 3 ms to minimize.
[2024-05-31 23:25:31] [INFO ] Deduced a trap composed of 152 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:25:31] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:31] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 3 ms to minimize.
[2024-05-31 23:25:32] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 3 ms to minimize.
[2024-05-31 23:25:32] [INFO ] Deduced a trap composed of 151 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:25:32] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:25:32] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 3 ms to minimize.
[2024-05-31 23:25:32] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:25:33] [INFO ] Deduced a trap composed of 148 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:33] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:33] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:25:33] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:25:33] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:25:33] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:25:34] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:25:35] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:35] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:35] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:25:35] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 2 ms to minimize.
[2024-05-31 23:25:35] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:36] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:25:36] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:25:36] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:36] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:25:36] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:25:38] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:25:38] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:39] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:25:39] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:39] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:25:39] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:25:39] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:25:39] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 3 ms to minimize.
[2024-05-31 23:25:40] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:25:40] [INFO ] Deduced a trap composed of 152 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:25:40] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:25:40] [INFO ] Deduced a trap composed of 148 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:25:40] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:41] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:41] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:41] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:25:41] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:25:41] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:25:42] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:25:42] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:42] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:25:42] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 2 ms to minimize.
[2024-05-31 23:25:42] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:43] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 3 ms to minimize.
[2024-05-31 23:25:43] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:25:43] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:44] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 2 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:25:45] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 2 ms to minimize.
[2024-05-31 23:25:46] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:25:46] [INFO ] Deduced a trap composed of 155 places in 152 ms of which 2 ms to minimize.
[2024-05-31 23:25:46] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:46] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 145 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 3 ms to minimize.
[2024-05-31 23:25:48] [INFO ] Deduced a trap composed of 132 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:48] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 2 ms to minimize.
[2024-05-31 23:25:48] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 2 ms to minimize.
[2024-05-31 23:25:48] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:48] [INFO ] Deduced a trap composed of 153 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:25:49] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:25:49] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:49] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 3 ms to minimize.
[2024-05-31 23:25:49] [INFO ] Deduced a trap composed of 143 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:25:49] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 3 ms to minimize.
[2024-05-31 23:25:49] [INFO ] Deduced a trap composed of 150 places in 140 ms of which 3 ms to minimize.
[2024-05-31 23:25:50] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 2 ms to minimize.
[2024-05-31 23:25:50] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:25:50] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:25:50] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 2 ms to minimize.
[2024-05-31 23:25:50] [INFO ] Deduced a trap composed of 157 places in 146 ms of which 2 ms to minimize.
[2024-05-31 23:25:51] [INFO ] Deduced a trap composed of 129 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:25:51] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:51] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:25:51] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:25:51] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:25:51] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:25:52] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:25:52] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 2 ms to minimize.
[2024-05-31 23:25:52] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 3 ms to minimize.
[2024-05-31 23:25:54] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 2 ms to minimize.
[2024-05-31 23:25:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 23:25:54] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-05-31 23:25:55] [INFO ] [Real]Added 75 Read/Feed constraints in 424 ms returned sat
[2024-05-31 23:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:55] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-05-31 23:25:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 1286 ms returned sat
[2024-05-31 23:25:57] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-05-31 23:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-05-31 23:25:57] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 24 ms.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 4 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:26:13] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:26:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1863 ms
[2024-05-31 23:26:14] [INFO ] Added : 365 causal constraints over 73 iterations in 17757 ms. Result :sat
Minimization took 4501 ms.
[2024-05-31 23:26:19] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-05-31 23:26:20] [INFO ] [Real]Added 75 Read/Feed constraints in 471 ms returned sat
[2024-05-31 23:26:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:20] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-05-31 23:26:21] [INFO ] [Nat]Added 75 Read/Feed constraints in 1157 ms returned sat
[2024-05-31 23:26:21] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-31 23:26:33] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-31 23:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-31 23:26:33] [INFO ] Added : 266 causal constraints over 54 iterations in 11720 ms. Result :sat
Minimization took 2767 ms.
[2024-05-31 23:26:36] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2024-05-31 23:26:37] [INFO ] [Real]Added 75 Read/Feed constraints in 231 ms returned sat
[2024-05-31 23:26:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:37] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2024-05-31 23:26:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 648 ms returned sat
[2024-05-31 23:26:38] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:26:45] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:26:45] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-31 23:26:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2024-05-31 23:26:45] [INFO ] Added : 248 causal constraints over 51 iterations in 7097 ms. Result :sat
Minimization took 1527 ms.
[2024-05-31 23:26:47] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 23:26:48] [INFO ] [Real]Added 75 Read/Feed constraints in 708 ms returned sat
[2024-05-31 23:26:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:48] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 23:26:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 138 ms returned sat
[2024-05-31 23:26:48] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-31 23:26:48] [INFO ] Added : 38 causal constraints over 8 iterations in 283 ms. Result :sat
Minimization took 313 ms.
[2024-05-31 23:26:49] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-31 23:26:50] [INFO ] [Real]Added 75 Read/Feed constraints in 685 ms returned sat
[2024-05-31 23:26:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:50] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2024-05-31 23:26:51] [INFO ] [Nat]Added 75 Read/Feed constraints in 575 ms returned sat
[2024-05-31 23:26:51] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 28 ms.
[2024-05-31 23:26:52] [INFO ] Added : 136 causal constraints over 28 iterations in 1855 ms. Result :sat
Minimization took 689 ms.
[2024-05-31 23:26:53] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2024-05-31 23:26:54] [INFO ] [Real]Added 75 Read/Feed constraints in 442 ms returned sat
[2024-05-31 23:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:54] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-05-31 23:26:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 612 ms returned sat
[2024-05-31 23:26:55] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-31 23:27:03] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-31 23:27:03] [INFO ] Added : 180 causal constraints over 36 iterations in 7931 ms. Result :sat
Minimization took 1221 ms.
[2024-05-31 23:27:05] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-05-31 23:27:05] [INFO ] [Real]Added 75 Read/Feed constraints in 225 ms returned sat
[2024-05-31 23:27:05] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:27:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:05] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2024-05-31 23:27:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 408 ms returned sat
[2024-05-31 23:27:06] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:27:12] [INFO ] Added : 229 causal constraints over 47 iterations in 5916 ms. Result :sat
Minimization took 2908 ms.
[2024-05-31 23:27:15] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-05-31 23:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:16] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-31 23:27:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:27:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 4656 ms returned sat
[2024-05-31 23:27:20] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-31 23:27:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1019 ms
[2024-05-31 23:27:36] [INFO ] Added : 266 causal constraints over 54 iterations in 16167 ms. Result :sat
Minimization took 2993 ms.
[2024-05-31 23:27:40] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-05-31 23:27:41] [INFO ] [Real]Added 75 Read/Feed constraints in 807 ms returned sat
[2024-05-31 23:27:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:41] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2024-05-31 23:27:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 708 ms returned sat
[2024-05-31 23:27:42] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:27:50] [INFO ] Added : 271 causal constraints over 55 iterations in 7674 ms. Result :sat
Minimization took 2749 ms.
[2024-05-31 23:27:53] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-05-31 23:27:53] [INFO ] [Real]Added 75 Read/Feed constraints in 540 ms returned sat
[2024-05-31 23:27:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:54] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-31 23:27:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 1532 ms returned sat
[2024-05-31 23:27:55] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:28:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1044 ms
[2024-05-31 23:28:14] [INFO ] Added : 362 causal constraints over 73 iterations in 18414 ms. Result :sat
Minimization took 3996 ms.
[2024-05-31 23:28:18] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-31 23:28:19] [INFO ] [Real]Added 75 Read/Feed constraints in 669 ms returned sat
[2024-05-31 23:28:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:19] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2024-05-31 23:28:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 451 ms returned sat
[2024-05-31 23:28:20] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 6 ms to minimize.
[2024-05-31 23:28:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 596 ms
[2024-05-31 23:28:24] [INFO ] Added : 171 causal constraints over 35 iterations in 3915 ms. Result :sat
Minimization took 1967 ms.
[2024-05-31 23:28:26] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Real]Added 75 Read/Feed constraints in 267 ms returned sat
[2024-05-31 23:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:26] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-31 23:28:27] [INFO ] [Nat]Added 75 Read/Feed constraints in 117 ms returned sat
[2024-05-31 23:28:27] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-31 23:28:27] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 2 ms to minimize.
[2024-05-31 23:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-31 23:28:27] [INFO ] Added : 55 causal constraints over 13 iterations in 751 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 444 /444 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 444/444 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 454/454 transitions.
Applied a total of 0 rules in 7 ms. Remains 444 /444 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:31:14] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-31 23:31:14] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:31:14] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-31 23:31:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:31:19] [INFO ] Implicit Places using invariants and state equation in 4187 ms returned []
Implicit Place search using SMT with State Equation took 4438 ms to find 0 implicit places.
[2024-05-31 23:31:19] [INFO ] Redundant transitions in 27 ms returned []
Running 453 sub problems to find dead transitions.
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:31:19] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-31 23:31:19] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 454/897 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 75/518 constraints. Problems are: Problem set: 0 solved, 453 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/897 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1/898 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/898 variables, and 519 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30031 ms.
Refiners :[State Equation: 444/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 454/897 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 75/518 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/897 variables, 453/971 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/898 variables, and 971 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30017 ms.
Refiners :[State Equation: 443/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 60340ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64841 ms. Remains : 444/444 places, 454/454 transitions.
Found an invariant !
This invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (4991 resets) in 1077 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (327 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (328 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (311 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (326 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (334 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (349 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (327 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (332 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (341 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (334 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (337 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (342 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (329 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (339 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (339 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 211401 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :1 out of 15
Probabilistic random walk after 211401 steps, saw 105725 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :1
// Phase 1: matrix 454 rows 444 cols
[2024-05-31 23:42:23] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-31 23:42:23] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 54/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 309/377 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 412/789 variables, 240/374 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 43/417 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 109/898 variables, 90/507 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/898 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 898/898 variables, and 519 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1034 ms.
Refiners :[State Equation: 444/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 54/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 309/377 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 412/789 variables, 240/388 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 43/431 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 109/898 variables, 90/521 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:29] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
SMT process timed out in 6203ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 454/454 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 443 transition count 453
Applied a total of 2 rules in 12 ms. Remains 443 /444 variables (removed 1) and now considering 453/454 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 443/444 places, 453/454 transitions.
RANDOM walk for 40000 steps (5007 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3336 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3270 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (3376 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3321 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3278 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (3335 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3357 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3314 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3336 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3288 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3315 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3380 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3325 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 205918 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 14
Probabilistic random walk after 205918 steps, saw 102981 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 453 rows 443 cols
[2024-05-31 23:42:33] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:42:33] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 54/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 308/376 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 411/787 variables, 239/373 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/787 variables, 43/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/787 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 109/896 variables, 90/506 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/896 variables, 12/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/896 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/896 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 896/896 variables, and 518 constraints, problems are : Problem set: 0 solved, 14 unsolved in 977 ms.
Refiners :[State Equation: 443/443 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 54/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 308/376 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 411/787 variables, 239/387 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/787 variables, 43/430 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/787 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 109/896 variables, 90/520 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/896 variables, 12/532 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:42:40] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:42:42] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/896 variables, 14/546 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:43] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/896 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:44] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:42:44] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:42:44] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:42:45] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:42:45] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/896 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:47] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:42:47] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:42:48] [INFO ] Deduced a trap composed of 149 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:42:48] [INFO ] Deduced a trap composed of 174 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:42:48] [INFO ] Deduced a trap composed of 173 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:42:48] [INFO ] Deduced a trap composed of 173 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:42:48] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 2 ms to minimize.
[2024-05-31 23:42:49] [INFO ] Deduced a trap composed of 163 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:42:49] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/896 variables, 9/561 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/896 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:51] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/896 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:52] [INFO ] Deduced a trap composed of 169 places in 117 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/896 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:53] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:42:53] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:42:53] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:42:53] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 3 ms to minimize.
[2024-05-31 23:42:53] [INFO ] Deduced a trap composed of 145 places in 137 ms of which 2 ms to minimize.
[2024-05-31 23:42:54] [INFO ] Deduced a trap composed of 145 places in 133 ms of which 2 ms to minimize.
[2024-05-31 23:42:54] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/896 variables, 7/570 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:55] [INFO ] Deduced a trap composed of 154 places in 141 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/896 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:56] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/896 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:57] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:42:57] [INFO ] Deduced a trap composed of 158 places in 135 ms of which 3 ms to minimize.
[2024-05-31 23:42:58] [INFO ] Deduced a trap composed of 155 places in 134 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/896 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:42:58] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/896 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:00] [INFO ] Deduced a trap composed of 175 places in 128 ms of which 3 ms to minimize.
[2024-05-31 23:43:00] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/896 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:02] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/896 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:03] [INFO ] Deduced a trap composed of 167 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:43:03] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/896 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:04] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:43:04] [INFO ] Deduced a trap composed of 169 places in 117 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/896 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:06] [INFO ] Deduced a trap composed of 180 places in 122 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/896 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/896 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:08] [INFO ] Deduced a trap composed of 193 places in 130 ms of which 2 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/896 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:43:09] [INFO ] Deduced a trap composed of 157 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:43:09] [INFO ] Deduced a trap composed of 154 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:43:12] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:43:13] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:43:13] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:43:13] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:43:13] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:43:14] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:43:14] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:43:14] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:43:14] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:43:15] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:43:15] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:43:15] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/896 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 896/896 variables, and 599 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45015 ms.
Refiners :[State Equation: 443/443 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 67/67 constraints]
After SMT, in 46041ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 453/453 transitions.
Applied a total of 0 rules in 23 ms. Remains 443 /443 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 443/443 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 443 /443 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 443 cols
[2024-05-31 23:43:19] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:43:19] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 453 rows 443 cols
[2024-05-31 23:43:19] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-31 23:43:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 23:43:27] [INFO ] Implicit Places using invariants and state equation in 7702 ms returned []
Implicit Place search using SMT with State Equation took 7953 ms to find 0 implicit places.
[2024-05-31 23:43:27] [INFO ] Redundant transitions in 3 ms returned []
Running 452 sub problems to find dead transitions.
// Phase 1: matrix 453 rows 443 cols
[2024-05-31 23:43:27] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:43:27] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 453/895 variables, 442/442 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 75/517 constraints. Problems are: Problem set: 0 solved, 452 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 1/896 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 896/896 variables, and 518 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30018 ms.
Refiners :[State Equation: 443/443 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 453/895 variables, 442/442 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 75/517 constraints. Problems are: Problem set: 0 solved, 452 unsolved
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 UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="UpperBounds"
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 DoubleExponent-PT-020, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132900565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;