About the Execution of LoLa+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 |
| 5940.688 | 3600000.00 | 4420652.00 | 9235.30 | ? ? ? 1 ? ? ? ? ? ? ? ? ? ? 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/mcc2023-input.r135-smll-167819414500485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r135-smll-167819414500485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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 1678351452568
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:44:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:44:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:44:16] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-09 08:44:16] [INFO ] Transformed 1064 places.
[2023-03-09 08:44:16] [INFO ] Transformed 998 transitions.
[2023-03-09 08:44:16] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-09 08:44:17] [INFO ] Invariants computation overflowed in 286 ms
Incomplete random walk after 10000 steps, including 342 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 300 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
// Phase 1: matrix 998 rows 1064 cols
[2023-03-09 08:44:17] [INFO ] Invariants computation overflowed in 243 ms
[2023-03-09 08:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:23] [INFO ] [Real]Absence check using state equation in 4456 ms returned unknown
[2023-03-09 08:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:26] [INFO ] [Real]Absence check using state equation in 3206 ms returned sat
[2023-03-09 08:44:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:29] [INFO ] [Nat]Absence check using state equation in 2793 ms returned sat
[2023-03-09 08:44:30] [INFO ] Deduced a trap composed of 72 places in 989 ms of which 8 ms to minimize.
[2023-03-09 08:44:31] [INFO ] Deduced a trap composed of 61 places in 890 ms of which 3 ms to minimize.
[2023-03-09 08:44:31] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:36] [INFO ] [Real]Absence check using state equation in 4171 ms returned sat
[2023-03-09 08:44:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:39] [INFO ] [Nat]Absence check using state equation in 3125 ms returned sat
[2023-03-09 08:44:40] [INFO ] Deduced a trap composed of 77 places in 563 ms of which 3 ms to minimize.
[2023-03-09 08:44:41] [INFO ] Deduced a trap composed of 90 places in 726 ms of which 4 ms to minimize.
[2023-03-09 08:44:41] [INFO ] Deduced a trap composed of 305 places in 411 ms of which 1 ms to minimize.
[2023-03-09 08:44:41] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:42] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-09 08:44:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:43] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2023-03-09 08:44:44] [INFO ] Deduced a trap composed of 368 places in 1102 ms of which 2 ms to minimize.
[2023-03-09 08:44:45] [INFO ] Deduced a trap composed of 59 places in 1063 ms of which 2 ms to minimize.
[2023-03-09 08:44:46] [INFO ] Deduced a trap composed of 400 places in 731 ms of which 1 ms to minimize.
[2023-03-09 08:44:47] [INFO ] Deduced a trap composed of 55 places in 993 ms of which 2 ms to minimize.
[2023-03-09 08:44:47] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:49] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2023-03-09 08:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:50] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2023-03-09 08:44:51] [INFO ] Deduced a trap composed of 445 places in 829 ms of which 2 ms to minimize.
[2023-03-09 08:44:52] [INFO ] Deduced a trap composed of 31 places in 656 ms of which 1 ms to minimize.
[2023-03-09 08:44:52] [INFO ] Deduced a trap composed of 113 places in 376 ms of which 1 ms to minimize.
[2023-03-09 08:44:53] [INFO ] Deduced a trap composed of 89 places in 819 ms of which 2 ms to minimize.
[2023-03-09 08:44:54] [INFO ] Deduced a trap composed of 108 places in 795 ms of which 1 ms to minimize.
[2023-03-09 08:44: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:44:58] [INFO ] [Real]Absence check using state equation in 3361 ms returned sat
[2023-03-09 08:44:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:00] [INFO ] [Nat]Absence check using state equation in 2101 ms returned sat
[2023-03-09 08:45:01] [INFO ] Deduced a trap composed of 408 places in 800 ms of which 1 ms to minimize.
[2023-03-09 08:45:01] [INFO ] Deduced a trap composed of 58 places in 661 ms of which 2 ms to minimize.
[2023-03-09 08:45:02] [INFO ] Deduced a trap composed of 418 places in 810 ms of which 1 ms to minimize.
[2023-03-09 08:45:03] [INFO ] Deduced a trap composed of 41 places in 706 ms of which 2 ms to minimize.
[2023-03-09 08:45:03] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:05] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2023-03-09 08:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:07] [INFO ] [Nat]Absence check using state equation in 1577 ms returned sat
[2023-03-09 08:45:07] [INFO ] Deduced a trap composed of 61 places in 818 ms of which 2 ms to minimize.
[2023-03-09 08:45:08] [INFO ] Deduced a trap composed of 397 places in 872 ms of which 1 ms to minimize.
[2023-03-09 08:45:09] [INFO ] Deduced a trap composed of 415 places in 780 ms of which 2 ms to minimize.
[2023-03-09 08:45:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2847 ms
[2023-03-09 08:45:10] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 111 ms.
[2023-03-09 08:45:10] [INFO ] Added : 5 causal constraints over 1 iterations in 432 ms. Result :unknown
[2023-03-09 08:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:11] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-09 08:45:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:12] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2023-03-09 08:45:12] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 101 ms.
[2023-03-09 08:45:16] [INFO ] Added : 50 causal constraints over 10 iterations in 4031 ms. Result :unknown
[2023-03-09 08:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:18] [INFO ] [Real]Absence check using state equation in 1875 ms returned sat
[2023-03-09 08:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:20] [INFO ] [Nat]Absence check using state equation in 1976 ms returned sat
[2023-03-09 08:45:21] [INFO ] Deduced a trap composed of 67 places in 720 ms of which 1 ms to minimize.
[2023-03-09 08:45:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 876 ms
[2023-03-09 08:45:21] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 78 ms.
[2023-03-09 08:45:23] [INFO ] Added : 20 causal constraints over 4 iterations in 2009 ms. Result :unknown
[2023-03-09 08:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:24] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2023-03-09 08:45:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:26] [INFO ] [Nat]Absence check using state equation in 1058 ms returned sat
[2023-03-09 08:45:26] [INFO ] Deduced a trap composed of 65 places in 767 ms of which 1 ms to minimize.
[2023-03-09 08:45:27] [INFO ] Deduced a trap composed of 73 places in 791 ms of which 2 ms to minimize.
[2023-03-09 08:45:28] [INFO ] Deduced a trap composed of 84 places in 806 ms of which 2 ms to minimize.
[2023-03-09 08:45:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2678 ms
[2023-03-09 08:45:28] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 115 ms.
[2023-03-09 08:45:29] [INFO ] Added : 20 causal constraints over 4 iterations in 1122 ms. Result :unknown
[2023-03-09 08:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:30] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2023-03-09 08:45:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:32] [INFO ] [Nat]Absence check using state equation in 1017 ms returned sat
[2023-03-09 08:45:32] [INFO ] Deduced a trap composed of 149 places in 358 ms of which 0 ms to minimize.
[2023-03-09 08:45:33] [INFO ] Deduced a trap composed of 137 places in 527 ms of which 2 ms to minimize.
[2023-03-09 08:45:33] [INFO ] Deduced a trap composed of 163 places in 531 ms of which 1 ms to minimize.
[2023-03-09 08:45:34] [INFO ] Deduced a trap composed of 151 places in 538 ms of which 1 ms to minimize.
[2023-03-09 08:45:35] [INFO ] Deduced a trap composed of 175 places in 566 ms of which 2 ms to minimize.
[2023-03-09 08:45:35] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3836 ms
[2023-03-09 08:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:37] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2023-03-09 08:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:38] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2023-03-09 08:45:38] [INFO ] Deduced a trap composed of 113 places in 567 ms of which 2 ms to minimize.
[2023-03-09 08:45:39] [INFO ] Deduced a trap composed of 125 places in 582 ms of which 1 ms to minimize.
[2023-03-09 08:45:40] [INFO ] Deduced a trap composed of 501 places in 779 ms of which 1 ms to minimize.
[2023-03-09 08:45:41] [INFO ] Deduced a trap composed of 477 places in 774 ms of which 2 ms to minimize.
[2023-03-09 08:45:42] [INFO ] Deduced a trap composed of 470 places in 795 ms of which 3 ms to minimize.
[2023-03-09 08:45:42] [INFO ] Deduced a trap composed of 89 places in 881 ms of which 2 ms to minimize.
[2023-03-09 08:45:42] [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 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:46] [INFO ] [Real]Absence check using state equation in 3205 ms returned sat
[2023-03-09 08:45:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:49] [INFO ] [Nat]Absence check using state equation in 2987 ms returned sat
[2023-03-09 08:45:50] [INFO ] Deduced a trap composed of 349 places in 893 ms of which 2 ms to minimize.
[2023-03-09 08:45:51] [INFO ] Deduced a trap composed of 163 places in 396 ms of which 1 ms to minimize.
[2023-03-09 08:45:51] [INFO ] Deduced a trap composed of 277 places in 424 ms of which 1 ms to minimize.
[2023-03-09 08:45:51] [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 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:54] [INFO ] [Real]Absence check using state equation in 3062 ms returned sat
[2023-03-09 08:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:45:56] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2023-03-09 08:45:57] [INFO ] Deduced a trap composed of 381 places in 863 ms of which 2 ms to minimize.
[2023-03-09 08:45:58] [INFO ] Deduced a trap composed of 394 places in 750 ms of which 1 ms to minimize.
[2023-03-09 08:45:59] [INFO ] Deduced a trap composed of 395 places in 856 ms of which 1 ms to minimize.
[2023-03-09 08:46:00] [INFO ] Deduced a trap composed of 55 places in 819 ms of which 2 ms to minimize.
[2023-03-09 08:46:00] [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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:46:01] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2023-03-09 08:46:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:46:02] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2023-03-09 08:46:03] [INFO ] Deduced a trap composed of 396 places in 656 ms of which 1 ms to minimize.
[2023-03-09 08:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1192 ms
[2023-03-09 08:46:03] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 86 ms.
[2023-03-09 08:46:06] [INFO ] Added : 20 causal constraints over 4 iterations in 2828 ms. Result :unknown
[2023-03-09 08:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:46:08] [INFO ] [Real]Absence check using state equation in 1497 ms returned sat
[2023-03-09 08:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:46:09] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2023-03-09 08:46:10] [INFO ] Deduced a trap composed of 65 places in 651 ms of which 1 ms to minimize.
[2023-03-09 08:46:10] [INFO ] Deduced a trap composed of 107 places in 429 ms of which 1 ms to minimize.
[2023-03-09 08:46:11] [INFO ] Deduced a trap composed of 105 places in 622 ms of which 1 ms to minimize.
[2023-03-09 08:46:12] [INFO ] Deduced a trap composed of 84 places in 621 ms of which 1 ms to minimize.
[2023-03-09 08:46:12] [INFO ] Deduced a trap composed of 84 places in 387 ms of which 1 ms to minimize.
[2023-03-09 08:46:13] [INFO ] Deduced a trap composed of 108 places in 396 ms of which 1 ms to minimize.
[2023-03-09 08:46:13] [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 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
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 1060 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1060 transition count 770
Reduce places removed 228 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 463 place count 829 transition count 767
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 463 place count 829 transition count 724
Deduced a syphon composed of 43 places in 16 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 549 place count 786 transition count 724
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 5 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 895 place count 613 transition count 551
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 969 place count 576 transition count 551
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1049 place count 576 transition count 471
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 1129 place count 496 transition count 471
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 1208 place count 496 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1209 place count 495 transition count 470
Applied a total of 1209 rules in 484 ms. Remains 495 /1064 variables (removed 569) and now considering 470/998 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 495/1064 places, 470/998 transitions.
// Phase 1: matrix 470 rows 495 cols
[2023-03-09 08:47:26] [INFO ] Computed 101 place invariants in 132 ms
Incomplete random walk after 1000000 steps, including 128434 resets, run finished after 1665 ms. (steps per millisecond=600 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85009 resets, run finished after 983 ms. (steps per millisecond=1017 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84728 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84716 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84575 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84570 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84910 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84788 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84974 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85079 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84972 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84371 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84474 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84694 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84854 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84749 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84868 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties (out of 16) seen :0
[2023-03-09 08:47:44] [INFO ] Invariant cache hit.
[2023-03-09 08:47:44] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 08:47:44] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 53 ms returned sat
[2023-03-09 08:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:45] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-09 08:47:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:47:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 08:47:45] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 47 ms returned sat
[2023-03-09 08:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:45] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-09 08:47:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:47:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 08:47:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 6212 ms returned unknown
[2023-03-09 08:47:52] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:47:52] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2023-03-09 08:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:52] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-09 08:47:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:47:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:47:52] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2023-03-09 08:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:53] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2023-03-09 08:47:53] [INFO ] [Nat]Added 73 Read/Feed constraints in 313 ms returned sat
[2023-03-09 08:47:53] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 110 ms.
[2023-03-09 08:47:54] [INFO ] Added : 74 causal constraints over 15 iterations in 1357 ms. Result :sat
Minimization took 1119 ms.
[2023-03-09 08:47:56] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:47:56] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 35 ms returned sat
[2023-03-09 08:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:56] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2023-03-09 08:47:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:47:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:47:57] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 48 ms returned sat
[2023-03-09 08:47:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:57] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-09 08:47:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 400 ms returned sat
[2023-03-09 08:47:58] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 42 ms.
[2023-03-09 08:48:05] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 2 ms to minimize.
[2023-03-09 08:48:05] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2023-03-09 08:48:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 913 ms
[2023-03-09 08:48:05] [INFO ] Added : 158 causal constraints over 33 iterations in 7663 ms. Result :sat
Minimization took 1300 ms.
[2023-03-09 08:48:07] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:48:07] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-09 08:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:07] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-09 08:48:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:48:07] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2023-03-09 08:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:07] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-09 08:48:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 70 ms returned sat
[2023-03-09 08:48:08] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 1 ms to minimize.
[2023-03-09 08:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-09 08:48:08] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 53 ms.
[2023-03-09 08:48:08] [INFO ] Added : 58 causal constraints over 12 iterations in 678 ms. Result :sat
Minimization took 1403 ms.
[2023-03-09 08:48:10] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:48:10] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 41 ms returned sat
[2023-03-09 08:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:11] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2023-03-09 08:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 08:48:11] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 55 ms returned sat
[2023-03-09 08:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:11] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-09 08:48:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 1274 ms returned sat
[2023-03-09 08:48:13] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 1 ms to minimize.
[2023-03-09 08:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-09 08:48:13] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-09 08:48:26] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 2 ms to minimize.
[2023-03-09 08:48:26] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 2 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 4 ms to minimize.
[2023-03-09 08:48:27] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2023-03-09 08:48:28] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2023-03-09 08:48:28] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:48:28] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2023-03-09 08:48:28] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2023-03-09 08:48:29] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2023-03-09 08:48:29] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2023-03-09 08:48:29] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2023-03-09 08:48:30] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 3 ms to minimize.
[2023-03-09 08:48:30] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2023-03-09 08:48:31] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 5 ms to minimize.
[2023-03-09 08:48:31] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-09 08:48:32] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2023-03-09 08:48:33] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2023-03-09 08:48:33] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2023-03-09 08:48:33] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 0 ms to minimize.
[2023-03-09 08:48:33] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2023-03-09 08:48:34] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 0 ms to minimize.
[2023-03-09 08:48:34] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2023-03-09 08:48:34] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8576 ms
[2023-03-09 08:48:34] [INFO ] Added : 295 causal constraints over 59 iterations in 21356 ms. Result :sat
Minimization took 3005 ms.
[2023-03-09 08:48:37] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:48:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 31 ms returned sat
[2023-03-09 08:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:38] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-03-09 08:48:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:48:38] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2023-03-09 08:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:38] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2023-03-09 08:48:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 101 ms returned sat
[2023-03-09 08:48:39] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-09 08:48:45] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 2 ms to minimize.
[2023-03-09 08:48:45] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 1 ms to minimize.
[2023-03-09 08:48:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 917 ms
[2023-03-09 08:48:45] [INFO ] Added : 145 causal constraints over 30 iterations in 6674 ms. Result :sat
Minimization took 2012 ms.
[2023-03-09 08:48:47] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:48:47] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 35 ms returned sat
[2023-03-09 08:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:48] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-09 08:48:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:48:48] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 55 ms returned sat
[2023-03-09 08:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:48] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-09 08:48:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 1747 ms returned sat
[2023-03-09 08:48:50] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2023-03-09 08:48:51] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2023-03-09 08:48:51] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 2 ms to minimize.
[2023-03-09 08:48:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1028 ms
[2023-03-09 08:48:51] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 59 ms.
[2023-03-09 08:48:59] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 1 ms to minimize.
[2023-03-09 08:48:59] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 0 ms to minimize.
[2023-03-09 08:48:59] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2023-03-09 08:49:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1130 ms
[2023-03-09 08:49:00] [INFO ] Added : 195 causal constraints over 39 iterations in 8535 ms. Result :sat
Minimization took 1748 ms.
[2023-03-09 08:49:01] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:02] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2023-03-09 08:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:02] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-09 08:49:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 08:49:02] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 59 ms returned sat
[2023-03-09 08:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:03] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2023-03-09 08:49:03] [INFO ] [Nat]Added 73 Read/Feed constraints in 601 ms returned sat
[2023-03-09 08:49:03] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-09 08:49:09] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2023-03-09 08:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-09 08:49:09] [INFO ] Added : 220 causal constraints over 44 iterations in 6240 ms. Result :sat
Minimization took 1450 ms.
[2023-03-09 08:49:11] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:11] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-09 08:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:11] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-09 08:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:49:12] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2023-03-09 08:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:12] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-09 08:49:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 855 ms returned sat
[2023-03-09 08:49:13] [INFO ] Deduced a trap composed of 9 places in 362 ms of which 2 ms to minimize.
[2023-03-09 08:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-09 08:49:13] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 64 ms.
[2023-03-09 08:49:17] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2023-03-09 08:49:18] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
[2023-03-09 08:49:18] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 1 ms to minimize.
[2023-03-09 08:49:18] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 1 ms to minimize.
[2023-03-09 08:49:19] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2023-03-09 08:49:19] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 1 ms to minimize.
[2023-03-09 08:49:19] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2023-03-09 08:49:20] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 1 ms to minimize.
[2023-03-09 08:49:20] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 0 ms to minimize.
[2023-03-09 08:49:21] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 1 ms to minimize.
[2023-03-09 08:49:21] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2023-03-09 08:49:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4150 ms
[2023-03-09 08:49:21] [INFO ] Added : 152 causal constraints over 32 iterations in 7927 ms. Result :sat
Minimization took 2192 ms.
[2023-03-09 08:49:24] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:24] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2023-03-09 08:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:24] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-09 08:49:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:24] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2023-03-09 08:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:25] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-09 08:49:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 145 ms returned sat
[2023-03-09 08:49:25] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 57 ms.
[2023-03-09 08:49:27] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 1 ms to minimize.
[2023-03-09 08:49:27] [INFO ] Deduced a trap composed of 10 places in 381 ms of which 1 ms to minimize.
[2023-03-09 08:49:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 941 ms
[2023-03-09 08:49:27] [INFO ] Added : 93 causal constraints over 21 iterations in 2405 ms. Result :sat
Minimization took 1181 ms.
[2023-03-09 08:49:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 33 ms returned sat
[2023-03-09 08:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:29] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-09 08:49:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:49:29] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 43 ms returned sat
[2023-03-09 08:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:29] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-09 08:49:31] [INFO ] [Nat]Added 73 Read/Feed constraints in 1295 ms returned sat
[2023-03-09 08:49:31] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-09 08:49:41] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:49:41] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 1 ms to minimize.
[2023-03-09 08:49:42] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 1 ms to minimize.
[2023-03-09 08:49:42] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 1 ms to minimize.
[2023-03-09 08:49:43] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-09 08:49:43] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 2 ms to minimize.
[2023-03-09 08:49:43] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:49:44] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 1 ms to minimize.
[2023-03-09 08:49:44] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 4 ms to minimize.
[2023-03-09 08:49:44] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 1 ms to minimize.
[2023-03-09 08:49:45] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 1 ms to minimize.
[2023-03-09 08:49:45] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 0 ms to minimize.
[2023-03-09 08:49:46] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 0 ms to minimize.
[2023-03-09 08:49:46] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:49:46] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 1 ms to minimize.
[2023-03-09 08:49:47] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2023-03-09 08:49:48] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2023-03-09 08:49:48] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 0 ms to minimize.
[2023-03-09 08:49:49] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 0 ms to minimize.
[2023-03-09 08:49:49] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 0 ms to minimize.
[2023-03-09 08:49:50] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 0 ms to minimize.
[2023-03-09 08:49:50] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2023-03-09 08:49:50] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9241 ms
[2023-03-09 08:49:50] [INFO ] Added : 266 causal constraints over 54 iterations in 19841 ms. Result :sat
Minimization took 3038 ms.
[2023-03-09 08:49:54] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:49:54] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-09 08:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:54] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-09 08:49:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:49:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:49:54] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 42 ms returned sat
[2023-03-09 08:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:49:54] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-09 08:49:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 2063 ms returned sat
[2023-03-09 08:49:57] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-09 08:50:09] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 4 ms to minimize.
[2023-03-09 08:50:09] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 1 ms to minimize.
[2023-03-09 08:50:09] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 1 ms to minimize.
[2023-03-09 08:50:10] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2023-03-09 08:50:10] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 1 ms to minimize.
[2023-03-09 08:50:10] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-09 08:50:11] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 1 ms to minimize.
[2023-03-09 08:50:11] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2023-03-09 08:50:11] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 1 ms to minimize.
[2023-03-09 08:50:12] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 0 ms to minimize.
[2023-03-09 08:50:12] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 1 ms to minimize.
[2023-03-09 08:50:12] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 0 ms to minimize.
[2023-03-09 08:50:13] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 0 ms to minimize.
[2023-03-09 08:50:13] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 0 ms to minimize.
[2023-03-09 08:50:14] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 1 ms to minimize.
[2023-03-09 08:50:14] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 1 ms to minimize.
[2023-03-09 08:50:14] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 1 ms to minimize.
[2023-03-09 08:50:15] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-09 08:50:15] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 0 ms to minimize.
[2023-03-09 08:50:15] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 1 ms to minimize.
[2023-03-09 08:50:16] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-09 08:50:16] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 5 ms to minimize.
[2023-03-09 08:50:16] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 0 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 0 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 1 ms to minimize.
[2023-03-09 08:50:17] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2023-03-09 08:50:18] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 0 ms to minimize.
[2023-03-09 08:50:18] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 1 ms to minimize.
[2023-03-09 08:50:18] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9957 ms
[2023-03-09 08:50:18] [INFO ] Added : 287 causal constraints over 58 iterations in 21903 ms.(timeout) Result :sat
Minimization took 3001 ms.
[2023-03-09 08:50:22] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:50:22] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-09 08:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:22] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-09 08:50:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:50:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:50:22] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 35 ms returned sat
[2023-03-09 08:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:23] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2023-03-09 08:50:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 1163 ms returned sat
[2023-03-09 08:50:24] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 0 ms to minimize.
[2023-03-09 08:50:24] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 0 ms to minimize.
[2023-03-09 08:50:25] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 0 ms to minimize.
[2023-03-09 08:50:25] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 1 ms to minimize.
[2023-03-09 08:50:25] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 1 ms to minimize.
[2023-03-09 08:50:26] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 1 ms to minimize.
[2023-03-09 08:50:26] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 1 ms to minimize.
[2023-03-09 08:50:26] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2023-03-09 08:50:26] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:50:27] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 1 ms to minimize.
[2023-03-09 08:50:27] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:50:27] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 1 ms to minimize.
[2023-03-09 08:50:28] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2023-03-09 08:50:28] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:50:28] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-09 08:50:29] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2023-03-09 08:50:29] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 1 ms to minimize.
[2023-03-09 08:50:29] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 1 ms to minimize.
[2023-03-09 08:50:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5519 ms
[2023-03-09 08:50:30] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 67 ms.
[2023-03-09 08:50:38] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:50:38] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-09 08:50:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 841 ms
[2023-03-09 08:50:38] [INFO ] Added : 209 causal constraints over 42 iterations in 8734 ms. Result :sat
Minimization took 2511 ms.
[2023-03-09 08:50:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:50:41] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-09 08:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:41] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-09 08:50:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:50:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:50:41] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 54 ms returned sat
[2023-03-09 08:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:42] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-09 08:50:42] [INFO ] [Nat]Added 73 Read/Feed constraints in 41 ms returned sat
[2023-03-09 08:50:42] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 45 ms.
[2023-03-09 08:50:45] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 1 ms to minimize.
[2023-03-09 08:50:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2023-03-09 08:50:45] [INFO ] Added : 100 causal constraints over 20 iterations in 2961 ms. Result :sat
Minimization took 1921 ms.
[2023-03-09 08:50:47] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:50:47] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 53 ms returned sat
[2023-03-09 08:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:47] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-09 08:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:50:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:50:48] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 55 ms returned sat
[2023-03-09 08:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:48] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2023-03-09 08:50:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 119 ms returned sat
[2023-03-09 08:50:48] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 66 ms.
[2023-03-09 08:50:50] [INFO ] Added : 70 causal constraints over 14 iterations in 1654 ms. Result :sat
Minimization took 555 ms.
[2023-03-09 08:50:50] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:50:50] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-09 08:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:51] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-09 08:50:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:50:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:50:51] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 36 ms returned sat
[2023-03-09 08:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:50:51] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-09 08:50:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 1149 ms returned sat
[2023-03-09 08:50:52] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 50 ms.
[2023-03-09 08:51:05] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2023-03-09 08:51:05] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2023-03-09 08:51:06] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 1 ms to minimize.
[2023-03-09 08:51:06] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 1 ms to minimize.
[2023-03-09 08:51:06] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 1 ms to minimize.
[2023-03-09 08:51:07] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 1 ms to minimize.
[2023-03-09 08:51:07] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 1 ms to minimize.
[2023-03-09 08:51:08] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:51:08] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2023-03-09 08:51:08] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:51:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4293 ms
[2023-03-09 08:51:10] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2023-03-09 08:51:11] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-09 08:51:12] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-09 08:51:12] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 0 ms to minimize.
[2023-03-09 08:51:12] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 0 ms to minimize.
[2023-03-09 08:51:13] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 1 ms to minimize.
[2023-03-09 08:51:13] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:51:13] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2023-03-09 08:51:15] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2023-03-09 08:51:15] [INFO ] Deduced a trap composed of 108 places in 208 ms of which 1 ms to minimize.
[2023-03-09 08:51:15] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 1 ms to minimize.
[2023-03-09 08:51:16] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2023-03-09 08:51:16] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 0 ms to minimize.
[2023-03-09 08:51:17] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 1 ms to minimize.
[2023-03-09 08:51:17] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 1 ms to minimize.
[2023-03-09 08:51:18] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 1 ms to minimize.
[2023-03-09 08:51:18] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-09 08:51:18] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 0 ms to minimize.
[2023-03-09 08:51:19] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2023-03-09 08:51:19] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2023-03-09 08:51:19] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 1 ms to minimize.
[2023-03-09 08:51:20] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 1 ms to minimize.
[2023-03-09 08:51:20] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 0 ms to minimize.
[2023-03-09 08:51:20] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2023-03-09 08:51:21] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 1 ms to minimize.
[2023-03-09 08:51:21] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2023-03-09 08:51:22] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2023-03-09 08:51:25] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 14924 ms
[2023-03-09 08:51:36] [INFO ] Deduced a trap composed of 2 places in 445 ms of which 1 ms to minimize.
[2023-03-09 08:51:36] [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 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 27 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 495/495 places, 470/470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 25 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-09 08:53:12] [INFO ] Invariant cache hit.
[2023-03-09 08:53:13] [INFO ] Implicit Places using invariants in 969 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 978 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/495 places, 470/470 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 493 transition count 469
Applied a total of 2 rules in 56 ms. Remains 493 /494 variables (removed 1) and now considering 469/470 (removed 1) transitions.
// Phase 1: matrix 469 rows 493 cols
[2023-03-09 08:53:13] [INFO ] Invariants computation overflowed in 121 ms
[2023-03-09 08:53:14] [INFO ] Implicit Places using invariants in 1127 ms returned []
// Phase 1: matrix 469 rows 493 cols
[2023-03-09 08:53:14] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-09 08:53:15] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:53:45] [INFO ] Performed 414/493 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 08:53:51] [INFO ] Implicit Places using invariants and state equation in 36828 ms returned [79, 491]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 37960 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 491/495 places, 469/470 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 491 transition count 469
Applied a total of 2 rules in 39 ms. Remains 491 /491 variables (removed 0) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 491 cols
[2023-03-09 08:53:51] [INFO ] Computed 98 place invariants in 65 ms
[2023-03-09 08:53:52] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-03-09 08:53:52] [INFO ] Invariant cache hit.
[2023-03-09 08:53:52] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:54:14] [INFO ] Implicit Places using invariants and state equation in 22295 ms returned [50, 211, 217, 224, 239, 244, 295, 300, 322, 327, 349, 354, 376, 382, 403, 405, 409, 429, 435, 457, 462, 466, 484]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 23226 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 468/495 places, 469/470 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 468 transition count 459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 458 transition count 459
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 458 transition count 459
Applied a total of 24 rules in 57 ms. Remains 458 /468 variables (removed 10) and now considering 459/469 (removed 10) transitions.
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 08:54:14] [INFO ] Computed 75 place invariants in 63 ms
[2023-03-09 08:54:15] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-09 08:54:15] [INFO ] Invariant cache hit.
[2023-03-09 08:54:15] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:54:45] [INFO ] Performed 454/458 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:54:46] [INFO ] Implicit Places using invariants and state equation in 30727 ms returned []
Implicit Place search using SMT with State Equation took 31476 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 458/495 places, 459/470 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 93820 ms. Remains : 458/495 places, 459/470 transitions.
[2023-03-09 08:54:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 129290 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85322 resets, run finished after 1192 ms. (steps per millisecond=838 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85044 resets, run finished after 1194 ms. (steps per millisecond=837 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85404 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85004 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85202 resets, run finished after 1226 ms. (steps per millisecond=815 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84893 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85385 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85074 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85284 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85205 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85368 resets, run finished after 1232 ms. (steps per millisecond=811 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85003 resets, run finished after 1162 ms. (steps per millisecond=860 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85174 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85071 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85119 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85054 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties (out of 16) seen :0
[2023-03-09 08:55:05] [INFO ] Invariant cache hit.
[2023-03-09 08:55:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:05] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 56 ms returned sat
[2023-03-09 08:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:05] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-09 08:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:55:06] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 56 ms returned sat
[2023-03-09 08:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:06] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2023-03-09 08:55:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:55:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 08:55:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 6035 ms returned unknown
[2023-03-09 08:55:13] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:13] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:13] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-09 08:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:55:13] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 57 ms returned sat
[2023-03-09 08:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:14] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2023-03-09 08:55:14] [INFO ] [Nat]Added 73 Read/Feed constraints in 113 ms returned sat
[2023-03-09 08:55:14] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 56 ms.
[2023-03-09 08:55:16] [INFO ] Added : 95 causal constraints over 20 iterations in 2420 ms. Result :sat
Minimization took 970 ms.
[2023-03-09 08:55:17] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:55:17] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:18] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-09 08:55:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:55:18] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-09 08:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:19] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2023-03-09 08:55:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 383 ms returned sat
[2023-03-09 08:55:19] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 08:55:24] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-09 08:55:24] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 1 ms to minimize.
[2023-03-09 08:55:24] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 0 ms to minimize.
[2023-03-09 08:55:25] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2023-03-09 08:55:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1283 ms
[2023-03-09 08:55:25] [INFO ] Added : 171 causal constraints over 35 iterations in 5799 ms. Result :sat
Minimization took 644 ms.
[2023-03-09 08:55:26] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:55:26] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 57 ms returned sat
[2023-03-09 08:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:26] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2023-03-09 08:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:26] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 41 ms returned sat
[2023-03-09 08:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:27] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-09 08:55:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 691 ms returned sat
[2023-03-09 08:55:28] [INFO ] Deduced a trap composed of 14 places in 314 ms of which 1 ms to minimize.
[2023-03-09 08:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-09 08:55:28] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 54 ms.
[2023-03-09 08:55:32] [INFO ] Added : 93 causal constraints over 20 iterations in 4185 ms. Result :sat
Minimization took 1011 ms.
[2023-03-09 08:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:33] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 43 ms returned sat
[2023-03-09 08:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:34] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2023-03-09 08:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:34] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-09 08:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:35] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2023-03-09 08:55:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 1453 ms returned sat
[2023-03-09 08:55:36] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2023-03-09 08:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-09 08:55:36] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 54 ms.
[2023-03-09 08:55:48] [INFO ] Added : 309 causal constraints over 62 iterations in 12082 ms. Result :sat
Minimization took 3001 ms.
[2023-03-09 08:55:51] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:55:51] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 61 ms returned sat
[2023-03-09 08:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:52] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-09 08:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:55:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:55:52] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-09 08:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:55:53] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2023-03-09 08:55:53] [INFO ] [Nat]Added 73 Read/Feed constraints in 255 ms returned sat
[2023-03-09 08:55:53] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 62 ms.
[2023-03-09 08:55:57] [INFO ] Deduced a trap composed of 14 places in 329 ms of which 1 ms to minimize.
[2023-03-09 08:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2023-03-09 08:55:57] [INFO ] Added : 133 causal constraints over 28 iterations in 3823 ms. Result :sat
Minimization took 2177 ms.
[2023-03-09 08:55:59] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:55:59] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 59 ms returned sat
[2023-03-09 08:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:00] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2023-03-09 08:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:00] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-09 08:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:01] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-09 08:56:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 08:56:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 3086 ms returned sat
[2023-03-09 08:56:04] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 1 ms to minimize.
[2023-03-09 08:56:04] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 1 ms to minimize.
[2023-03-09 08:56:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2023-03-09 08:56:04] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 58 ms.
[2023-03-09 08:56:09] [INFO ] Deduced a trap composed of 10 places in 372 ms of which 2 ms to minimize.
[2023-03-09 08:56:09] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2023-03-09 08:56:10] [INFO ] Deduced a trap composed of 20 places in 298 ms of which 1 ms to minimize.
[2023-03-09 08:56:10] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 1 ms to minimize.
[2023-03-09 08:56:10] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 1 ms to minimize.
[2023-03-09 08:56:11] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 0 ms to minimize.
[2023-03-09 08:56:11] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 1 ms to minimize.
[2023-03-09 08:56:12] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 1 ms to minimize.
[2023-03-09 08:56:12] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2023-03-09 08:56:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3393 ms
[2023-03-09 08:56:12] [INFO ] Added : 161 causal constraints over 33 iterations in 7714 ms. Result :sat
Minimization took 2442 ms.
[2023-03-09 08:56:15] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:15] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:15] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-09 08:56:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:56:15] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 45 ms returned sat
[2023-03-09 08:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:16] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-09 08:56:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 532 ms returned sat
[2023-03-09 08:56:16] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 39 ms.
[2023-03-09 08:56:22] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 1 ms to minimize.
[2023-03-09 08:56:22] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 1 ms to minimize.
[2023-03-09 08:56:22] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 1 ms to minimize.
[2023-03-09 08:56:23] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 3 ms to minimize.
[2023-03-09 08:56:23] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 0 ms to minimize.
[2023-03-09 08:56:23] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 1 ms to minimize.
[2023-03-09 08:56:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2195 ms
[2023-03-09 08:56:23] [INFO ] Added : 217 causal constraints over 44 iterations in 7172 ms. Result :sat
Minimization took 2172 ms.
[2023-03-09 08:56:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:56:26] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 08:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:26] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-09 08:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:56:27] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 53 ms returned sat
[2023-03-09 08:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:27] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-09 08:56:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 1337 ms returned sat
[2023-03-09 08:56:28] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 08:56:32] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 1 ms to minimize.
[2023-03-09 08:56:32] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 1 ms to minimize.
[2023-03-09 08:56:33] [INFO ] Deduced a trap composed of 15 places in 344 ms of which 1 ms to minimize.
[2023-03-09 08:56:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1319 ms
[2023-03-09 08:56:33] [INFO ] Added : 142 causal constraints over 29 iterations in 4365 ms. Result :sat
Minimization took 2231 ms.
[2023-03-09 08:56:35] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:35] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:36] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2023-03-09 08:56:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:56:36] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:36] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2023-03-09 08:56:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 531 ms returned sat
[2023-03-09 08:56:37] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 08:56:39] [INFO ] Deduced a trap composed of 12 places in 376 ms of which 3 ms to minimize.
[2023-03-09 08:56:39] [INFO ] Deduced a trap composed of 18 places in 368 ms of which 2 ms to minimize.
[2023-03-09 08:56:40] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 1 ms to minimize.
[2023-03-09 08:56:40] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 1 ms to minimize.
[2023-03-09 08:56:41] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 1 ms to minimize.
[2023-03-09 08:56:41] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 0 ms to minimize.
[2023-03-09 08:56:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2714 ms
[2023-03-09 08:56:41] [INFO ] Added : 88 causal constraints over 18 iterations in 4527 ms. Result :sat
Minimization took 1716 ms.
[2023-03-09 08:56:43] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:56:43] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-09 08:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:44] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2023-03-09 08:56:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:56:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:56:44] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 64 ms returned sat
[2023-03-09 08:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:56:44] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2023-03-09 08:56:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 492 ms returned sat
[2023-03-09 08:56:45] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 08:56:55] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2023-03-09 08:56:55] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:56:56] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 1 ms to minimize.
[2023-03-09 08:56:56] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 1 ms to minimize.
[2023-03-09 08:56:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1180 ms
[2023-03-09 08:56:56] [INFO ] Added : 226 causal constraints over 46 iterations in 11554 ms. Result :sat
Minimization took 2340 ms.
[2023-03-09 08:56:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:56:59] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 08:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:00] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2023-03-09 08:57:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:00] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 08:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:01] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2023-03-09 08:57:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 2985 ms returned sat
[2023-03-09 08:57:04] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 08:57:10] [INFO ] Added : 242 causal constraints over 49 iterations in 6292 ms. Result :sat
Minimization took 3015 ms.
[2023-03-09 08:57:13] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:57:13] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 53 ms returned sat
[2023-03-09 08:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:14] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-09 08:57:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:14] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 08:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:15] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2023-03-09 08:57:15] [INFO ] [Nat]Added 73 Read/Feed constraints in 889 ms returned sat
[2023-03-09 08:57:16] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-09 08:57:16] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2023-03-09 08:57:16] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 1 ms to minimize.
[2023-03-09 08:57:16] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 1 ms to minimize.
[2023-03-09 08:57:17] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2023-03-09 08:57:17] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 0 ms to minimize.
[2023-03-09 08:57:17] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 1 ms to minimize.
[2023-03-09 08:57:17] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 2 ms to minimize.
[2023-03-09 08:57:18] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 3 ms to minimize.
[2023-03-09 08:57:18] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 4 ms to minimize.
[2023-03-09 08:57:18] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2023-03-09 08:57:19] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 1 ms to minimize.
[2023-03-09 08:57:19] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2023-03-09 08:57:19] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 1 ms to minimize.
[2023-03-09 08:57:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3827 ms
[2023-03-09 08:57:19] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 61 ms.
[2023-03-09 08:57:30] [INFO ] Added : 187 causal constraints over 38 iterations in 11203 ms. Result :sat
Minimization took 2403 ms.
[2023-03-09 08:57:33] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:33] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:33] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-09 08:57:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:57:33] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 57 ms returned sat
[2023-03-09 08:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:34] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-09 08:57:34] [INFO ] [Nat]Added 73 Read/Feed constraints in 64 ms returned sat
[2023-03-09 08:57:34] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 55 ms.
[2023-03-09 08:57:36] [INFO ] Deduced a trap composed of 15 places in 374 ms of which 1 ms to minimize.
[2023-03-09 08:57:37] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 1 ms to minimize.
[2023-03-09 08:57:37] [INFO ] Deduced a trap composed of 8 places in 390 ms of which 1 ms to minimize.
[2023-03-09 08:57:38] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 1 ms to minimize.
[2023-03-09 08:57:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1699 ms
[2023-03-09 08:57:38] [INFO ] Added : 91 causal constraints over 20 iterations in 3980 ms. Result :sat
Minimization took 1386 ms.
[2023-03-09 08:57:39] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:39] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 08:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:40] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-09 08:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 08:57:40] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 60 ms returned sat
[2023-03-09 08:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:40] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-09 08:57:40] [INFO ] [Nat]Added 73 Read/Feed constraints in 55 ms returned sat
[2023-03-09 08:57:41] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 54 ms.
[2023-03-09 08:57:42] [INFO ] Deduced a trap composed of 15 places in 344 ms of which 1 ms to minimize.
[2023-03-09 08:57:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2023-03-09 08:57:42] [INFO ] Added : 63 causal constraints over 15 iterations in 1545 ms. Result :sat
Minimization took 1000 ms.
[2023-03-09 08:57:43] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:57:43] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 08:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:44] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2023-03-09 08:57:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:57:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:57:44] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 08:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:57:45] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2023-03-09 08:57:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 2829 ms returned sat
[2023-03-09 08:57:48] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2023-03-09 08:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-09 08:57:48] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 61 ms.
[2023-03-09 08:58:06] [INFO ] Added : 301 causal constraints over 61 iterations in 17807 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Applied a total of 0 rules in 17 ms. Remains 458 /458 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 458/458 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Applied a total of 0 rules in 15 ms. Remains 458 /458 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2023-03-09 09:00:14] [INFO ] Invariant cache hit.
[2023-03-09 09:00:15] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-09 09:00:15] [INFO ] Invariant cache hit.
[2023-03-09 09:00:15] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:00:46] [INFO ] Performed 409/458 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:00:51] [INFO ] Implicit Places using invariants and state equation in 35812 ms returned []
Implicit Place search using SMT with State Equation took 36774 ms to find 0 implicit places.
[2023-03-09 09:00:51] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-09 09:00:51] [INFO ] Invariant cache hit.
[2023-03-09 09:00:51] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37323 ms. Remains : 458/458 places, 459/459 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
[2023-03-09 09:00:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 09:00:51] [INFO ] Invariant cache hit.
[2023-03-09 09:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:00:51] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 09:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:00:52] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-09 09:00:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:00:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:00:52] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 09:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:00:53] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-09 09:00:53] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:00:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 09:00:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 4201 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 447 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 449
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 446 transition count 444
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 33 place count 441 transition count 444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 37 place count 441 transition count 444
Applied a total of 37 rules in 110 ms. Remains 441 /458 variables (removed 17) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 441/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 441 cols
[2023-03-09 09:00:57] [INFO ] Computed 75 place invariants in 72 ms
Incomplete random walk after 1000000 steps, including 129654 resets, run finished after 1206 ms. (steps per millisecond=829 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85105 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 1) seen :0
[2023-03-09 09:00:59] [INFO ] Invariant cache hit.
[2023-03-09 09:00:59] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:00:59] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 33 ms returned sat
[2023-03-09 09:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:01:00] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2023-03-09 09:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:01:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:01:01] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 09:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:01:02] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2023-03-09 09:01:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:01:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 09:01:06] [INFO ] [Nat]Added 80 Read/Feed constraints in 3943 ms returned sat
[2023-03-09 09:01:06] [INFO ] Computed and/alt/rep : 342/2204/342 causal constraints (skipped 101 transitions) in 36 ms.
[2023-03-09 09:01:22] [INFO ] Added : 230 causal constraints over 46 iterations in 15820 ms. Result :sat
Minimization took 3009 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 444/444 transitions.
Applied a total of 0 rules in 15 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 441/441 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 444/444 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:01:25] [INFO ] Invariant cache hit.
[2023-03-09 09:01:26] [INFO ] Implicit Places using invariants in 1624 ms returned [51, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 247, 253]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1638 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/441 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 428 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 420 transition count 436
Applied a total of 16 rules in 26 ms. Remains 420 /428 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-09 09:01:26] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 09:01:27] [INFO ] Implicit Places using invariants in 605 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-09 09:01:27] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 09:01:27] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:01:41] [INFO ] Implicit Places using invariants and state equation in 14105 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 14717 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/441 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 25 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:01:41] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 09:01:42] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:01:42] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:01:42] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:02:12] [INFO ] Performed 376/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:02:14] [INFO ] Implicit Places using invariants and state equation in 32671 ms returned []
Implicit Place search using SMT with State Equation took 33173 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/441 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 49609 ms. Remains : 417/441 places, 434/444 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:02:14] [INFO ] Invariants computation overflowed in 57 ms
Incomplete random walk after 1000000 steps, including 144334 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91487 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:02:16] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:02:16] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-09 09:02:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:02:17] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2023-03-09 09:02:17] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:02:20] [INFO ] [Nat]Added 80 Read/Feed constraints in 2507 ms returned sat
[2023-03-09 09:02:20] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-09 09:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-09 09:02:20] [INFO ] Computed and/alt/rep : 326/2143/326 causal constraints (skipped 107 transitions) in 34 ms.
[2023-03-09 09:02:31] [INFO ] Added : 160 causal constraints over 32 iterations in 10685 ms. Result :sat
Minimization took 2326 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:03:03] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:03:04] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:03:04] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 09:03:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:03:32] [INFO ] Implicit Places using invariants and state equation in 28369 ms returned []
Implicit Place search using SMT with State Equation took 28870 ms to find 0 implicit places.
[2023-03-09 09:03:32] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:03:32] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 09:03:32] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29283 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 161141 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:03:33] [INFO ] Computed 75 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 1280 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 09:03:33] [INFO ] Invariant cache hit.
[2023-03-09 09:03:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:03:33] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 09:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:33] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-09 09:03:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:03:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 09:03:33] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 52 ms returned sat
[2023-03-09 09:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:34] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-09 09:03:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:03:34] [INFO ] [Nat]Added 73 Read/Feed constraints in 107 ms returned sat
[2023-03-09 09:03:34] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 51 ms.
[2023-03-09 09:03:36] [INFO ] Added : 95 causal constraints over 20 iterations in 2390 ms. Result :sat
Minimization took 989 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 81 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:03:37] [INFO ] Computed 75 place invariants in 58 ms
Incomplete random walk after 1000000 steps, including 129415 resets, run finished after 1175 ms. (steps per millisecond=851 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85094 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
[2023-03-09 09:03:40] [INFO ] Invariant cache hit.
[2023-03-09 09:03:40] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-09 09:03:40] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 51 ms returned sat
[2023-03-09 09:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:40] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-09 09:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:03:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-09 09:03:40] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 46 ms returned sat
[2023-03-09 09:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:41] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2023-03-09 09:03:41] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:03:41] [INFO ] [Nat]Added 84 Read/Feed constraints in 73 ms returned sat
[2023-03-09 09:03:41] [INFO ] Computed and/alt/rep : 340/2216/340 causal constraints (skipped 103 transitions) in 47 ms.
[2023-03-09 09:03:43] [INFO ] Deduced a trap composed of 122 places in 532 ms of which 1 ms to minimize.
[2023-03-09 09:03:44] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2023-03-09 09:03:45] [INFO ] Deduced a trap composed of 12 places in 551 ms of which 1 ms to minimize.
[2023-03-09 09:03:46] [INFO ] Deduced a trap composed of 14 places in 532 ms of which 1 ms to minimize.
[2023-03-09 09:03:46] [INFO ] Deduced a trap composed of 115 places in 466 ms of which 0 ms to minimize.
[2023-03-09 09:03:47] [INFO ] Deduced a trap composed of 129 places in 371 ms of which 1 ms to minimize.
[2023-03-09 09:03:47] [INFO ] Deduced a trap composed of 133 places in 371 ms of which 0 ms to minimize.
[2023-03-09 09:03:48] [INFO ] Deduced a trap composed of 136 places in 388 ms of which 1 ms to minimize.
[2023-03-09 09:03:48] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 1 ms to minimize.
[2023-03-09 09:03:51] [INFO ] Deduced a trap composed of 117 places in 348 ms of which 1 ms to minimize.
[2023-03-09 09:03:52] [INFO ] Deduced a trap composed of 133 places in 376 ms of which 0 ms to minimize.
[2023-03-09 09:03:52] [INFO ] Deduced a trap composed of 119 places in 378 ms of which 1 ms to minimize.
[2023-03-09 09:03:52] [INFO ] Deduced a trap composed of 108 places in 323 ms of which 1 ms to minimize.
[2023-03-09 09:03:54] [INFO ] Deduced a trap composed of 123 places in 372 ms of which 1 ms to minimize.
[2023-03-09 09:03:55] [INFO ] Deduced a trap composed of 113 places in 348 ms of which 1 ms to minimize.
[2023-03-09 09:03:55] [INFO ] Deduced a trap composed of 111 places in 357 ms of which 0 ms to minimize.
[2023-03-09 09:03:56] [INFO ] Deduced a trap composed of 121 places in 341 ms of which 1 ms to minimize.
[2023-03-09 09:03:56] [INFO ] Deduced a trap composed of 119 places in 365 ms of which 0 ms to minimize.
[2023-03-09 09:03:56] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13550 ms
[2023-03-09 09:03:57] [INFO ] Added : 91 causal constraints over 19 iterations in 15956 ms. Result :sat
Minimization took 2096 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 16 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:03:59] [INFO ] Invariant cache hit.
[2023-03-09 09:04:00] [INFO ] Implicit Places using invariants in 1439 ms returned [50, 74, 96, 101, 121, 127, 148, 153, 154, 174, 179, 247, 253]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1450 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 427 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 419 transition count 436
Applied a total of 16 rules in 30 ms. Remains 419 /427 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:04:00] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-09 09:04:01] [INFO ] Implicit Places using invariants in 708 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:04:01] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-09 09:04:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:04:31] [INFO ] Implicit Places using invariants and state equation in 30256 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30982 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/440 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 24 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:04:31] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 09:04:32] [INFO ] Implicit Places using invariants in 737 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:04:32] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 09:04:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:05:03] [INFO ] Performed 271/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:05:25] [INFO ] Implicit Places using invariants and state equation in 52925 ms returned []
Implicit Place search using SMT with State Equation took 53664 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 86163 ms. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:05:25] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144130 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91343 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:05:27] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:28] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2023-03-09 09:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:28] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2023-03-09 09:05:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:05:29] [INFO ] [Nat]Added 84 Read/Feed constraints in 286 ms returned sat
[2023-03-09 09:05:29] [INFO ] Computed and/alt/rep : 325/2163/325 causal constraints (skipped 108 transitions) in 34 ms.
[2023-03-09 09:05:33] [INFO ] Added : 70 causal constraints over 14 iterations in 4404 ms. Result :sat
Minimization took 605 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:05:34] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:05:35] [INFO ] Implicit Places using invariants in 635 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:05:35] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 09:05:35] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:06:01] [INFO ] Implicit Places using invariants and state equation in 26417 ms returned []
Implicit Place search using SMT with State Equation took 27055 ms to find 0 implicit places.
[2023-03-09 09:06:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:06:01] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 09:06:01] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27508 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 148889 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:06:01] [INFO ] Computed 75 place invariants in 95 ms
Incomplete random walk after 10000 steps, including 1308 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-09 09:06:02] [INFO ] Invariant cache hit.
[2023-03-09 09:06:02] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 09:06:02] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 53 ms returned sat
[2023-03-09 09:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:02] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2023-03-09 09:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:06:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:06:02] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 09:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:03] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2023-03-09 09:06:03] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:06:03] [INFO ] [Nat]Added 73 Read/Feed constraints in 428 ms returned sat
[2023-03-09 09:06:04] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-09 09:06:07] [INFO ] Added : 157 causal constraints over 32 iterations in 3879 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 446 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 445 transition count 449
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 445 transition count 444
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 79 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:06:13] [INFO ] Computed 75 place invariants in 82 ms
Incomplete random walk after 1000000 steps, including 129319 resets, run finished after 1200 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85189 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 1) seen :0
[2023-03-09 09:06:15] [INFO ] Invariant cache hit.
[2023-03-09 09:06:15] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-09 09:06:15] [INFO ] [Real]Absence check using 4 positive and 71 generalized place invariants in 32 ms returned sat
[2023-03-09 09:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:15] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-09 09:06:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:06:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-09 09:06:16] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 48 ms returned sat
[2023-03-09 09:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:16] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2023-03-09 09:06:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:06:16] [INFO ] [Nat]Added 84 Read/Feed constraints in 241 ms returned sat
[2023-03-09 09:06:16] [INFO ] Computed and/alt/rep : 343/2235/343 causal constraints (skipped 100 transitions) in 36 ms.
[2023-03-09 09:06:22] [INFO ] Added : 150 causal constraints over 31 iterations in 6179 ms. Result :sat
Minimization took 1053 ms.
Current structural bounds on expressions (after SMT) : [11] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:06:25] [INFO ] Invariant cache hit.
[2023-03-09 09:06:26] [INFO ] Implicit Places using invariants in 1385 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 179, 247, 253]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1400 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 428 transition count 437
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 421 transition count 437
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 421 transition count 437
Applied a total of 15 rules in 65 ms. Remains 421 /428 variables (removed 7) and now considering 437/444 (removed 7) transitions.
// Phase 1: matrix 437 rows 421 cols
[2023-03-09 09:06:26] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 09:06:27] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2023-03-09 09:06:27] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 09:06:27] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:06:56] [INFO ] Implicit Places using invariants and state equation in 29523 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30190 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 420/440 places, 437/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 420 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 418 transition count 435
Applied a total of 4 rules in 20 ms. Remains 418 /420 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:06:57] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 09:06:57] [INFO ] Implicit Places using invariants in 660 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:06:57] [INFO ] Invariants computation overflowed in 94 ms
[2023-03-09 09:06:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:07:20] [INFO ] Implicit Places using invariants and state equation in 23306 ms returned []
Implicit Place search using SMT with State Equation took 23968 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/440 places, 435/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55658 ms. Remains : 418/440 places, 435/444 transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:07:21] [INFO ] Invariants computation overflowed in 58 ms
Incomplete random walk after 1000000 steps, including 144196 resets, run finished after 1223 ms. (steps per millisecond=817 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91336 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:07:23] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-09 09:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:07:23] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2023-03-09 09:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:07:24] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2023-03-09 09:07:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:07:25] [INFO ] [Nat]Added 84 Read/Feed constraints in 370 ms returned sat
[2023-03-09 09:07:25] [INFO ] Deduced a trap composed of 123 places in 455 ms of which 1 ms to minimize.
[2023-03-09 09:07:26] [INFO ] Deduced a trap composed of 121 places in 469 ms of which 1 ms to minimize.
[2023-03-09 09:07:26] [INFO ] Deduced a trap composed of 126 places in 448 ms of which 1 ms to minimize.
[2023-03-09 09:07:27] [INFO ] Deduced a trap composed of 122 places in 467 ms of which 1 ms to minimize.
[2023-03-09 09:07:28] [INFO ] Deduced a trap composed of 125 places in 440 ms of which 1 ms to minimize.
[2023-03-09 09:07:28] [INFO ] Deduced a trap composed of 132 places in 401 ms of which 1 ms to minimize.
[2023-03-09 09:07:29] [INFO ] Deduced a trap composed of 128 places in 460 ms of which 1 ms to minimize.
[2023-03-09 09:07:29] [INFO ] Deduced a trap composed of 118 places in 479 ms of which 1 ms to minimize.
[2023-03-09 09:07:30] [INFO ] Deduced a trap composed of 130 places in 484 ms of which 1 ms to minimize.
[2023-03-09 09:07:30] [INFO ] Deduced a trap composed of 22 places in 427 ms of which 1 ms to minimize.
[2023-03-09 09:07:31] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 1 ms to minimize.
[2023-03-09 09:07:31] [INFO ] Deduced a trap composed of 19 places in 432 ms of which 0 ms to minimize.
[2023-03-09 09:07:32] [INFO ] Deduced a trap composed of 120 places in 413 ms of which 1 ms to minimize.
[2023-03-09 09:07:32] [INFO ] Deduced a trap composed of 133 places in 420 ms of which 0 ms to minimize.
[2023-03-09 09:07:33] [INFO ] Deduced a trap composed of 118 places in 399 ms of which 1 ms to minimize.
[2023-03-09 09:07:33] [INFO ] Deduced a trap composed of 121 places in 417 ms of which 1 ms to minimize.
[2023-03-09 09:07:34] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 1 ms to minimize.
[2023-03-09 09:07:34] [INFO ] Deduced a trap composed of 130 places in 399 ms of which 0 ms to minimize.
[2023-03-09 09:07:35] [INFO ] Deduced a trap composed of 123 places in 397 ms of which 1 ms to minimize.
[2023-03-09 09:07:35] [INFO ] Deduced a trap composed of 132 places in 428 ms of which 1 ms to minimize.
[2023-03-09 09:07:36] [INFO ] Deduced a trap composed of 120 places in 417 ms of which 1 ms to minimize.
[2023-03-09 09:07:36] [INFO ] Deduced a trap composed of 124 places in 452 ms of which 1 ms to minimize.
[2023-03-09 09:07:37] [INFO ] Deduced a trap composed of 126 places in 424 ms of which 4 ms to minimize.
[2023-03-09 09:07:38] [INFO ] Deduced a trap composed of 134 places in 402 ms of which 1 ms to minimize.
[2023-03-09 09:07:38] [INFO ] Deduced a trap composed of 123 places in 411 ms of which 1 ms to minimize.
[2023-03-09 09:07:39] [INFO ] Deduced a trap composed of 136 places in 388 ms of which 1 ms to minimize.
[2023-03-09 09:07:39] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 1 ms to minimize.
[2023-03-09 09:07:40] [INFO ] Deduced a trap composed of 122 places in 411 ms of which 1 ms to minimize.
[2023-03-09 09:07:40] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 15341 ms
[2023-03-09 09:07:40] [INFO ] Computed and/alt/rep : 328/2173/328 causal constraints (skipped 106 transitions) in 47 ms.
[2023-03-09 09:07:48] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 1 ms to minimize.
[2023-03-09 09:07:48] [INFO ] Deduced a trap composed of 112 places in 437 ms of which 1 ms to minimize.
[2023-03-09 09:07:49] [INFO ] Deduced a trap composed of 117 places in 471 ms of which 1 ms to minimize.
[2023-03-09 09:07:49] [INFO ] Deduced a trap composed of 110 places in 437 ms of which 1 ms to minimize.
[2023-03-09 09:07:50] [INFO ] Deduced a trap composed of 115 places in 398 ms of which 0 ms to minimize.
[2023-03-09 09:07:50] [INFO ] Deduced a trap composed of 116 places in 399 ms of which 1 ms to minimize.
[2023-03-09 09:07:51] [INFO ] Deduced a trap composed of 120 places in 390 ms of which 1 ms to minimize.
[2023-03-09 09:07:51] [INFO ] Deduced a trap composed of 133 places in 387 ms of which 1 ms to minimize.
[2023-03-09 09:07:52] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 1 ms to minimize.
[2023-03-09 09:07:52] [INFO ] Deduced a trap composed of 126 places in 464 ms of which 1 ms to minimize.
[2023-03-09 09:07:53] [INFO ] Deduced a trap composed of 122 places in 458 ms of which 1 ms to minimize.
[2023-03-09 09:07:53] [INFO ] Deduced a trap composed of 130 places in 468 ms of which 1 ms to minimize.
[2023-03-09 09:07:54] [INFO ] Deduced a trap composed of 118 places in 459 ms of which 1 ms to minimize.
[2023-03-09 09:07:54] [INFO ] Deduced a trap composed of 118 places in 427 ms of which 1 ms to minimize.
[2023-03-09 09:07:55] [INFO ] Deduced a trap composed of 123 places in 438 ms of which 1 ms to minimize.
[2023-03-09 09:07:55] [INFO ] Deduced a trap composed of 120 places in 390 ms of which 1 ms to minimize.
[2023-03-09 09:07:56] [INFO ] Deduced a trap composed of 124 places in 459 ms of which 1 ms to minimize.
[2023-03-09 09:07:56] [INFO ] Deduced a trap composed of 121 places in 432 ms of which 1 ms to minimize.
[2023-03-09 09:07:57] [INFO ] Deduced a trap composed of 127 places in 427 ms of which 1 ms to minimize.
[2023-03-09 09:07:57] [INFO ] Deduced a trap composed of 128 places in 385 ms of which 1 ms to minimize.
[2023-03-09 09:07:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 9976 ms
[2023-03-09 09:07:57] [INFO ] Added : 123 causal constraints over 25 iterations in 17258 ms. Result :sat
Minimization took 3013 ms.
Current structural bounds on expressions (after SMT) : [11] Max seen :[0]
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 11 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 418/418 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:08:00] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 09:08:01] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:08:01] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-09 09:08:01] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:08:11] [INFO ] Implicit Places using invariants and state equation in 10462 ms returned []
Implicit Place search using SMT with State Equation took 10999 ms to find 0 implicit places.
[2023-03-09 09:08:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:08:11] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 09:08:12] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11392 ms. Remains : 418/418 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 130286 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:08:12] [INFO ] Computed 75 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 1318 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 810 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 09:08:12] [INFO ] Invariant cache hit.
[2023-03-09 09:08:12] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:08:12] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 09:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:08:12] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-09 09:08:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:08:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 09:08:13] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 57 ms returned sat
[2023-03-09 09:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:08:13] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-09 09:08:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:08:14] [INFO ] [Nat]Added 73 Read/Feed constraints in 898 ms returned sat
[2023-03-09 09:08:14] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2023-03-09 09:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-09 09:08:14] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 55 ms.
[2023-03-09 09:08:17] [INFO ] Added : 74 causal constraints over 16 iterations in 3074 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 456 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 455 transition count 455
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 76 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:08:18] [INFO ] Computed 75 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 129609 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85253 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 1) seen :0
[2023-03-09 09:08:19] [INFO ] Invariant cache hit.
[2023-03-09 09:08:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-09 09:08:20] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 33 ms returned sat
[2023-03-09 09:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:08:20] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-09 09:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:08:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-09 09:08:20] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 52 ms returned sat
[2023-03-09 09:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:08:21] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2023-03-09 09:08:21] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-09 09:08:21] [INFO ] [Nat]Added 83 Read/Feed constraints in 121 ms returned sat
[2023-03-09 09:08:21] [INFO ] Computed and/alt/rep : 340/2231/340 causal constraints (skipped 103 transitions) in 51 ms.
[2023-03-09 09:08:24] [INFO ] Deduced a trap composed of 21 places in 529 ms of which 1 ms to minimize.
[2023-03-09 09:08:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2023-03-09 09:08:24] [INFO ] Added : 95 causal constraints over 22 iterations in 3593 ms. Result :sat
Minimization took 1634 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:08:26] [INFO ] Invariant cache hit.
[2023-03-09 09:08:28] [INFO ] Implicit Places using invariants in 1805 ms returned [50, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 247, 253]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1823 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 427 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 419 transition count 436
Applied a total of 16 rules in 33 ms. Remains 419 /427 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:08:28] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-09 09:08:29] [INFO ] Implicit Places using invariants in 774 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:08:29] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-09 09:08:29] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-09 09:08:59] [INFO ] Implicit Places using invariants and state equation in 29931 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30727 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/440 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 19 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:08:59] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:08:59] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:08:59] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 09:09:00] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-09 09:09:29] [INFO ] Implicit Places using invariants and state equation in 30303 ms returned []
Implicit Place search using SMT with State Equation took 30762 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63377 ms. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:09:29] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144241 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91394 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:09:31] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:09:32] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-09 09:09:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:09:32] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2023-03-09 09:09:32] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-09 09:09:33] [INFO ] [Nat]Added 83 Read/Feed constraints in 349 ms returned sat
[2023-03-09 09:09:33] [INFO ] Computed and/alt/rep : 324/2168/324 causal constraints (skipped 109 transitions) in 69 ms.
[2023-03-09 09:09:35] [INFO ] Added : 57 causal constraints over 12 iterations in 1866 ms. Result :sat
Minimization took 1890 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:09:37] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 09:09:37] [INFO ] Implicit Places using invariants in 750 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:09:37] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 09:09:38] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-09 09:10:05] [INFO ] Implicit Places using invariants and state equation in 27559 ms returned []
Implicit Place search using SMT with State Equation took 28321 ms to find 0 implicit places.
[2023-03-09 09:10:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:10:05] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:10:05] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28717 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 113721 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-04
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:10:05] [INFO ] Computed 75 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 1318 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 09:10:05] [INFO ] Invariant cache hit.
[2023-03-09 09:10:06] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 09:10:06] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 45 ms returned sat
[2023-03-09 09:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:10:06] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2023-03-09 09:10:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:10:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-09 09:10:07] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 09:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:10:07] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-09 09:10:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:10:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 1396 ms returned sat
[2023-03-09 09:10:09] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2023-03-09 09:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 09:10:09] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 34 ms.
[2023-03-09 09:10:11] [INFO ] Added : 95 causal constraints over 19 iterations in 2820 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 105 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:10:12] [INFO ] Invariants computation overflowed in 54 ms
Incomplete random walk after 1000000 steps, including 129308 resets, run finished after 1307 ms. (steps per millisecond=765 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85288 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:10:14] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:10:14] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-09 09:10:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:10:15] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2023-03-09 09:10:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:10:16] [INFO ] [Nat]Added 84 Read/Feed constraints in 1022 ms returned sat
[2023-03-09 09:10:16] [INFO ] Computed and/alt/rep : 340/2216/340 causal constraints (skipped 103 transitions) in 35 ms.
[2023-03-09 09:10:24] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 1 ms to minimize.
[2023-03-09 09:10:25] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 1 ms to minimize.
[2023-03-09 09:10:25] [INFO ] Deduced a trap composed of 18 places in 451 ms of which 1 ms to minimize.
[2023-03-09 09:10:26] [INFO ] Deduced a trap composed of 17 places in 504 ms of which 1 ms to minimize.
[2023-03-09 09:10:26] [INFO ] Deduced a trap composed of 24 places in 480 ms of which 1 ms to minimize.
[2023-03-09 09:10:27] [INFO ] Deduced a trap composed of 26 places in 513 ms of which 1 ms to minimize.
[2023-03-09 09:10:28] [INFO ] Deduced a trap composed of 28 places in 515 ms of which 1 ms to minimize.
[2023-03-09 09:10:28] [INFO ] Deduced a trap composed of 34 places in 490 ms of which 1 ms to minimize.
[2023-03-09 09:10:29] [INFO ] Deduced a trap composed of 15 places in 513 ms of which 1 ms to minimize.
[2023-03-09 09:10:29] [INFO ] Deduced a trap composed of 22 places in 467 ms of which 0 ms to minimize.
[2023-03-09 09:10:30] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 1 ms to minimize.
[2023-03-09 09:10:30] [INFO ] Deduced a trap composed of 136 places in 465 ms of which 1 ms to minimize.
[2023-03-09 09:10:31] [INFO ] Deduced a trap composed of 136 places in 514 ms of which 1 ms to minimize.
[2023-03-09 09:10:32] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 1 ms to minimize.
[2023-03-09 09:10:32] [INFO ] Deduced a trap composed of 118 places in 506 ms of which 1 ms to minimize.
[2023-03-09 09:10:33] [INFO ] Deduced a trap composed of 92 places in 448 ms of which 1 ms to minimize.
[2023-03-09 09:10:34] [INFO ] Deduced a trap composed of 31 places in 436 ms of which 1 ms to minimize.
[2023-03-09 09:10:34] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 1 ms to minimize.
[2023-03-09 09:10:35] [INFO ] Deduced a trap composed of 48 places in 467 ms of which 0 ms to minimize.
[2023-03-09 09:10:35] [INFO ] Deduced a trap composed of 80 places in 446 ms of which 0 ms to minimize.
[2023-03-09 09:10:36] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2023-03-09 09:10:36] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
[2023-03-09 09:10:37] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-09 09:10:37] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 0 ms to minimize.
[2023-03-09 09:10:37] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2023-03-09 09:10:38] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 1 ms to minimize.
[2023-03-09 09:10:38] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2023-03-09 09:10:38] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 1 ms to minimize.
[2023-03-09 09:10:38] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2023-03-09 09:10:39] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2023-03-09 09:10:39] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 0 ms to minimize.
[2023-03-09 09:10:39] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2023-03-09 09:10:40] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2023-03-09 09:10:40] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2023-03-09 09:10:40] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2023-03-09 09:10:40] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 0 ms to minimize.
[2023-03-09 09:10:41] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 0 ms to minimize.
[2023-03-09 09:10:41] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 1 ms to minimize.
[2023-03-09 09:10:41] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2023-03-09 09:10:41] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2023-03-09 09:10:42] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2023-03-09 09:10:42] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2023-03-09 09:10:42] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 18332 ms
[2023-03-09 09:10:42] [INFO ] Added : 245 causal constraints over 49 iterations in 26082 ms.(timeout) Result :sat
Minimization took 3006 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:10:45] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:10:46] [INFO ] Implicit Places using invariants in 736 ms returned []
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:10:46] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-09 09:10:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:11:17] [INFO ] Performed 437/440 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 09:11:17] [INFO ] Implicit Places using invariants and state equation in 30697 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31448 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 439 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 437 transition count 442
Applied a total of 4 rules in 21 ms. Remains 437 /439 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 437 cols
[2023-03-09 09:11:17] [INFO ] Computed 74 place invariants in 49 ms
[2023-03-09 09:11:19] [INFO ] Implicit Places using invariants in 1734 ms returned [48, 72, 93, 98, 118, 124, 145, 150, 151, 171, 176, 244, 250]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1749 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/440 places, 442/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 424 transition count 434
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 416 transition count 434
Applied a total of 16 rules in 29 ms. Remains 416 /424 variables (removed 8) and now considering 434/442 (removed 8) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:11:19] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 09:11:19] [INFO ] Implicit Places using invariants in 653 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:11:19] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 09:11:20] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:11:46] [INFO ] Implicit Places using invariants and state equation in 26569 ms returned []
Implicit Place search using SMT with State Equation took 27223 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60481 ms. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:11:46] [INFO ] Invariants computation overflowed in 35 ms
Incomplete random walk after 1000000 steps, including 144312 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91722 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:11:48] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:11:48] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-09 09:11:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:11:49] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2023-03-09 09:11:49] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:11:51] [INFO ] [Nat]Added 84 Read/Feed constraints in 1261 ms returned sat
[2023-03-09 09:11:51] [INFO ] Computed and/alt/rep : 324/2153/324 causal constraints (skipped 109 transitions) in 32 ms.
[2023-03-09 09:12:02] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-09 09:12:02] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
[2023-03-09 09:12:02] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2023-03-09 09:12:02] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 0 ms to minimize.
[2023-03-09 09:12:03] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2023-03-09 09:12:03] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 1 ms to minimize.
[2023-03-09 09:12:05] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-09 09:12:06] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 0 ms to minimize.
[2023-03-09 09:12:07] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2023-03-09 09:12:07] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 0 ms to minimize.
[2023-03-09 09:12:07] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 1 ms to minimize.
[2023-03-09 09:12:08] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
[2023-03-09 09:12:08] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 1 ms to minimize.
[2023-03-09 09:12:08] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 1 ms to minimize.
[2023-03-09 09:12:09] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
[2023-03-09 09:12:09] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-09 09:12:09] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2023-03-09 09:12:10] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2023-03-09 09:12:10] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2023-03-09 09:12:10] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2023-03-09 09:12:11] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2023-03-09 09:12:11] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 0 ms to minimize.
[2023-03-09 09:12:11] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 0 ms to minimize.
[2023-03-09 09:12:11] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 0 ms to minimize.
[2023-03-09 09:12:12] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2023-03-09 09:12:12] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2023-03-09 09:12:13] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 0 ms to minimize.
[2023-03-09 09:12:13] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2023-03-09 09:12:13] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 11369 ms
[2023-03-09 09:12:13] [INFO ] Added : 265 causal constraints over 53 iterations in 22196 ms.(timeout) Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:12:16] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:12:17] [INFO ] Implicit Places using invariants in 616 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:12:17] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 09:12:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:12:44] [INFO ] Implicit Places using invariants and state equation in 27084 ms returned []
Implicit Place search using SMT with State Equation took 27719 ms to find 0 implicit places.
[2023-03-09 09:12:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:12:44] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 09:12:44] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28083 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-04 in 158687 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:12:44] [INFO ] Computed 75 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 09:12:44] [INFO ] Invariant cache hit.
[2023-03-09 09:12:44] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 09:12:44] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 60 ms returned sat
[2023-03-09 09:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:12:45] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-09 09:12:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:12:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:12:45] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 34 ms returned sat
[2023-03-09 09:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:12:46] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2023-03-09 09:12:46] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:12:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 368 ms returned sat
[2023-03-09 09:12:46] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 40 ms.
[2023-03-09 09:12:50] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 1 ms to minimize.
[2023-03-09 09:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-09 09:12:51] [INFO ] Deduced a trap composed of 9 places in 453 ms of which 1 ms to minimize.
[2023-03-09 09:12:51] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 446 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 445 transition count 449
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 445 transition count 444
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 128 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:12:51] [INFO ] Invariants computation overflowed in 95 ms
Incomplete random walk after 1000000 steps, including 129457 resets, run finished after 1575 ms. (steps per millisecond=634 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85034 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:12:53] [INFO ] Invariants computation overflowed in 126 ms
[2023-03-09 09:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:12:55] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2023-03-09 09:12:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:12:55] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2023-03-09 09:12:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:12:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 232 ms returned sat
[2023-03-09 09:12:55] [INFO ] Computed and/alt/rep : 343/2235/343 causal constraints (skipped 100 transitions) in 52 ms.
[2023-03-09 09:13:00] [INFO ] Added : 102 causal constraints over 21 iterations in 4223 ms. Result :sat
Minimization took 1580 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 9 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:13:01] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 09:13:02] [INFO ] Implicit Places using invariants in 798 ms returned []
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:13:02] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-09 09:13:03] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:13:33] [INFO ] Performed 416/440 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-09 09:13:35] [INFO ] Implicit Places using invariants and state equation in 32295 ms returned [13, 148]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 33098 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 438/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 438 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 436 transition count 442
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 436 transition count 442
Applied a total of 5 rules in 29 ms. Remains 436 /438 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 436 cols
[2023-03-09 09:13:35] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 09:13:35] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 442 rows 436 cols
[2023-03-09 09:13:35] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-09 09:13:35] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:13:54] [INFO ] Implicit Places using invariants and state equation in 18409 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 18964 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 435/440 places, 442/444 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 442
Applied a total of 1 rules in 19 ms. Remains 435 /435 variables (removed 0) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:13:54] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 09:13:54] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:13:54] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:13:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:14:23] [INFO ] Implicit Places using invariants and state equation in 29295 ms returned []
Implicit Place search using SMT with State Equation took 29851 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 435/440 places, 442/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 81974 ms. Remains : 435/440 places, 442/444 transitions.
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:14:23] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 129450 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85409 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :0
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:14:25] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:14:26] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-09 09:14:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:14:26] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-09 09:14:26] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:14:27] [INFO ] [Nat]Added 84 Read/Feed constraints in 288 ms returned sat
[2023-03-09 09:14:27] [INFO ] Computed and/alt/rep : 339/2215/339 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-09 09:14:30] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 1 ms to minimize.
[2023-03-09 09:14:31] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 1 ms to minimize.
[2023-03-09 09:14:31] [INFO ] Deduced a trap composed of 12 places in 490 ms of which 1 ms to minimize.
[2023-03-09 09:14:32] [INFO ] Deduced a trap composed of 138 places in 331 ms of which 0 ms to minimize.
[2023-03-09 09:14:32] [INFO ] Deduced a trap composed of 140 places in 291 ms of which 1 ms to minimize.
[2023-03-09 09:14:32] [INFO ] Deduced a trap composed of 141 places in 346 ms of which 1 ms to minimize.
[2023-03-09 09:14:33] [INFO ] Deduced a trap composed of 142 places in 343 ms of which 0 ms to minimize.
[2023-03-09 09:14:33] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 0 ms to minimize.
[2023-03-09 09:14:34] [INFO ] Deduced a trap composed of 136 places in 343 ms of which 0 ms to minimize.
[2023-03-09 09:14:34] [INFO ] Deduced a trap composed of 140 places in 337 ms of which 1 ms to minimize.
[2023-03-09 09:14:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5012 ms
[2023-03-09 09:14:35] [INFO ] Added : 151 causal constraints over 31 iterations in 7997 ms. Result :sat
Minimization took 1943 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 442/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 435 /435 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 435/435 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 442/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 435 /435 variables (removed 0) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:14:37] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:14:38] [INFO ] Implicit Places using invariants in 740 ms returned []
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:14:38] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:14:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:15:05] [INFO ] Implicit Places using invariants and state equation in 27363 ms returned []
Implicit Place search using SMT with State Equation took 28109 ms to find 0 implicit places.
[2023-03-09 09:15:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 442 rows 435 cols
[2023-03-09 09:15:05] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:15:05] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28474 ms. Remains : 435/435 places, 442/442 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 141287 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
[2023-03-09 09:15:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 09:15:05] [INFO ] Invariant cache hit.
[2023-03-09 09:15:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:15:05] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 09:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:15:06] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2023-03-09 09:15:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:15:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 09:15:06] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 55 ms returned sat
[2023-03-09 09:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:15:07] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-09 09:15:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:15:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 09:15:10] [INFO ] [Nat]Added 73 Read/Feed constraints in 3420 ms returned sat
[2023-03-09 09:15:10] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2023-03-09 09:15:11] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-09 09:15:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 768 ms
[2023-03-09 09:15:11] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 59 ms.
[2023-03-09 09:15:11] [INFO ] Added : 5 causal constraints over 1 iterations in 116 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 447 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 449
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 446 transition count 443
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 440 transition count 443
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 440 transition count 443
Applied a total of 38 rules in 117 ms. Remains 440 /458 variables (removed 18) and now considering 443/459 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 440/458 places, 443/459 transitions.
// Phase 1: matrix 443 rows 440 cols
[2023-03-09 09:15:11] [INFO ] Computed 75 place invariants in 123 ms
Incomplete random walk after 1000000 steps, including 129562 resets, run finished after 1639 ms. (steps per millisecond=610 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85111 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 1) seen :0
[2023-03-09 09:15:14] [INFO ] Invariant cache hit.
[2023-03-09 09:15:14] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-09 09:15:14] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 29 ms returned sat
[2023-03-09 09:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:15:14] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-09 09:15:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:15:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-09 09:15:14] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 42 ms returned sat
[2023-03-09 09:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:15:15] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2023-03-09 09:15:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:15:16] [INFO ] [Nat]Added 80 Read/Feed constraints in 1473 ms returned sat
[2023-03-09 09:15:17] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2023-03-09 09:15:17] [INFO ] Deduced a trap composed of 118 places in 560 ms of which 0 ms to minimize.
[2023-03-09 09:15:18] [INFO ] Deduced a trap composed of 20 places in 530 ms of which 1 ms to minimize.
[2023-03-09 09:15:18] [INFO ] Deduced a trap composed of 15 places in 470 ms of which 1 ms to minimize.
[2023-03-09 09:15:19] [INFO ] Deduced a trap composed of 9 places in 556 ms of which 1 ms to minimize.
[2023-03-09 09:15:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2881 ms
[2023-03-09 09:15:19] [INFO ] Computed and/alt/rep : 344/2215/344 causal constraints (skipped 98 transitions) in 58 ms.
[2023-03-09 09:15:27] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-09 09:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-09 09:15:28] [INFO ] Added : 170 causal constraints over 34 iterations in 8486 ms. Result :sat
Minimization took 2775 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-09 09:16:00] [INFO ] Invariant cache hit.
[2023-03-09 09:16:02] [INFO ] Implicit Places using invariants in 1334 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 247, 253]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1356 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 443/443 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 427 transition count 436
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 420 transition count 436
Applied a total of 14 rules in 32 ms. Remains 420 /427 variables (removed 7) and now considering 436/443 (removed 7) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-09 09:16:02] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 09:16:02] [INFO ] Implicit Places using invariants in 763 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-09 09:16:03] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 09:16:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:16:11] [INFO ] Implicit Places using invariants and state equation in 8655 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9419 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/440 places, 436/443 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 18 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:16:11] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-09 09:16:12] [INFO ] Implicit Places using invariants in 762 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:16:12] [INFO ] Invariants computation overflowed in 92 ms
[2023-03-09 09:16:12] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:16:40] [INFO ] Implicit Places using invariants and state equation in 28287 ms returned []
Implicit Place search using SMT with State Equation took 29078 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/440 places, 434/443 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 39916 ms. Remains : 417/440 places, 434/443 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:16:40] [INFO ] Invariants computation overflowed in 103 ms
Incomplete random walk after 1000000 steps, including 144449 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91363 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:16:42] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 09:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:16:43] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2023-03-09 09:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:16:43] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-09 09:16:43] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:16:45] [INFO ] [Nat]Added 80 Read/Feed constraints in 2132 ms returned sat
[2023-03-09 09:16:45] [INFO ] Computed and/alt/rep : 332/2179/332 causal constraints (skipped 101 transitions) in 33 ms.
[2023-03-09 09:16:51] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:16:51] [INFO ] Deduced a trap composed of 124 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:16:52] [INFO ] Deduced a trap composed of 122 places in 338 ms of which 0 ms to minimize.
[2023-03-09 09:16:52] [INFO ] Deduced a trap composed of 131 places in 304 ms of which 1 ms to minimize.
[2023-03-09 09:16:52] [INFO ] Deduced a trap composed of 132 places in 291 ms of which 1 ms to minimize.
[2023-03-09 09:16:53] [INFO ] Deduced a trap composed of 131 places in 424 ms of which 1 ms to minimize.
[2023-03-09 09:16:53] [INFO ] Deduced a trap composed of 125 places in 295 ms of which 1 ms to minimize.
[2023-03-09 09:16:54] [INFO ] Deduced a trap composed of 125 places in 448 ms of which 1 ms to minimize.
[2023-03-09 09:16:54] [INFO ] Deduced a trap composed of 123 places in 334 ms of which 0 ms to minimize.
[2023-03-09 09:16:54] [INFO ] Deduced a trap composed of 129 places in 419 ms of which 3 ms to minimize.
[2023-03-09 09:16:55] [INFO ] Deduced a trap composed of 128 places in 380 ms of which 1 ms to minimize.
[2023-03-09 09:16:55] [INFO ] Deduced a trap composed of 133 places in 356 ms of which 1 ms to minimize.
[2023-03-09 09:16:56] [INFO ] Deduced a trap composed of 137 places in 351 ms of which 1 ms to minimize.
[2023-03-09 09:16:56] [INFO ] Deduced a trap composed of 134 places in 332 ms of which 1 ms to minimize.
[2023-03-09 09:16:57] [INFO ] Deduced a trap composed of 140 places in 417 ms of which 1 ms to minimize.
[2023-03-09 09:16:57] [INFO ] Deduced a trap composed of 143 places in 366 ms of which 1 ms to minimize.
[2023-03-09 09:16:57] [INFO ] Deduced a trap composed of 132 places in 390 ms of which 1 ms to minimize.
[2023-03-09 09:16:58] [INFO ] Deduced a trap composed of 126 places in 372 ms of which 1 ms to minimize.
[2023-03-09 09:16:58] [INFO ] Deduced a trap composed of 139 places in 360 ms of which 1 ms to minimize.
[2023-03-09 09:16:59] [INFO ] Deduced a trap composed of 133 places in 365 ms of which 1 ms to minimize.
[2023-03-09 09:16:59] [INFO ] Deduced a trap composed of 146 places in 321 ms of which 0 ms to minimize.
[2023-03-09 09:17:00] [INFO ] Deduced a trap composed of 136 places in 331 ms of which 1 ms to minimize.
[2023-03-09 09:17:00] [INFO ] Deduced a trap composed of 144 places in 328 ms of which 1 ms to minimize.
[2023-03-09 09:17:00] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:17:01] [INFO ] Deduced a trap composed of 137 places in 264 ms of which 1 ms to minimize.
[2023-03-09 09:17:01] [INFO ] Deduced a trap composed of 138 places in 333 ms of which 0 ms to minimize.
[2023-03-09 09:17:01] [INFO ] Deduced a trap composed of 140 places in 329 ms of which 0 ms to minimize.
[2023-03-09 09:17:02] [INFO ] Deduced a trap composed of 141 places in 274 ms of which 0 ms to minimize.
[2023-03-09 09:17:02] [INFO ] Deduced a trap composed of 138 places in 265 ms of which 1 ms to minimize.
[2023-03-09 09:17:02] [INFO ] Deduced a trap composed of 134 places in 274 ms of which 1 ms to minimize.
[2023-03-09 09:17:03] [INFO ] Deduced a trap composed of 140 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:17:03] [INFO ] Deduced a trap composed of 124 places in 368 ms of which 1 ms to minimize.
[2023-03-09 09:17:04] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2023-03-09 09:17:04] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 0 ms to minimize.
[2023-03-09 09:17:04] [INFO ] Deduced a trap composed of 117 places in 327 ms of which 1 ms to minimize.
[2023-03-09 09:17:05] [INFO ] Deduced a trap composed of 129 places in 308 ms of which 1 ms to minimize.
[2023-03-09 09:17:05] [INFO ] Deduced a trap composed of 135 places in 259 ms of which 1 ms to minimize.
[2023-03-09 09:17:05] [INFO ] Deduced a trap composed of 126 places in 364 ms of which 0 ms to minimize.
[2023-03-09 09:17:06] [INFO ] Deduced a trap composed of 135 places in 319 ms of which 0 ms to minimize.
[2023-03-09 09:17:06] [INFO ] Deduced a trap composed of 124 places in 313 ms of which 1 ms to minimize.
[2023-03-09 09:17:06] [INFO ] Deduced a trap composed of 129 places in 246 ms of which 1 ms to minimize.
[2023-03-09 09:17:08] [INFO ] Deduced a trap composed of 131 places in 320 ms of which 0 ms to minimize.
[2023-03-09 09:17:08] [INFO ] Deduced a trap composed of 133 places in 360 ms of which 0 ms to minimize.
[2023-03-09 09:17:09] [INFO ] Deduced a trap composed of 127 places in 365 ms of which 1 ms to minimize.
[2023-03-09 09:17:09] [INFO ] Deduced a trap composed of 21 places in 345 ms of which 1 ms to minimize.
[2023-03-09 09:17:09] [INFO ] Deduced a trap composed of 126 places in 258 ms of which 1 ms to minimize.
[2023-03-09 09:17:10] [INFO ] Deduced a trap composed of 122 places in 319 ms of which 0 ms to minimize.
[2023-03-09 09:17:10] [INFO ] Deduced a trap composed of 131 places in 331 ms of which 0 ms to minimize.
[2023-03-09 09:17:11] [INFO ] Deduced a trap composed of 131 places in 418 ms of which 1 ms to minimize.
[2023-03-09 09:17:11] [INFO ] Deduced a trap composed of 134 places in 460 ms of which 0 ms to minimize.
[2023-03-09 09:17:12] [INFO ] Deduced a trap composed of 124 places in 500 ms of which 1 ms to minimize.
[2023-03-09 09:17:12] [INFO ] Deduced a trap composed of 129 places in 416 ms of which 1 ms to minimize.
[2023-03-09 09:17:13] [INFO ] Deduced a trap composed of 139 places in 422 ms of which 1 ms to minimize.
[2023-03-09 09:17:13] [INFO ] Deduced a trap composed of 133 places in 411 ms of which 0 ms to minimize.
[2023-03-09 09:17:14] [INFO ] Deduced a trap composed of 93 places in 474 ms of which 1 ms to minimize.
[2023-03-09 09:17:16] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 0 ms to minimize.
[2023-03-09 09:17:17] [INFO ] Deduced a trap composed of 137 places in 344 ms of which 0 ms to minimize.
[2023-03-09 09:17:17] [INFO ] Deduced a trap composed of 132 places in 340 ms of which 1 ms to minimize.
[2023-03-09 09:17:18] [INFO ] Deduced a trap composed of 131 places in 354 ms of which 1 ms to minimize.
[2023-03-09 09:17:18] [INFO ] Deduced a trap composed of 130 places in 400 ms of which 1 ms to minimize.
[2023-03-09 09:17:19] [INFO ] Deduced a trap composed of 133 places in 452 ms of which 1 ms to minimize.
[2023-03-09 09:17:19] [INFO ] Deduced a trap composed of 132 places in 409 ms of which 1 ms to minimize.
[2023-03-09 09:17:20] [INFO ] Deduced a trap composed of 128 places in 361 ms of which 1 ms to minimize.
[2023-03-09 09:17:20] [INFO ] Deduced a trap composed of 137 places in 426 ms of which 1 ms to minimize.
[2023-03-09 09:17:21] [INFO ] Deduced a trap composed of 132 places in 420 ms of which 1 ms to minimize.
[2023-03-09 09:17:21] [INFO ] Deduced a trap composed of 132 places in 423 ms of which 1 ms to minimize.
[2023-03-09 09:17:22] [INFO ] Deduced a trap composed of 139 places in 369 ms of which 1 ms to minimize.
[2023-03-09 09:17:22] [INFO ] Deduced a trap composed of 125 places in 423 ms of which 1 ms to minimize.
[2023-03-09 09:17:23] [INFO ] Deduced a trap composed of 130 places in 377 ms of which 1 ms to minimize.
[2023-03-09 09:17:23] [INFO ] Deduced a trap composed of 135 places in 421 ms of which 1 ms to minimize.
[2023-03-09 09:17:24] [INFO ] Deduced a trap composed of 126 places in 415 ms of which 1 ms to minimize.
[2023-03-09 09:17:24] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 1 ms to minimize.
[2023-03-09 09:17:25] [INFO ] Deduced a trap composed of 106 places in 246 ms of which 1 ms to minimize.
[2023-03-09 09:17:26] [INFO ] Deduced a trap composed of 133 places in 419 ms of which 1 ms to minimize.
[2023-03-09 09:17:27] [INFO ] Deduced a trap composed of 140 places in 414 ms of which 1 ms to minimize.
[2023-03-09 09:17:27] [INFO ] Deduced a trap composed of 136 places in 417 ms of which 1 ms to minimize.
[2023-03-09 09:17:27] [INFO ] Deduced a trap composed of 123 places in 425 ms of which 1 ms to minimize.
[2023-03-09 09:17:28] [INFO ] Deduced a trap composed of 91 places in 410 ms of which 1 ms to minimize.
[2023-03-09 09:17:28] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:17:28] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-09 09:17:29] [INFO ] Implicit Places using invariants in 708 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:17:29] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-09 09:17:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-09 09:17:54] [INFO ] Implicit Places using invariants and state equation in 25364 ms returned []
Implicit Place search using SMT with State Equation took 26074 ms to find 0 implicit places.
[2023-03-09 09:17:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:17:54] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-09 09:17:55] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26567 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 169171 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:17:55] [INFO ] Computed 75 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-09 09:17:55] [INFO ] Invariant cache hit.
[2023-03-09 09:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 09:17:55] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 58 ms returned sat
[2023-03-09 09:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:17:55] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-09 09:17:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:17:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:17:56] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-09 09:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:17:56] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-09 09:17:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:17:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 527 ms returned sat
[2023-03-09 09:17:57] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 53 ms.
[2023-03-09 09:18:00] [INFO ] Added : 182 causal constraints over 37 iterations in 3909 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 456 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 455 transition count 455
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 446 transition count 445
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 33 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 38 place count 441 transition count 445
Applied a total of 38 rules in 65 ms. Remains 441 /458 variables (removed 17) and now considering 445/459 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 441/458 places, 445/459 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-09 09:18:31] [INFO ] Computed 75 place invariants in 128 ms
Incomplete random walk after 1000000 steps, including 129377 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85105 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :0
[2023-03-09 09:18:32] [INFO ] Invariant cache hit.
[2023-03-09 09:18:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-09 09:18:33] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 33 ms returned sat
[2023-03-09 09:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:18:33] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-09 09:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:18:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-09 09:18:33] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 46 ms returned sat
[2023-03-09 09:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:18:33] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-09 09:18:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:18:34] [INFO ] [Nat]Added 84 Read/Feed constraints in 726 ms returned sat
[2023-03-09 09:18:34] [INFO ] Computed and/alt/rep : 341/2229/341 causal constraints (skipped 103 transitions) in 36 ms.
[2023-03-09 09:18:39] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
[2023-03-09 09:18:39] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 1 ms to minimize.
[2023-03-09 09:18:39] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 1 ms to minimize.
[2023-03-09 09:18:40] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 1 ms to minimize.
[2023-03-09 09:18:40] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2023-03-09 09:18:41] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2023-03-09 09:18:41] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 2 ms to minimize.
[2023-03-09 09:18:41] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 1 ms to minimize.
[2023-03-09 09:18:42] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-09 09:18:42] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 1 ms to minimize.
[2023-03-09 09:18:42] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-09 09:18:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3600 ms
[2023-03-09 09:18:42] [INFO ] Added : 145 causal constraints over 30 iterations in 8090 ms. Result :sat
Minimization took 1612 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-09 09:19:14] [INFO ] Invariant cache hit.
[2023-03-09 09:19:15] [INFO ] Implicit Places using invariants in 1322 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 246, 252]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1326 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 428 transition count 437
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 420 transition count 437
Applied a total of 16 rules in 33 ms. Remains 420 /428 variables (removed 8) and now considering 437/445 (removed 8) transitions.
// Phase 1: matrix 437 rows 420 cols
[2023-03-09 09:19:15] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:19:16] [INFO ] Implicit Places using invariants in 782 ms returned []
// Phase 1: matrix 437 rows 420 cols
[2023-03-09 09:19:16] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:19:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:19:42] [INFO ] Implicit Places using invariants and state equation in 26231 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 27016 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/441 places, 437/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 435
Applied a total of 4 rules in 22 ms. Remains 417 /419 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:19:42] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:19:43] [INFO ] Implicit Places using invariants in 686 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:19:43] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 09:19:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:20:12] [INFO ] Implicit Places using invariants and state equation in 28926 ms returned []
Implicit Place search using SMT with State Equation took 29614 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/441 places, 435/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58023 ms. Remains : 417/441 places, 435/445 transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:20:12] [INFO ] Invariants computation overflowed in 38 ms
Incomplete random walk after 1000000 steps, including 144535 resets, run finished after 1075 ms. (steps per millisecond=930 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91342 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:20:14] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:20:14] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-09 09:20:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:20:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:20:15] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-09 09:20:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:20:16] [INFO ] [Nat]Added 84 Read/Feed constraints in 676 ms returned sat
[2023-03-09 09:20:16] [INFO ] Computed and/alt/rep : 325/2166/325 causal constraints (skipped 109 transitions) in 36 ms.
[2023-03-09 09:20:22] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2023-03-09 09:20:22] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2023-03-09 09:20:22] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-09 09:20:22] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-09 09:20:23] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2023-03-09 09:20:23] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 1 ms to minimize.
[2023-03-09 09:20:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1328 ms
[2023-03-09 09:20:23] [INFO ] Added : 199 causal constraints over 40 iterations in 7502 ms. Result :sat
Minimization took 2390 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 417/417 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 13 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:20:56] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:20:56] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:20:56] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 09:20:57] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:21:20] [INFO ] Implicit Places using invariants and state equation in 24001 ms returned []
Implicit Place search using SMT with State Equation took 24615 ms to find 0 implicit places.
[2023-03-09 09:21:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-09 09:21:20] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-09 09:21:21] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25191 ms. Remains : 417/417 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 206180 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:21:21] [INFO ] Computed 75 place invariants in 100 ms
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-09 09:21:21] [INFO ] Invariant cache hit.
[2023-03-09 09:21:21] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 09:21:21] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 63 ms returned sat
[2023-03-09 09:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:21:22] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2023-03-09 09:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:21:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:21:22] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 43 ms returned sat
[2023-03-09 09:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:21:22] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-09 09:21:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:21:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 1100 ms returned sat
[2023-03-09 09:21:23] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 52 ms.
[2023-03-09 09:21:26] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-09 09:21:26] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 1 ms to minimize.
[2023-03-09 09:21:26] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2023-03-09 09:21:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1042 ms
[2023-03-09 09:21:27] [INFO ] Added : 142 causal constraints over 29 iterations in 3269 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 106 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:21:27] [INFO ] Computed 75 place invariants in 123 ms
Incomplete random walk after 1000000 steps, including 129101 resets, run finished after 1342 ms. (steps per millisecond=745 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85240 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 1) seen :0
[2023-03-09 09:21:29] [INFO ] Invariant cache hit.
[2023-03-09 09:21:29] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-09 09:21:29] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 42 ms returned sat
[2023-03-09 09:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:21:30] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-09 09:21:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:21:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-09 09:21:30] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 41 ms returned sat
[2023-03-09 09:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:21:30] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-09 09:21:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:21:30] [INFO ] [Nat]Added 84 Read/Feed constraints in 300 ms returned sat
[2023-03-09 09:21:30] [INFO ] Computed and/alt/rep : 340/2224/340 causal constraints (skipped 103 transitions) in 36 ms.
[2023-03-09 09:21:37] [INFO ] Added : 149 causal constraints over 30 iterations in 6164 ms. Result :sat
Minimization took 1859 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:21:45] [INFO ] Invariant cache hit.
[2023-03-09 09:21:47] [INFO ] Implicit Places using invariants in 1376 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 247, 253]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1378 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 427 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 419 transition count 436
Applied a total of 16 rules in 19 ms. Remains 419 /427 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:21:47] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:21:47] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:21:47] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:21:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:22:16] [INFO ] Implicit Places using invariants and state equation in 29289 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29801 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/440 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 20 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:22:16] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:22:17] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:22:17] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 09:22:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:22:44] [INFO ] Implicit Places using invariants and state equation in 27610 ms returned []
Implicit Place search using SMT with State Equation took 28078 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 59308 ms. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:22:44] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 143994 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91370 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:22:46] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 09:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:22:47] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2023-03-09 09:22:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:22:48] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2023-03-09 09:22:48] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:22:48] [INFO ] [Nat]Added 84 Read/Feed constraints in 257 ms returned sat
[2023-03-09 09:22:48] [INFO ] Computed and/alt/rep : 324/2161/324 causal constraints (skipped 109 transitions) in 37 ms.
[2023-03-09 09:22:50] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 0 ms to minimize.
[2023-03-09 09:22:51] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 1 ms to minimize.
[2023-03-09 09:22:51] [INFO ] Deduced a trap composed of 114 places in 320 ms of which 1 ms to minimize.
[2023-03-09 09:22:51] [INFO ] Deduced a trap composed of 136 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:22:52] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 0 ms to minimize.
[2023-03-09 09:22:52] [INFO ] Deduced a trap composed of 123 places in 261 ms of which 1 ms to minimize.
[2023-03-09 09:22:53] [INFO ] Deduced a trap composed of 135 places in 356 ms of which 1 ms to minimize.
[2023-03-09 09:22:53] [INFO ] Deduced a trap composed of 124 places in 260 ms of which 1 ms to minimize.
[2023-03-09 09:22:53] [INFO ] Deduced a trap composed of 134 places in 357 ms of which 1 ms to minimize.
[2023-03-09 09:22:54] [INFO ] Deduced a trap composed of 127 places in 257 ms of which 1 ms to minimize.
[2023-03-09 09:22:54] [INFO ] Deduced a trap composed of 144 places in 325 ms of which 1 ms to minimize.
[2023-03-09 09:22:55] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:22:55] [INFO ] Deduced a trap composed of 119 places in 342 ms of which 1 ms to minimize.
[2023-03-09 09:22:56] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 1 ms to minimize.
[2023-03-09 09:22:56] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2023-03-09 09:22:56] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 0 ms to minimize.
[2023-03-09 09:22:56] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 0 ms to minimize.
[2023-03-09 09:22:57] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 1 ms to minimize.
[2023-03-09 09:22:57] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 1 ms to minimize.
[2023-03-09 09:22:57] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2023-03-09 09:22:57] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 1 ms to minimize.
[2023-03-09 09:22:58] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 0 ms to minimize.
[2023-03-09 09:22:58] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-09 09:22:59] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2023-03-09 09:22:59] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2023-03-09 09:23:00] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2023-03-09 09:23:00] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2023-03-09 09:23:00] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2023-03-09 09:23:01] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 10593 ms
[2023-03-09 09:23:01] [INFO ] Added : 139 causal constraints over 29 iterations in 12764 ms. Result :sat
Minimization took 2073 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:23:33] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 09:23:33] [INFO ] Implicit Places using invariants in 610 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:23:34] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 09:23:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:24:03] [INFO ] Implicit Places using invariants and state equation in 29192 ms returned []
Implicit Place search using SMT with State Equation took 29804 ms to find 0 implicit places.
[2023-03-09 09:24:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:24:03] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 09:24:03] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30185 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 162356 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:24:03] [INFO ] Computed 75 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 1323 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 09:24:03] [INFO ] Invariant cache hit.
[2023-03-09 09:24:03] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:24:03] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 41 ms returned sat
[2023-03-09 09:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:04] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-09 09:24:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:24:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:24:04] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 41 ms returned sat
[2023-03-09 09:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:04] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2023-03-09 09:24:04] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:24:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 379 ms returned sat
[2023-03-09 09:24:05] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 09:24:06] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2023-03-09 09:24:06] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-09 09:24:07] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 0 ms to minimize.
[2023-03-09 09:24:07] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2023-03-09 09:24:07] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
[2023-03-09 09:24:07] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 1 ms to minimize.
[2023-03-09 09:24:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1754 ms
[2023-03-09 09:24:08] [INFO ] Added : 88 causal constraints over 18 iterations in 3032 ms. Result :sat
Minimization took 1050 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 446 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 445 transition count 449
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 445 transition count 443
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 439 transition count 443
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 41 place count 439 transition count 443
Applied a total of 41 rules in 72 ms. Remains 439 /458 variables (removed 19) and now considering 443/459 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 439/458 places, 443/459 transitions.
// Phase 1: matrix 443 rows 439 cols
[2023-03-09 09:24:09] [INFO ] Computed 75 place invariants in 72 ms
Incomplete random walk after 1000000 steps, including 129221 resets, run finished after 1208 ms. (steps per millisecond=827 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84979 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 1) seen :0
[2023-03-09 09:24:11] [INFO ] Invariant cache hit.
[2023-03-09 09:24:11] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-09 09:24:11] [INFO ] [Real]Absence check using 4 positive and 71 generalized place invariants in 45 ms returned sat
[2023-03-09 09:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:11] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2023-03-09 09:24:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:24:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-09 09:24:11] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 41 ms returned sat
[2023-03-09 09:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:12] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-09 09:24:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:24:12] [INFO ] [Nat]Added 84 Read/Feed constraints in 58 ms returned sat
[2023-03-09 09:24:12] [INFO ] Computed and/alt/rep : 339/2217/339 causal constraints (skipped 103 transitions) in 43 ms.
[2023-03-09 09:24:13] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 1 ms to minimize.
[2023-03-09 09:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-09 09:24:14] [INFO ] Added : 91 causal constraints over 19 iterations in 1697 ms. Result :sat
Minimization took 1487 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 439 /439 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 439/439 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 439 /439 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-09 09:24:15] [INFO ] Invariant cache hit.
[2023-03-09 09:24:17] [INFO ] Implicit Places using invariants in 1338 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 246, 252]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1349 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 426/439 places, 443/443 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 426 transition count 436
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 419 transition count 436
Applied a total of 14 rules in 19 ms. Remains 419 /426 variables (removed 7) and now considering 436/443 (removed 7) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:24:17] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 09:24:17] [INFO ] Implicit Places using invariants in 572 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:24:17] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 09:24:18] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:24:27] [INFO ] Implicit Places using invariants and state equation in 9930 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10517 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/439 places, 436/443 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 25 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:24:27] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 09:24:28] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:24:28] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 09:24:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:24:57] [INFO ] Implicit Places using invariants and state equation in 29277 ms returned []
Implicit Place search using SMT with State Equation took 29831 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/439 places, 434/443 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 41754 ms. Remains : 416/439 places, 434/443 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:24:57] [INFO ] Invariants computation overflowed in 47 ms
Incomplete random walk after 1000000 steps, including 144428 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91459 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:24:59] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 09:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:00] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-09 09:25:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:00] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-09 09:25:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:25:00] [INFO ] [Nat]Added 84 Read/Feed constraints in 176 ms returned sat
[2023-03-09 09:25:00] [INFO ] Computed and/alt/rep : 327/2181/327 causal constraints (skipped 106 transitions) in 36 ms.
[2023-03-09 09:25:03] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2023-03-09 09:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-09 09:25:03] [INFO ] Added : 92 causal constraints over 19 iterations in 2621 ms. Result :sat
Minimization took 1866 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:25:05] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 09:25:06] [INFO ] Implicit Places using invariants in 516 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:25:06] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-09 09:25:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:25:34] [INFO ] Implicit Places using invariants and state equation in 28598 ms returned []
Implicit Place search using SMT with State Equation took 29116 ms to find 0 implicit places.
[2023-03-09 09:25:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:25:34] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 09:25:35] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29496 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 91462 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:25:35] [INFO ] Computed 75 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 1302 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 09:25:35] [INFO ] Invariant cache hit.
[2023-03-09 09:25:35] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:25:35] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-09 09:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:35] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-09 09:25:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:25:35] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 09:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:36] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-09 09:25:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:25:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 449 ms returned sat
[2023-03-09 09:25:36] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 09:25:40] [INFO ] Added : 175 causal constraints over 35 iterations in 4017 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 67 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:26:10] [INFO ] Computed 75 place invariants in 71 ms
Incomplete random walk after 1000000 steps, including 129498 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85263 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 1) seen :0
[2023-03-09 09:26:12] [INFO ] Invariant cache hit.
[2023-03-09 09:26:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:12] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 41 ms returned sat
[2023-03-09 09:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:26:13] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-09 09:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:26:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:13] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 39 ms returned sat
[2023-03-09 09:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:26:13] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-09 09:26:13] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:26:14] [INFO ] [Nat]Added 84 Read/Feed constraints in 557 ms returned sat
[2023-03-09 09:26:14] [INFO ] Computed and/alt/rep : 341/2225/341 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-09 09:26:20] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-09 09:26:20] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2023-03-09 09:26:20] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2023-03-09 09:26:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 585 ms
[2023-03-09 09:26:20] [INFO ] Added : 206 causal constraints over 42 iterations in 6601 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:26:23] [INFO ] Invariant cache hit.
[2023-03-09 09:26:25] [INFO ] Implicit Places using invariants in 1383 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 246, 252]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1384 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 427 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 419 transition count 436
Applied a total of 16 rules in 19 ms. Remains 419 /427 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:26:25] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 09:26:25] [INFO ] Implicit Places using invariants in 542 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-09 09:26:25] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 09:26:26] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:26:56] [INFO ] Performed 417/419 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 09:26:56] [INFO ] Implicit Places using invariants and state equation in 30682 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31227 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/440 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 22 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:26:56] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:26:57] [INFO ] Implicit Places using invariants in 606 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:26:57] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:26:57] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:27:27] [INFO ] Performed 399/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:27:28] [INFO ] Implicit Places using invariants and state equation in 31384 ms returned []
Implicit Place search using SMT with State Equation took 31990 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 64653 ms. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:27:28] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 144337 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91465 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:27:30] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:27:30] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-09 09:27:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:27:31] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2023-03-09 09:27:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:27:32] [INFO ] [Nat]Added 84 Read/Feed constraints in 860 ms returned sat
[2023-03-09 09:27:32] [INFO ] Computed and/alt/rep : 325/2162/325 causal constraints (skipped 108 transitions) in 41 ms.
[2023-03-09 09:27:38] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2023-03-09 09:27:39] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 0 ms to minimize.
[2023-03-09 09:27:39] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 0 ms to minimize.
[2023-03-09 09:27:39] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2023-03-09 09:27:39] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2023-03-09 09:27:39] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2023-03-09 09:27:40] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 0 ms to minimize.
[2023-03-09 09:27:40] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2023-03-09 09:27:40] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2023-03-09 09:27:40] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 0 ms to minimize.
[2023-03-09 09:27:40] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 0 ms to minimize.
[2023-03-09 09:27:41] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 0 ms to minimize.
[2023-03-09 09:27:41] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2023-03-09 09:27:41] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2023-03-09 09:27:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3266 ms
[2023-03-09 09:27:42] [INFO ] Added : 201 causal constraints over 43 iterations in 9748 ms. Result :sat
Minimization took 2599 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:28:14] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:28:15] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:28:15] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:28:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:28:45] [INFO ] Performed 362/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:28:48] [INFO ] Implicit Places using invariants and state equation in 33318 ms returned []
Implicit Place search using SMT with State Equation took 33815 ms to find 0 implicit places.
[2023-03-09 09:28:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-09 09:28:48] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:28:49] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34197 ms. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 194003 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:28:49] [INFO ] Computed 75 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 09:28:49] [INFO ] Invariant cache hit.
[2023-03-09 09:28:49] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:28:49] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-09 09:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:28:50] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2023-03-09 09:28:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:28:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:28:50] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 09:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:28:50] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-09 09:28:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:28:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 09:28:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 3239 ms returned sat
[2023-03-09 09:28:54] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-09 09:28:55] [INFO ] Added : 40 causal constraints over 8 iterations in 953 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 455 transition count 455
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 440 transition count 444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 440 transition count 444
Applied a total of 40 rules in 69 ms. Remains 440 /458 variables (removed 18) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 440/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:29:25] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 129370 resets, run finished after 1133 ms. (steps per millisecond=882 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85206 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:29:27] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:29:27] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-09 09:29:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:29:28] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2023-03-09 09:29:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:29:29] [INFO ] [Nat]Added 84 Read/Feed constraints in 1489 ms returned sat
[2023-03-09 09:29:29] [INFO ] Computed and/alt/rep : 341/2238/341 causal constraints (skipped 102 transitions) in 52 ms.
[2023-03-09 09:29:39] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-03-09 09:29:39] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2023-03-09 09:29:40] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 1 ms to minimize.
[2023-03-09 09:29:40] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2023-03-09 09:29:40] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2023-03-09 09:29:40] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2023-03-09 09:29:40] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 0 ms to minimize.
[2023-03-09 09:29:41] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2023-03-09 09:29:41] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2023-03-09 09:29:41] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-09 09:29:41] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2023-03-09 09:29:41] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2023-03-09 09:29:42] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 0 ms to minimize.
[2023-03-09 09:29:42] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2023-03-09 09:29:42] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2023-03-09 09:29:42] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2023-03-09 09:29:42] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 0 ms to minimize.
[2023-03-09 09:29:42] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2023-03-09 09:29:43] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2023-03-09 09:29:43] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2023-03-09 09:29:43] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2023-03-09 09:29:43] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 0 ms to minimize.
[2023-03-09 09:29:43] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 0 ms to minimize.
[2023-03-09 09:29:43] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2023-03-09 09:29:44] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2023-03-09 09:29:47] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2023-03-09 09:29:47] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2023-03-09 09:29:47] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2023-03-09 09:29:47] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 4 ms to minimize.
[2023-03-09 09:29:48] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2023-03-09 09:29:48] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-09 09:29:48] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2023-03-09 09:29:48] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2023-03-09 09:29:48] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 1 ms to minimize.
[2023-03-09 09:29:49] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 1 ms to minimize.
[2023-03-09 09:29:49] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2023-03-09 09:29:49] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9724 ms
[2023-03-09 09:29:50] [INFO ] Added : 288 causal constraints over 58 iterations in 20437 ms.(timeout) Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:29:53] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:29:53] [INFO ] Implicit Places using invariants in 574 ms returned []
// Phase 1: matrix 444 rows 440 cols
[2023-03-09 09:29:53] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:29:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:30:21] [INFO ] Implicit Places using invariants and state equation in 27401 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 27992 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 439 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 437 transition count 442
Applied a total of 4 rules in 26 ms. Remains 437 /439 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 437 cols
[2023-03-09 09:30:21] [INFO ] Computed 74 place invariants in 54 ms
[2023-03-09 09:30:21] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-09 09:30:21] [INFO ] Invariant cache hit.
[2023-03-09 09:30:22] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:30:30] [INFO ] Implicit Places using invariants and state equation in 8237 ms returned []
Implicit Place search using SMT with State Equation took 8943 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 437/440 places, 442/444 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36972 ms. Remains : 437/440 places, 442/444 transitions.
[2023-03-09 09:30:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 129479 resets, run finished after 1162 ms. (steps per millisecond=860 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85506 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 1) seen :0
[2023-03-09 09:30:32] [INFO ] Invariant cache hit.
[2023-03-09 09:30:32] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:30:32] [INFO ] [Real]Absence check using 2 positive and 72 generalized place invariants in 45 ms returned sat
[2023-03-09 09:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:30:32] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-09 09:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:30:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:30:32] [INFO ] [Nat]Absence check using 2 positive and 72 generalized place invariants in 47 ms returned sat
[2023-03-09 09:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:30:33] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-09 09:30:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:30:36] [INFO ] [Nat]Added 84 Read/Feed constraints in 2605 ms returned sat
[2023-03-09 09:30:36] [INFO ] Computed and/alt/rep : 339/2226/339 causal constraints (skipped 102 transitions) in 37 ms.
[2023-03-09 09:30:48] [INFO ] Added : 225 causal constraints over 45 iterations in 12581 ms. Result :sat
Minimization took 3012 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 442/442 transitions.
Applied a total of 0 rules in 12 ms. Remains 437 /437 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 437/437 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 442/442 transitions.
Applied a total of 0 rules in 11 ms. Remains 437 /437 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-09 09:30:51] [INFO ] Invariant cache hit.
[2023-03-09 09:30:52] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-09 09:30:52] [INFO ] Invariant cache hit.
[2023-03-09 09:30:52] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:31:00] [INFO ] Implicit Places using invariants and state equation in 8036 ms returned []
Implicit Place search using SMT with State Equation took 8664 ms to find 0 implicit places.
[2023-03-09 09:31:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 09:31:00] [INFO ] Invariant cache hit.
[2023-03-09 09:31:00] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9071 ms. Remains : 437/437 places, 442/442 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 131900 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:31:00] [INFO ] Computed 75 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 09:31:01] [INFO ] Invariant cache hit.
[2023-03-09 09:31:01] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:31:01] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-09 09:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:31:01] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-09 09:31:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:31:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:31:01] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 09:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:31:02] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-09 09:31:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:31:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 843 ms returned sat
[2023-03-09 09:31:03] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-09 09:31:03] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2023-03-09 09:31:03] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2023-03-09 09:31:03] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 1 ms to minimize.
[2023-03-09 09:31:03] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-09 09:31:04] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2023-03-09 09:31:04] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2023-03-09 09:31:04] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 0 ms to minimize.
[2023-03-09 09:31:04] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-09 09:31:04] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 1 ms to minimize.
[2023-03-09 09:31:04] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2023-03-09 09:31:05] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2023-03-09 09:31:05] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2023-03-09 09:31:05] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2023-03-09 09:31:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2638 ms
[2023-03-09 09:31:05] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 09:31:06] [INFO ] Added : 65 causal constraints over 13 iterations in 968 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 446 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 445 transition count 449
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 445 transition count 445
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 33 place count 441 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 38 place count 441 transition count 445
Applied a total of 38 rules in 64 ms. Remains 441 /458 variables (removed 17) and now considering 445/459 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 441/458 places, 445/459 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-09 09:31:36] [INFO ] Invariants computation overflowed in 60 ms
Incomplete random walk after 1000000 steps, including 129344 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85387 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-09 09:31:38] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-09 09:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:31:39] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2023-03-09 09:31:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:31:40] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-09 09:31:40] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:31:40] [INFO ] [Nat]Added 84 Read/Feed constraints in 860 ms returned sat
[2023-03-09 09:31:41] [INFO ] Deduced a trap composed of 111 places in 338 ms of which 1 ms to minimize.
[2023-03-09 09:31:41] [INFO ] Deduced a trap composed of 121 places in 343 ms of which 1 ms to minimize.
[2023-03-09 09:31:42] [INFO ] Deduced a trap composed of 126 places in 352 ms of which 0 ms to minimize.
[2023-03-09 09:31:42] [INFO ] Deduced a trap composed of 129 places in 308 ms of which 1 ms to minimize.
[2023-03-09 09:31:43] [INFO ] Deduced a trap composed of 132 places in 344 ms of which 1 ms to minimize.
[2023-03-09 09:31:43] [INFO ] Deduced a trap composed of 140 places in 355 ms of which 0 ms to minimize.
[2023-03-09 09:31:43] [INFO ] Deduced a trap composed of 126 places in 344 ms of which 1 ms to minimize.
[2023-03-09 09:31:44] [INFO ] Deduced a trap composed of 148 places in 341 ms of which 0 ms to minimize.
[2023-03-09 09:31:44] [INFO ] Deduced a trap composed of 128 places in 340 ms of which 0 ms to minimize.
[2023-03-09 09:31:44] [INFO ] Deduced a trap composed of 131 places in 337 ms of which 1 ms to minimize.
[2023-03-09 09:31:45] [INFO ] Deduced a trap composed of 123 places in 349 ms of which 0 ms to minimize.
[2023-03-09 09:31:45] [INFO ] Deduced a trap composed of 119 places in 351 ms of which 1 ms to minimize.
[2023-03-09 09:31:46] [INFO ] Deduced a trap composed of 120 places in 341 ms of which 1 ms to minimize.
[2023-03-09 09:31:46] [INFO ] Deduced a trap composed of 122 places in 349 ms of which 1 ms to minimize.
[2023-03-09 09:31:46] [INFO ] Deduced a trap composed of 132 places in 308 ms of which 1 ms to minimize.
[2023-03-09 09:31:47] [INFO ] Deduced a trap composed of 129 places in 393 ms of which 1 ms to minimize.
[2023-03-09 09:31:47] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 0 ms to minimize.
[2023-03-09 09:31:48] [INFO ] Deduced a trap composed of 120 places in 358 ms of which 0 ms to minimize.
[2023-03-09 09:31:48] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 0 ms to minimize.
[2023-03-09 09:31:49] [INFO ] Deduced a trap composed of 119 places in 362 ms of which 1 ms to minimize.
[2023-03-09 09:31:49] [INFO ] Deduced a trap composed of 104 places in 357 ms of which 1 ms to minimize.
[2023-03-09 09:31:50] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 0 ms to minimize.
[2023-03-09 09:31:50] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 1 ms to minimize.
[2023-03-09 09:31:51] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 1 ms to minimize.
[2023-03-09 09:31:52] [INFO ] Deduced a trap composed of 128 places in 306 ms of which 1 ms to minimize.
[2023-03-09 09:31:52] [INFO ] Deduced a trap composed of 131 places in 354 ms of which 1 ms to minimize.
[2023-03-09 09:31:53] [INFO ] Deduced a trap composed of 136 places in 343 ms of which 1 ms to minimize.
[2023-03-09 09:31:53] [INFO ] Deduced a trap composed of 121 places in 341 ms of which 0 ms to minimize.
[2023-03-09 09:31:53] [INFO ] Deduced a trap composed of 134 places in 342 ms of which 1 ms to minimize.
[2023-03-09 09:31:54] [INFO ] Deduced a trap composed of 132 places in 329 ms of which 0 ms to minimize.
[2023-03-09 09:31:54] [INFO ] Deduced a trap composed of 18 places in 347 ms of which 1 ms to minimize.
[2023-03-09 09:31:55] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 1 ms to minimize.
[2023-03-09 09:31:56] [INFO ] Deduced a trap composed of 147 places in 294 ms of which 0 ms to minimize.
[2023-03-09 09:31:56] [INFO ] Deduced a trap composed of 123 places in 353 ms of which 1 ms to minimize.
[2023-03-09 09:31:57] [INFO ] Deduced a trap composed of 129 places in 358 ms of which 0 ms to minimize.
[2023-03-09 09:31:57] [INFO ] Deduced a trap composed of 141 places in 359 ms of which 1 ms to minimize.
[2023-03-09 09:31:57] [INFO ] Deduced a trap composed of 133 places in 344 ms of which 0 ms to minimize.
[2023-03-09 09:31:58] [INFO ] Deduced a trap composed of 119 places in 358 ms of which 1 ms to minimize.
[2023-03-09 09:31:58] [INFO ] Deduced a trap composed of 142 places in 359 ms of which 1 ms to minimize.
[2023-03-09 09:31:59] [INFO ] Deduced a trap composed of 126 places in 343 ms of which 1 ms to minimize.
[2023-03-09 09:31:59] [INFO ] Deduced a trap composed of 127 places in 360 ms of which 1 ms to minimize.
[2023-03-09 09:31:59] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 0 ms to minimize.
[2023-03-09 09:32:01] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 1 ms to minimize.
[2023-03-09 09:32:01] [INFO ] Deduced a trap composed of 122 places in 359 ms of which 0 ms to minimize.
[2023-03-09 09:32:02] [INFO ] Deduced a trap composed of 24 places in 331 ms of which 0 ms to minimize.
[2023-03-09 09:32:02] [INFO ] Deduced a trap composed of 132 places in 301 ms of which 1 ms to minimize.
[2023-03-09 09:32:03] [INFO ] Deduced a trap composed of 142 places in 344 ms of which 1 ms to minimize.
[2023-03-09 09:32:03] [INFO ] Deduced a trap composed of 132 places in 295 ms of which 0 ms to minimize.
[2023-03-09 09:32:03] [INFO ] Deduced a trap composed of 138 places in 347 ms of which 0 ms to minimize.
[2023-03-09 09:32:04] [INFO ] Deduced a trap composed of 130 places in 341 ms of which 1 ms to minimize.
[2023-03-09 09:32:07] [INFO ] Deduced a trap composed of 116 places in 305 ms of which 1 ms to minimize.
[2023-03-09 09:32:07] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2023-03-09 09:32:08] [INFO ] Deduced a trap composed of 124 places in 342 ms of which 1 ms to minimize.
[2023-03-09 09:32:08] [INFO ] Deduced a trap composed of 28 places in 334 ms of which 0 ms to minimize.
[2023-03-09 09:32:08] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 1 ms to minimize.
[2023-03-09 09:32:09] [INFO ] Deduced a trap composed of 127 places in 348 ms of which 1 ms to minimize.
[2023-03-09 09:32:10] [INFO ] Deduced a trap composed of 145 places in 306 ms of which 1 ms to minimize.
[2023-03-09 09:32:10] [INFO ] Deduced a trap composed of 96 places in 339 ms of which 1 ms to minimize.
[2023-03-09 09:32:10] [INFO ] Deduced a trap composed of 134 places in 334 ms of which 0 ms to minimize.
[2023-03-09 09:32:11] [INFO ] Deduced a trap composed of 132 places in 359 ms of which 0 ms to minimize.
[2023-03-09 09:32:11] [INFO ] Deduced a trap composed of 129 places in 337 ms of which 1 ms to minimize.
[2023-03-09 09:32:13] [INFO ] Deduced a trap composed of 109 places in 338 ms of which 0 ms to minimize.
[2023-03-09 09:32:13] [INFO ] Deduced a trap composed of 135 places in 346 ms of which 1 ms to minimize.
[2023-03-09 09:32:13] [INFO ] Deduced a trap composed of 133 places in 332 ms of which 1 ms to minimize.
[2023-03-09 09:32:14] [INFO ] Deduced a trap composed of 133 places in 349 ms of which 1 ms to minimize.
[2023-03-09 09:32:14] [INFO ] Deduced a trap composed of 114 places in 338 ms of which 1 ms to minimize.
[2023-03-09 09:32:15] [INFO ] Deduced a trap composed of 111 places in 356 ms of which 1 ms to minimize.
[2023-03-09 09:32:15] [INFO ] Deduced a trap composed of 136 places in 296 ms of which 1 ms to minimize.
[2023-03-09 09:32:16] [INFO ] Deduced a trap composed of 130 places in 354 ms of which 1 ms to minimize.
[2023-03-09 09:32:16] [INFO ] Deduced a trap composed of 139 places in 346 ms of which 1 ms to minimize.
[2023-03-09 09:32:16] [INFO ] Deduced a trap composed of 137 places in 325 ms of which 0 ms to minimize.
[2023-03-09 09:32:17] [INFO ] Deduced a trap composed of 145 places in 359 ms of which 1 ms to minimize.
[2023-03-09 09:32:17] [INFO ] Deduced a trap composed of 140 places in 334 ms of which 1 ms to minimize.
[2023-03-09 09:32:17] [INFO ] Deduced a trap composed of 137 places in 350 ms of which 0 ms to minimize.
[2023-03-09 09:32:18] [INFO ] Deduced a trap composed of 141 places in 339 ms of which 1 ms to minimize.
[2023-03-09 09:32:18] [INFO ] Deduced a trap composed of 137 places in 353 ms of which 1 ms to minimize.
[2023-03-09 09:32:19] [INFO ] Deduced a trap composed of 135 places in 312 ms of which 0 ms to minimize.
[2023-03-09 09:32:19] [INFO ] Deduced a trap composed of 144 places in 300 ms of which 1 ms to minimize.
[2023-03-09 09:32:20] [INFO ] Deduced a trap composed of 143 places in 299 ms of which 1 ms to minimize.
[2023-03-09 09:32:21] [INFO ] Deduced a trap composed of 139 places in 291 ms of which 1 ms to minimize.
[2023-03-09 09:32:21] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2023-03-09 09:32:22] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 1 ms to minimize.
[2023-03-09 09:32:22] [INFO ] Deduced a trap composed of 145 places in 344 ms of which 0 ms to minimize.
[2023-03-09 09:32:22] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 41885 ms
[2023-03-09 09:32:22] [INFO ] Computed and/alt/rep : 341/2225/341 causal constraints (skipped 103 transitions) in 37 ms.
[2023-03-09 09:32:24] [INFO ] Added : 10 causal constraints over 2 iterations in 1773 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-09 09:32:54] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-09 09:32:55] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-09 09:32:55] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-09 09:32:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:33:14] [INFO ] Implicit Places using invariants and state equation in 19015 ms returned [13, 126, 147, 152, 153, 173, 178, 252]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 19621 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 433/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 433 transition count 440
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 428 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 428 transition count 440
Applied a total of 12 rules in 35 ms. Remains 428 /433 variables (removed 5) and now considering 440/445 (removed 5) transitions.
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:33:14] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:33:14] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:33:14] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:33:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:33:45] [INFO ] Performed 407/428 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:33:46] [INFO ] Implicit Places using invariants and state equation in 31725 ms returned []
Implicit Place search using SMT with State Equation took 32247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 428/441 places, 440/445 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51913 ms. Remains : 428/441 places, 440/445 transitions.
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:33:46] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 144534 resets, run finished after 1053 ms. (steps per millisecond=949 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91313 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:33:48] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:33:48] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-09 09:33:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:33:49] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-09 09:33:49] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:33:50] [INFO ] [Nat]Added 84 Read/Feed constraints in 764 ms returned sat
[2023-03-09 09:33:50] [INFO ] Deduced a trap composed of 126 places in 333 ms of which 1 ms to minimize.
[2023-03-09 09:33:50] [INFO ] Deduced a trap composed of 129 places in 284 ms of which 0 ms to minimize.
[2023-03-09 09:33:51] [INFO ] Deduced a trap composed of 117 places in 339 ms of which 0 ms to minimize.
[2023-03-09 09:33:52] [INFO ] Deduced a trap composed of 122 places in 285 ms of which 1 ms to minimize.
[2023-03-09 09:33:52] [INFO ] Deduced a trap composed of 127 places in 326 ms of which 1 ms to minimize.
[2023-03-09 09:33:53] [INFO ] Deduced a trap composed of 128 places in 331 ms of which 1 ms to minimize.
[2023-03-09 09:33:53] [INFO ] Deduced a trap composed of 118 places in 330 ms of which 1 ms to minimize.
[2023-03-09 09:33:53] [INFO ] Deduced a trap composed of 122 places in 329 ms of which 0 ms to minimize.
[2023-03-09 09:33:54] [INFO ] Deduced a trap composed of 121 places in 321 ms of which 1 ms to minimize.
[2023-03-09 09:33:54] [INFO ] Deduced a trap composed of 125 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:33:55] [INFO ] Deduced a trap composed of 128 places in 312 ms of which 1 ms to minimize.
[2023-03-09 09:33:55] [INFO ] Deduced a trap composed of 128 places in 277 ms of which 1 ms to minimize.
[2023-03-09 09:33:55] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 1 ms to minimize.
[2023-03-09 09:33:56] [INFO ] Deduced a trap composed of 120 places in 322 ms of which 1 ms to minimize.
[2023-03-09 09:33:56] [INFO ] Deduced a trap composed of 118 places in 323 ms of which 1 ms to minimize.
[2023-03-09 09:33:57] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2023-03-09 09:33:58] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 0 ms to minimize.
[2023-03-09 09:33:58] [INFO ] Deduced a trap composed of 18 places in 326 ms of which 1 ms to minimize.
[2023-03-09 09:33:58] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 0 ms to minimize.
[2023-03-09 09:33:59] [INFO ] Deduced a trap composed of 126 places in 312 ms of which 1 ms to minimize.
[2023-03-09 09:33:59] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 0 ms to minimize.
[2023-03-09 09:34:00] [INFO ] Deduced a trap composed of 110 places in 277 ms of which 1 ms to minimize.
[2023-03-09 09:34:00] [INFO ] Deduced a trap composed of 108 places in 333 ms of which 1 ms to minimize.
[2023-03-09 09:34:00] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 0 ms to minimize.
[2023-03-09 09:34:01] [INFO ] Deduced a trap composed of 30 places in 337 ms of which 1 ms to minimize.
[2023-03-09 09:34:01] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2023-03-09 09:34:02] [INFO ] Deduced a trap composed of 126 places in 317 ms of which 1 ms to minimize.
[2023-03-09 09:34:02] [INFO ] Deduced a trap composed of 125 places in 320 ms of which 0 ms to minimize.
[2023-03-09 09:34:02] [INFO ] Deduced a trap composed of 129 places in 315 ms of which 1 ms to minimize.
[2023-03-09 09:34:03] [INFO ] Deduced a trap composed of 129 places in 321 ms of which 1 ms to minimize.
[2023-03-09 09:34:03] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 1 ms to minimize.
[2023-03-09 09:34:03] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 0 ms to minimize.
[2023-03-09 09:34:04] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:34:04] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:34:05] [INFO ] Deduced a trap composed of 138 places in 322 ms of which 1 ms to minimize.
[2023-03-09 09:34:05] [INFO ] Deduced a trap composed of 130 places in 312 ms of which 0 ms to minimize.
[2023-03-09 09:34:05] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 1 ms to minimize.
[2023-03-09 09:34:06] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2023-03-09 09:34:06] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 0 ms to minimize.
[2023-03-09 09:34:06] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 0 ms to minimize.
[2023-03-09 09:34:07] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2023-03-09 09:34:07] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-09 09:34:07] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2023-03-09 09:34:07] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2023-03-09 09:34:08] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
[2023-03-09 09:34:10] [INFO ] Deduced a trap composed of 114 places in 280 ms of which 1 ms to minimize.
[2023-03-09 09:34:11] [INFO ] Deduced a trap composed of 114 places in 327 ms of which 0 ms to minimize.
[2023-03-09 09:34:11] [INFO ] Deduced a trap composed of 118 places in 297 ms of which 1 ms to minimize.
[2023-03-09 09:34:12] [INFO ] Deduced a trap composed of 116 places in 321 ms of which 0 ms to minimize.
[2023-03-09 09:34:12] [INFO ] Deduced a trap composed of 112 places in 283 ms of which 0 ms to minimize.
[2023-03-09 09:34:13] [INFO ] Deduced a trap composed of 105 places in 295 ms of which 0 ms to minimize.
[2023-03-09 09:34:13] [INFO ] Deduced a trap composed of 114 places in 277 ms of which 0 ms to minimize.
[2023-03-09 09:34:14] [INFO ] Deduced a trap composed of 121 places in 309 ms of which 1 ms to minimize.
[2023-03-09 09:34:15] [INFO ] Deduced a trap composed of 118 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:34:16] [INFO ] Deduced a trap composed of 125 places in 330 ms of which 1 ms to minimize.
[2023-03-09 09:34:16] [INFO ] Deduced a trap composed of 109 places in 323 ms of which 1 ms to minimize.
[2023-03-09 09:34:17] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2023-03-09 09:34:17] [INFO ] Deduced a trap composed of 115 places in 328 ms of which 1 ms to minimize.
[2023-03-09 09:34:18] [INFO ] Deduced a trap composed of 117 places in 283 ms of which 0 ms to minimize.
[2023-03-09 09:34:19] [INFO ] Deduced a trap composed of 114 places in 324 ms of which 1 ms to minimize.
[2023-03-09 09:34:19] [INFO ] Deduced a trap composed of 118 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:34:21] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 0 ms to minimize.
[2023-03-09 09:34:21] [INFO ] Deduced a trap composed of 126 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:34:22] [INFO ] Deduced a trap composed of 136 places in 345 ms of which 0 ms to minimize.
[2023-03-09 09:34:22] [INFO ] Deduced a trap composed of 127 places in 278 ms of which 0 ms to minimize.
[2023-03-09 09:34:22] [INFO ] Deduced a trap composed of 134 places in 316 ms of which 0 ms to minimize.
[2023-03-09 09:34:23] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 1 ms to minimize.
[2023-03-09 09:34:23] [INFO ] Deduced a trap composed of 133 places in 289 ms of which 0 ms to minimize.
[2023-03-09 09:34:24] [INFO ] Deduced a trap composed of 137 places in 276 ms of which 0 ms to minimize.
[2023-03-09 09:34:25] [INFO ] Deduced a trap composed of 129 places in 274 ms of which 1 ms to minimize.
[2023-03-09 09:34:26] [INFO ] Deduced a trap composed of 132 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:34:27] [INFO ] Deduced a trap composed of 136 places in 285 ms of which 0 ms to minimize.
[2023-03-09 09:34:28] [INFO ] Deduced a trap composed of 128 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:34:28] [INFO ] Deduced a trap composed of 127 places in 322 ms of which 1 ms to minimize.
[2023-03-09 09:34:29] [INFO ] Deduced a trap composed of 131 places in 286 ms of which 1 ms to minimize.
[2023-03-09 09:34:29] [INFO ] Deduced a trap composed of 120 places in 279 ms of which 1 ms to minimize.
[2023-03-09 09:34:30] [INFO ] Deduced a trap composed of 116 places in 287 ms of which 0 ms to minimize.
[2023-03-09 09:34:30] [INFO ] Deduced a trap composed of 110 places in 276 ms of which 1 ms to minimize.
[2023-03-09 09:34:30] [INFO ] Deduced a trap composed of 127 places in 329 ms of which 1 ms to minimize.
[2023-03-09 09:34:31] [INFO ] Deduced a trap composed of 131 places in 272 ms of which 1 ms to minimize.
[2023-03-09 09:34:31] [INFO ] Deduced a trap composed of 128 places in 323 ms of which 1 ms to minimize.
[2023-03-09 09:34:31] [INFO ] Deduced a trap composed of 130 places in 312 ms of which 1 ms to minimize.
[2023-03-09 09:34:32] [INFO ] Deduced a trap composed of 131 places in 278 ms of which 1 ms to minimize.
[2023-03-09 09:34:33] [INFO ] Deduced a trap composed of 132 places in 302 ms of which 0 ms to minimize.
[2023-03-09 09:34:33] [INFO ] Deduced a trap composed of 123 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:34: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 428 /428 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 428/428 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 428 /428 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:34:33] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:34:34] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:34:34] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:34:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:35:04] [INFO ] Performed 387/428 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:35:07] [INFO ] Implicit Places using invariants and state equation in 33334 ms returned []
Implicit Place search using SMT with State Equation took 33860 ms to find 0 implicit places.
[2023-03-09 09:35:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 428 cols
[2023-03-09 09:35:07] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:35:08] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34223 ms. Remains : 428/428 places, 440/440 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 247241 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
[2023-03-09 09:35:08] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 09:35:08] [INFO ] Invariant cache hit.
[2023-03-09 09:35:08] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:35:08] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 09:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:35:08] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-09 09:35:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:35:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:35:08] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-09 09:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:35:08] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-09 09:35:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:35:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 39 ms returned sat
[2023-03-09 09:35:09] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 40 ms.
[2023-03-09 09:35:10] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2023-03-09 09:35:10] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2023-03-09 09:35:11] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-09 09:35:11] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2023-03-09 09:35:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1094 ms
[2023-03-09 09:35:11] [INFO ] Added : 91 causal constraints over 20 iterations in 2548 ms. Result :sat
Minimization took 1081 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 449 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 446 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 446 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 445 transition count 449
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 445 transition count 443
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 439 transition count 443
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 439 transition count 443
Applied a total of 42 rules in 67 ms. Remains 439 /458 variables (removed 19) and now considering 443/459 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 439/458 places, 443/459 transitions.
// Phase 1: matrix 443 rows 439 cols
[2023-03-09 09:35:13] [INFO ] Computed 75 place invariants in 69 ms
Incomplete random walk after 1000000 steps, including 129525 resets, run finished after 1133 ms. (steps per millisecond=882 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85297 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 1) seen :0
[2023-03-09 09:35:15] [INFO ] Invariant cache hit.
[2023-03-09 09:35:15] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 09:35:15] [INFO ] [Real]Absence check using 4 positive and 71 generalized place invariants in 37 ms returned sat
[2023-03-09 09:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:35:15] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-09 09:35:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:35:15] [INFO ] [Real]Added 84 Read/Feed constraints in 44 ms returned sat
[2023-03-09 09:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:35:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-09 09:35:15] [INFO ] [Nat]Absence check using 4 positive and 71 generalized place invariants in 37 ms returned sat
[2023-03-09 09:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:35:15] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-09 09:35:15] [INFO ] [Nat]Added 84 Read/Feed constraints in 64 ms returned sat
[2023-03-09 09:35:16] [INFO ] Computed and/alt/rep : 339/2223/339 causal constraints (skipped 103 transitions) in 40 ms.
[2023-03-09 09:35:17] [INFO ] Added : 83 causal constraints over 17 iterations in 1839 ms. Result :sat
Minimization took 1205 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 439 /439 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 439/439 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 439 /439 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-09 09:35:19] [INFO ] Invariant cache hit.
[2023-03-09 09:35:20] [INFO ] Implicit Places using invariants in 1256 ms returned [50, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 246, 252]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1283 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 426/439 places, 443/443 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 426 transition count 435
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 435
Applied a total of 16 rules in 22 ms. Remains 418 /426 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:35:20] [INFO ] Invariants computation overflowed in 25 ms
[2023-03-09 09:35:21] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-09 09:35:21] [INFO ] Invariants computation overflowed in 25 ms
[2023-03-09 09:35:21] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:35:51] [INFO ] Performed 402/418 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 09:35:52] [INFO ] Implicit Places using invariants and state equation in 31204 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31670 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/439 places, 435/443 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 417 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 415 transition count 433
Applied a total of 4 rules in 20 ms. Remains 415 /417 variables (removed 2) and now considering 433/435 (removed 2) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:35:52] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:35:52] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:35:52] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:35:53] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:36:22] [INFO ] Implicit Places using invariants and state equation in 30143 ms returned []
Implicit Place search using SMT with State Equation took 30620 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 415/439 places, 433/443 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63627 ms. Remains : 415/439 places, 433/443 transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:36:22] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 144201 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91362 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:36:24] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:36:25] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2023-03-09 09:36:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:36:25] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-09 09:36:25] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:36:25] [INFO ] [Nat]Added 84 Read/Feed constraints in 78 ms returned sat
[2023-03-09 09:36:25] [INFO ] Computed and/alt/rep : 323/2160/323 causal constraints (skipped 109 transitions) in 34 ms.
[2023-03-09 09:36:28] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-09 09:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-09 09:36:28] [INFO ] Added : 85 causal constraints over 18 iterations in 2397 ms. Result :sat
Minimization took 789 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 10 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 415/415 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:36:29] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:36:29] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:36:29] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:36:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:36:59] [INFO ] Implicit Places using invariants and state equation in 29988 ms returned []
Implicit Place search using SMT with State Equation took 30457 ms to find 0 implicit places.
[2023-03-09 09:36:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-09 09:36:59] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:37:00] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30849 ms. Remains : 415/415 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 112120 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-14
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:37:00] [INFO ] Computed 75 place invariants in 62 ms
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 09:37:00] [INFO ] Invariant cache hit.
[2023-03-09 09:37:00] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:37:00] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-09 09:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:37:00] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-09 09:37:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:37:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:37:01] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 09:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:37:01] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-09 09:37:01] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:37:01] [INFO ] [Nat]Added 73 Read/Feed constraints in 37 ms returned sat
[2023-03-09 09:37:01] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 38 ms.
[2023-03-09 09:37:02] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 1 ms to minimize.
[2023-03-09 09:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-09 09:37:02] [INFO ] Added : 63 causal constraints over 15 iterations in 999 ms. Result :sat
Minimization took 777 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Graph (complete) has 3291 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 456 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 454 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 454 transition count 454
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 453 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 450 transition count 451
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 448 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 448 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 447 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 447 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 33 place count 441 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 38 place count 441 transition count 444
Applied a total of 38 rules in 65 ms. Remains 441 /458 variables (removed 17) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 441/458 places, 444/459 transitions.
// Phase 1: matrix 444 rows 441 cols
[2023-03-09 09:37:03] [INFO ] Computed 75 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 129349 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85129 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 1) seen :0
[2023-03-09 09:37:05] [INFO ] Invariant cache hit.
[2023-03-09 09:37:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:37:05] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-09 09:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:37:05] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-09 09:37:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:37:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:37:05] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-09 09:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:37:06] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-09 09:37:06] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 09:37:06] [INFO ] [Nat]Added 82 Read/Feed constraints in 63 ms returned sat
[2023-03-09 09:37:06] [INFO ] Computed and/alt/rep : 343/2211/343 causal constraints (skipped 100 transitions) in 36 ms.
[2023-03-09 09:37:06] [INFO ] Added : 61 causal constraints over 13 iterations in 706 ms. Result :sat
Minimization took 3324 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 441/441 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-09 09:37:10] [INFO ] Invariant cache hit.
[2023-03-09 09:37:11] [INFO ] Implicit Places using invariants in 1262 ms returned [50, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 248, 254]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1284 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 428/441 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 428 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 420 transition count 436
Applied a total of 16 rules in 19 ms. Remains 420 /428 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-09 09:37:11] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-09 09:37:12] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-09 09:37:12] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-09 09:37:12] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 09:37:40] [INFO ] Implicit Places using invariants and state equation in 27931 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28439 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/441 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 19 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:37:40] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:37:40] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:37:40] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-09 09:37:40] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 09:38:11] [INFO ] Performed 368/417 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 09:38:14] [INFO ] Implicit Places using invariants and state equation in 34261 ms returned []
Implicit Place search using SMT with State Equation took 34739 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 417/441 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 64510 ms. Remains : 417/441 places, 434/444 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:38:14] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 143895 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91688 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:38:16] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:38:16] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-09 09:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:38:17] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-09 09:38:17] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 09:38:17] [INFO ] [Nat]Added 82 Read/Feed constraints in 421 ms returned sat
[2023-03-09 09:38:17] [INFO ] Computed and/alt/rep : 331/2191/331 causal constraints (skipped 102 transitions) in 33 ms.
[2023-03-09 09:38:19] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 1 ms to minimize.
[2023-03-09 09:38:20] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2023-03-09 09:38:20] [INFO ] Deduced a trap composed of 113 places in 333 ms of which 0 ms to minimize.
[2023-03-09 09:38:21] [INFO ] Deduced a trap composed of 101 places in 334 ms of which 0 ms to minimize.
[2023-03-09 09:38:21] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-09 09:38:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1856 ms
[2023-03-09 09:38:21] [INFO ] Added : 92 causal constraints over 20 iterations in 3780 ms. Result :sat
Minimization took 482 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:38:22] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 09:38:22] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:38:22] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 09:38:22] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 09:38:49] [INFO ] Implicit Places using invariants and state equation in 27299 ms returned []
Implicit Place search using SMT with State Equation took 27780 ms to find 0 implicit places.
[2023-03-09 09:38:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-09 09:38:49] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 09:38:50] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28170 ms. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-14 in 109962 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-15
// Phase 1: matrix 459 rows 458 cols
[2023-03-09 09:38:50] [INFO ] Computed 75 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 1300 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 09:38:50] [INFO ] Invariant cache hit.
[2023-03-09 09:38:50] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:38:50] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 09:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:38:51] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2023-03-09 09:38:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:38:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:38:51] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-09 09:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:38:51] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2023-03-09 09:38:51] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 09:38:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 2956 ms returned sat
[2023-03-09 09:38:55] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 0 ms to minimize.
[2023-03-09 09:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-09 09:38:55] [INFO ] Computed and/alt/rep : 372/2213/372 causal constraints (skipped 86 transitions) in 37 ms.
[2023-03-09 09:38:56] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 459/459 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 456 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 452 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 449 transition count 453
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 449 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 448 transition count 452
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 27 place count 448 transition count 445
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 34 place count 441 transition count 445
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 38 place count 441 transition count 445
Applied a total of 38 rules in 63 ms. Remains 441 /458 variables (removed 17) and now considering 445/459 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 441/458 places, 445/459 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-09 09:38:56] [INFO ] Computed 75 place invariants in 75 ms
Incomplete random walk after 1000000 steps, including 129673 resets, run finished after 1127 ms. (steps per millisecond=887 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85262 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 1) seen :0
[2023-03-09 09:38:58] [INFO ] Invariant cache hit.
[2023-03-09 09:38:58] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 09:38:58] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 26 ms returned sat
[2023-03-09 09:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:38:58] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-09 09:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:38:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 09:38:59] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 26 ms returned sat
[2023-03-09 09:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:38:59] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-09 09:38:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:39:01] [INFO ] [Nat]Added 84 Read/Feed constraints in 1957 ms returned sat
[2023-03-09 09:39:01] [INFO ] Computed and/alt/rep : 342/2239/342 causal constraints (skipped 102 transitions) in 44 ms.
[2023-03-09 09:39:07] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2023-03-09 09:39:07] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-09 09:39:08] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-09 09:39:08] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2023-03-09 09:39:08] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2023-03-09 09:39:08] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2023-03-09 09:39:09] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2023-03-09 09:39:09] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2023-03-09 09:39:09] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 0 ms to minimize.
[2023-03-09 09:39:09] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 1 ms to minimize.
[2023-03-09 09:39:09] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2023-03-09 09:39:10] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2023-03-09 09:39:10] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2023-03-09 09:39:10] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2023-03-09 09:39:10] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2023-03-09 09:39:10] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 0 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 0 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 0 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
[2023-03-09 09:39:11] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2023-03-09 09:39:12] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
[2023-03-09 09:39:12] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4758 ms
[2023-03-09 09:39:12] [INFO ] Added : 255 causal constraints over 52 iterations in 10629 ms. Result :sat
Minimization took 2359 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-09 09:39:44] [INFO ] Invariant cache hit.
[2023-03-09 09:39:45] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-09 09:39:45] [INFO ] Invariant cache hit.
[2023-03-09 09:39:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-09 09:40:07] [INFO ] Implicit Places using invariants and state equation in 22056 ms returned []
Implicit Place search using SMT with State Equation took 22782 ms to find 0 implicit places.
[2023-03-09 09:40:07] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 09:40:07] [INFO ] Invariant cache hit.
[2023-03-09 09:40:07] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23163 ms. Remains : 441/441 places, 445/445 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-15 in 77687 ms.
[2023-03-09 09:40:08] [INFO ] Flatten gal took : 245 ms
[2023-03-09 09:40:08] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 09:40:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 458 places, 459 transitions and 3468 arcs took 6 ms.
Total runtime 3352802 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-020
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
Upper Bounds
FORMULA DoubleExponent-PT-020-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-020-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12580688 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16103028 kB
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 50 (type EXCL) for 42 DoubleExponent-PT-020-UpperBounds-14
lola: time limit : 128 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 48 (type FNDP) for 42 DoubleExponent-PT-020-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type EQUN) for 42 DoubleExponent-PT-020-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type FNDP) for 3 DoubleExponent-PT-020-UpperBounds-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/375/UpperBounds-49.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 15)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-14: BOUND 0 0 3 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 BOUND FNDP 4/326 0/5 DoubleExponent-PT-020-UpperBounds-14 914862 t fired, 118360 attempts, .
49 BOUND STEQ 4/326 0/5 DoubleExponent-PT-020-UpperBounds-14 --
50 BOUND EXCL 4/128 4/32 DoubleExponent-PT-020-UpperBounds-14 615777 m, 123155 m/sec, 615776 t fired, result in [0,1] .
51 BOUND FNDP 4/358 0/5 DoubleExponent-PT-020-UpperBounds-01 946454 t fired, 122475 attempts, .
Time elapsed: 5 secs. Pages in use: 4
# running tasks: 4 of 4 Visible: 16
lola: REPORT NUM
lola: FINISHED task # 50 (type EXCL) for DoubleExponent-PT-020-UpperBounds-14
lola: markings : 779391
lola: fired transitions : 779390
lola: time used : 5.000000
lola: memory pages used : 5
lola: CANCELED task # 48 (type FNDP) for DoubleExponent-PT-020-UpperBounds-14 (obsolete)
lola: CANCELED task # 49 (type EQUN) for DoubleExponent-PT-020-UpperBounds-14 (obsolete)
lola: LAUNCH task # 80 (type EXCL) for 33 DoubleExponent-PT-020-UpperBounds-11
lola: time limit : 138 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 54 (type FNDP) for 27 DoubleExponent-PT-020-UpperBounds-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type EQUN) for 27 DoubleExponent-PT-020-UpperBounds-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/375/UpperBounds-55.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 23)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 9/354 0/5 DoubleExponent-PT-020-UpperBounds-01 1783462 t fired, 231148 attempts, .
54 BOUND FNDP 4/359 0/5 DoubleExponent-PT-020-UpperBounds-09 696778 t fired, 90131 attempts, .
55 BOUND STEQ 4/359 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 4/138 3/32 DoubleExponent-PT-020-UpperBounds-11 366771 m, 73354 m/sec, 366770 t fired, result in [0,1] .
Time elapsed: 10 secs. Pages in use: 5
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 14/350 0/5 DoubleExponent-PT-020-UpperBounds-01 2797849 t fired, 362339 attempts, .
54 BOUND FNDP 9/355 0/5 DoubleExponent-PT-020-UpperBounds-09 1668855 t fired, 216141 attempts, .
55 BOUND STEQ 9/355 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 9/138 6/32 DoubleExponent-PT-020-UpperBounds-11 962105 m, 119066 m/sec, 962105 t fired, result in [0,1] .
Time elapsed: 15 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 19/345 0/5 DoubleExponent-PT-020-UpperBounds-01 3778956 t fired, 489065 attempts, .
54 BOUND FNDP 14/350 0/5 DoubleExponent-PT-020-UpperBounds-09 2655783 t fired, 343607 attempts, .
55 BOUND STEQ 14/350 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 14/138 9/32 DoubleExponent-PT-020-UpperBounds-11 1541477 m, 115874 m/sec, 1541477 t fired, result in [0,1] .
Time elapsed: 20 secs. Pages in use: 9
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 24/340 0/5 DoubleExponent-PT-020-UpperBounds-01 4823829 t fired, 624218 attempts, .
54 BOUND FNDP 19/345 0/5 DoubleExponent-PT-020-UpperBounds-09 3658433 t fired, 473369 attempts, .
55 BOUND STEQ 19/345 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 19/138 13/32 DoubleExponent-PT-020-UpperBounds-11 2123755 m, 116455 m/sec, 2123754 t fired, result in [0,1] .
Time elapsed: 25 secs. Pages in use: 13
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 29/335 0/5 DoubleExponent-PT-020-UpperBounds-01 5793287 t fired, 749693 attempts, .
54 BOUND FNDP 24/340 0/5 DoubleExponent-PT-020-UpperBounds-09 4675524 t fired, 604773 attempts, .
55 BOUND STEQ 24/340 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 24/138 16/32 DoubleExponent-PT-020-UpperBounds-11 2705580 m, 116365 m/sec, 2705579 t fired, result in [0,1] .
Time elapsed: 30 secs. Pages in use: 16
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 34/330 0/5 DoubleExponent-PT-020-UpperBounds-01 6829578 t fired, 883918 attempts, .
54 BOUND FNDP 29/335 0/5 DoubleExponent-PT-020-UpperBounds-09 5706561 t fired, 738329 attempts, .
55 BOUND STEQ 29/335 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 29/138 19/32 DoubleExponent-PT-020-UpperBounds-11 3298891 m, 118662 m/sec, 3298890 t fired, result in [0,1] .
Time elapsed: 35 secs. Pages in use: 19
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 39/325 0/5 DoubleExponent-PT-020-UpperBounds-01 7799763 t fired, 1009504 attempts, .
54 BOUND FNDP 34/330 0/5 DoubleExponent-PT-020-UpperBounds-09 6753687 t fired, 873695 attempts, .
55 BOUND STEQ 34/330 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 34/138 23/32 DoubleExponent-PT-020-UpperBounds-11 3889409 m, 118103 m/sec, 3889408 t fired, result in [0,1] .
Time elapsed: 40 secs. Pages in use: 23
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 44/320 0/5 DoubleExponent-PT-020-UpperBounds-01 8782218 t fired, 1136376 attempts, .
54 BOUND FNDP 39/325 0/5 DoubleExponent-PT-020-UpperBounds-09 7816045 t fired, 1011045 attempts, .
55 BOUND STEQ 39/325 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 39/138 26/32 DoubleExponent-PT-020-UpperBounds-11 4481284 m, 118375 m/sec, 4481283 t fired, result in [0,1] .
Time elapsed: 45 secs. Pages in use: 26
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 49/315 0/5 DoubleExponent-PT-020-UpperBounds-01 9770705 t fired, 1264311 attempts, .
54 BOUND FNDP 44/320 0/5 DoubleExponent-PT-020-UpperBounds-09 8803573 t fired, 1138500 attempts, .
55 BOUND STEQ 44/320 0/5 DoubleExponent-PT-020-UpperBounds-09 --
80 BOUND EXCL 44/138 29/32 DoubleExponent-PT-020-UpperBounds-11 5084128 m, 120568 m/sec, 5084128 t fired, result in [0,1] .
Time elapsed: 50 secs. Pages in use: 29
# running tasks: 4 of 4 Visible: 16
lola: CANCELED task # 80 (type EXCL) for DoubleExponent-PT-020-UpperBounds-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 54/310 0/5 DoubleExponent-PT-020-UpperBounds-01 10780051 t fired, 1394890 attempts, .
54 BOUND FNDP 49/315 0/5 DoubleExponent-PT-020-UpperBounds-09 9783409 t fired, 1265180 attempts, .
55 BOUND STEQ 49/315 0/5 DoubleExponent-PT-020-UpperBounds-09 --
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: LAUNCH task # 77 (type EXCL) for 9 DoubleExponent-PT-020-UpperBounds-03
lola: time limit : 141 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-03: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 59/305 0/5 DoubleExponent-PT-020-UpperBounds-01 11682021 t fired, 1511579 attempts, .
54 BOUND FNDP 54/310 0/5 DoubleExponent-PT-020-UpperBounds-09 10706081 t fired, 1385126 attempts, .
55 BOUND STEQ 54/310 0/5 DoubleExponent-PT-020-UpperBounds-09 --
77 BOUND EXCL 5/141 3/32 DoubleExponent-PT-020-UpperBounds-03 543815 m, 108763 m/sec, 543815 t fired, result in [0,1] .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: REPORT NUM
lola: FINISHED task # 77 (type EXCL) for DoubleExponent-PT-020-UpperBounds-03
lola: markings : 779392
lola: fired transitions : 779391
lola: time used : 8.000000
lola: memory pages used : 5
lola: LAUNCH task # 75 (type EXCL) for 21 DoubleExponent-PT-020-UpperBounds-07
lola: time limit : 147 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 64/337 0/5 DoubleExponent-PT-020-UpperBounds-01 12364227 t fired, 1599850 attempts, .
54 BOUND FNDP 59/342 0/5 DoubleExponent-PT-020-UpperBounds-09 11587415 t fired, 1498967 attempts, .
55 BOUND STEQ 59/302 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 2/147 2/32 DoubleExponent-PT-020-UpperBounds-07 273541 m, 54708 m/sec, 273540 t fired, result in [0,1] .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 69/335 0/5 DoubleExponent-PT-020-UpperBounds-01 13158274 t fired, 1702576 attempts, .
54 BOUND FNDP 64/340 0/5 DoubleExponent-PT-020-UpperBounds-09 12346997 t fired, 1597007 attempts, .
55 BOUND STEQ 64/300 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 7/147 5/32 DoubleExponent-PT-020-UpperBounds-07 735709 m, 92433 m/sec, 735709 t fired, result in [0,1] .
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 74/330 0/5 DoubleExponent-PT-020-UpperBounds-01 13890533 t fired, 1797237 attempts, .
54 BOUND FNDP 69/335 0/5 DoubleExponent-PT-020-UpperBounds-09 13111464 t fired, 1695860 attempts, .
55 BOUND STEQ 69/295 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 12/147 7/32 DoubleExponent-PT-020-UpperBounds-07 1184560 m, 89770 m/sec, 1184559 t fired, result in [0,1] .
Time elapsed: 75 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 79/325 0/5 DoubleExponent-PT-020-UpperBounds-01 14689536 t fired, 1900240 attempts, .
54 BOUND FNDP 74/330 0/5 DoubleExponent-PT-020-UpperBounds-09 13858776 t fired, 1792470 attempts, .
55 BOUND STEQ 74/290 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 17/147 10/32 DoubleExponent-PT-020-UpperBounds-07 1654728 m, 94033 m/sec, 1654727 t fired, result in [0,1] .
Time elapsed: 80 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 84/320 0/5 DoubleExponent-PT-020-UpperBounds-01 15490361 t fired, 2003722 attempts, .
54 BOUND FNDP 79/325 0/5 DoubleExponent-PT-020-UpperBounds-09 14516746 t fired, 1877784 attempts, .
55 BOUND STEQ 79/285 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 22/147 13/32 DoubleExponent-PT-020-UpperBounds-07 2093048 m, 87664 m/sec, 2093047 t fired, result in [0,1] .
Time elapsed: 85 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 89/315 0/5 DoubleExponent-PT-020-UpperBounds-01 16269157 t fired, 2104520 attempts, .
54 BOUND FNDP 84/320 0/5 DoubleExponent-PT-020-UpperBounds-09 15354371 t fired, 1986224 attempts, .
55 BOUND STEQ 84/280 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 27/147 15/32 DoubleExponent-PT-020-UpperBounds-07 2581755 m, 97741 m/sec, 2581754 t fired, result in [0,1] .
Time elapsed: 90 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 94/310 0/5 DoubleExponent-PT-020-UpperBounds-01 17018968 t fired, 2201432 attempts, .
54 BOUND FNDP 89/315 0/5 DoubleExponent-PT-020-UpperBounds-09 16117755 t fired, 2085011 attempts, .
55 BOUND STEQ 89/275 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 32/147 18/32 DoubleExponent-PT-020-UpperBounds-07 3049554 m, 93559 m/sec, 3049554 t fired, result in [0,1] .
Time elapsed: 95 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 99/305 0/5 DoubleExponent-PT-020-UpperBounds-01 17793781 t fired, 2301855 attempts, .
54 BOUND FNDP 94/310 0/5 DoubleExponent-PT-020-UpperBounds-09 16811538 t fired, 2174821 attempts, .
55 BOUND STEQ 94/270 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 37/147 21/32 DoubleExponent-PT-020-UpperBounds-07 3504379 m, 90965 m/sec, 3504378 t fired, result in [0,1] .
Time elapsed: 100 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 104/300 0/5 DoubleExponent-PT-020-UpperBounds-01 18524371 t fired, 2396390 attempts, .
54 BOUND FNDP 99/305 0/5 DoubleExponent-PT-020-UpperBounds-09 17510051 t fired, 2265119 attempts, .
55 BOUND STEQ 99/265 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 42/147 23/32 DoubleExponent-PT-020-UpperBounds-07 3963793 m, 91882 m/sec, 3963793 t fired, result in [0,1] .
Time elapsed: 105 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 109/295 0/5 DoubleExponent-PT-020-UpperBounds-01 19352145 t fired, 2503175 attempts, .
54 BOUND FNDP 104/300 0/5 DoubleExponent-PT-020-UpperBounds-09 18218598 t fired, 2356847 attempts, .
55 BOUND STEQ 104/260 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 47/147 26/32 DoubleExponent-PT-020-UpperBounds-07 4447821 m, 96805 m/sec, 4447821 t fired, result in [0,1] .
Time elapsed: 110 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 114/290 0/5 DoubleExponent-PT-020-UpperBounds-01 20059268 t fired, 2594926 attempts, .
54 BOUND FNDP 109/295 0/5 DoubleExponent-PT-020-UpperBounds-09 18926931 t fired, 2448623 attempts, .
55 BOUND STEQ 109/255 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 52/147 28/32 DoubleExponent-PT-020-UpperBounds-07 4915604 m, 93556 m/sec, 4915603 t fired, result in [0,1] .
Time elapsed: 115 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 119/285 0/5 DoubleExponent-PT-020-UpperBounds-01 20807235 t fired, 2691792 attempts, .
54 BOUND FNDP 114/290 0/5 DoubleExponent-PT-020-UpperBounds-09 19586953 t fired, 2533851 attempts, .
55 BOUND STEQ 114/250 0/5 DoubleExponent-PT-020-UpperBounds-09 --
75 BOUND EXCL 57/147 31/32 DoubleExponent-PT-020-UpperBounds-07 5428290 m, 102537 m/sec, 5428289 t fired, result in [0,1] .
Time elapsed: 120 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: CANCELED task # 75 (type EXCL) for DoubleExponent-PT-020-UpperBounds-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 3 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 124/280 0/5 DoubleExponent-PT-020-UpperBounds-01 21591721 t fired, 2793369 attempts, .
54 BOUND FNDP 119/285 0/5 DoubleExponent-PT-020-UpperBounds-09 20598021 t fired, 2664550 attempts, .
55 BOUND STEQ 119/245 0/5 DoubleExponent-PT-020-UpperBounds-09 --
Time elapsed: 125 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: LAUNCH task # 95 (type EXCL) for 45 DoubleExponent-PT-020-UpperBounds-15
lola: time limit : 151 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 129/275 0/5 DoubleExponent-PT-020-UpperBounds-01 22306443 t fired, 2885939 attempts, .
54 BOUND FNDP 124/280 0/5 DoubleExponent-PT-020-UpperBounds-09 21410607 t fired, 2769535 attempts, .
55 BOUND STEQ 124/240 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 5/151 3/32 DoubleExponent-PT-020-UpperBounds-15 453980 m, 90796 m/sec, 453980 t fired, result in [0,1] .
Time elapsed: 130 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 134/270 0/5 DoubleExponent-PT-020-UpperBounds-01 22998036 t fired, 2975192 attempts, .
54 BOUND FNDP 129/275 0/5 DoubleExponent-PT-020-UpperBounds-09 22124092 t fired, 2861997 attempts, .
55 BOUND STEQ 129/235 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 10/151 6/32 DoubleExponent-PT-020-UpperBounds-15 900759 m, 89355 m/sec, 900758 t fired, result in [0,1] .
Time elapsed: 135 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 139/265 0/5 DoubleExponent-PT-020-UpperBounds-01 23793653 t fired, 3078109 attempts, .
54 BOUND FNDP 134/270 0/5 DoubleExponent-PT-020-UpperBounds-09 22841936 t fired, 2954994 attempts, .
55 BOUND STEQ 134/230 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 15/151 8/32 DoubleExponent-PT-020-UpperBounds-15 1309805 m, 81809 m/sec, 1309804 t fired, result in [0,1] .
Time elapsed: 140 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 144/260 0/5 DoubleExponent-PT-020-UpperBounds-01 24519356 t fired, 3172299 attempts, .
54 BOUND FNDP 139/265 0/5 DoubleExponent-PT-020-UpperBounds-09 23677269 t fired, 3062779 attempts, .
55 BOUND STEQ 139/225 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 20/151 11/32 DoubleExponent-PT-020-UpperBounds-15 1768568 m, 91752 m/sec, 1768568 t fired, result in [0,1] .
Time elapsed: 145 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 149/255 0/5 DoubleExponent-PT-020-UpperBounds-01 25278146 t fired, 3270547 attempts, .
54 BOUND FNDP 144/260 0/5 DoubleExponent-PT-020-UpperBounds-09 24575519 t fired, 3178884 attempts, .
55 BOUND STEQ 144/220 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 25/151 13/32 DoubleExponent-PT-020-UpperBounds-15 2147171 m, 75720 m/sec, 2147171 t fired, result in [0,1] .
Time elapsed: 150 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 154/250 0/5 DoubleExponent-PT-020-UpperBounds-01 26093493 t fired, 3375973 attempts, .
54 BOUND FNDP 149/255 0/5 DoubleExponent-PT-020-UpperBounds-09 25227928 t fired, 3263345 attempts, .
55 BOUND STEQ 149/215 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 30/151 16/32 DoubleExponent-PT-020-UpperBounds-15 2625308 m, 95627 m/sec, 2625308 t fired, result in [0,1] .
Time elapsed: 155 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 159/245 0/5 DoubleExponent-PT-020-UpperBounds-01 26730212 t fired, 3458327 attempts, .
54 BOUND FNDP 154/250 0/5 DoubleExponent-PT-020-UpperBounds-09 26158208 t fired, 3383554 attempts, .
55 BOUND STEQ 154/210 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 35/151 18/32 DoubleExponent-PT-020-UpperBounds-15 3087951 m, 92528 m/sec, 3087951 t fired, result in [0,1] .
Time elapsed: 160 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 164/240 0/5 DoubleExponent-PT-020-UpperBounds-01 27437375 t fired, 3549664 attempts, .
54 BOUND FNDP 159/245 0/5 DoubleExponent-PT-020-UpperBounds-09 27083068 t fired, 3503453 attempts, .
55 BOUND STEQ 159/205 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 40/151 21/32 DoubleExponent-PT-020-UpperBounds-15 3502058 m, 82821 m/sec, 3502058 t fired, result in [0,1] .
Time elapsed: 165 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 169/235 0/5 DoubleExponent-PT-020-UpperBounds-01 28134341 t fired, 3639948 attempts, .
54 BOUND FNDP 164/240 0/5 DoubleExponent-PT-020-UpperBounds-09 27927577 t fired, 3612851 attempts, .
55 BOUND STEQ 164/200 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 45/151 23/32 DoubleExponent-PT-020-UpperBounds-15 3949768 m, 89542 m/sec, 3949767 t fired, result in [0,1] .
Time elapsed: 170 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 174/230 0/5 DoubleExponent-PT-020-UpperBounds-01 29004082 t fired, 3752539 attempts, .
54 BOUND FNDP 170/235 0/5 DoubleExponent-PT-020-UpperBounds-09 28703598 t fired, 3713057 attempts, .
55 BOUND STEQ 170/195 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 51/151 25/32 DoubleExponent-PT-020-UpperBounds-15 4372498 m, 84546 m/sec, 4372497 t fired, result in [0,1] .
Time elapsed: 176 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 180/224 0/5 DoubleExponent-PT-020-UpperBounds-01 29650482 t fired, 3836154 attempts, .
54 BOUND FNDP 175/229 0/5 DoubleExponent-PT-020-UpperBounds-09 29513291 t fired, 3817951 attempts, .
55 BOUND STEQ 175/189 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 56/151 28/32 DoubleExponent-PT-020-UpperBounds-15 4875283 m, 100557 m/sec, 4875283 t fired, result in [0,1] .
Time elapsed: 181 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 2 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 1 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 185/219 0/5 DoubleExponent-PT-020-UpperBounds-01 30317013 t fired, 3922474 attempts, .
54 BOUND FNDP 180/224 0/5 DoubleExponent-PT-020-UpperBounds-09 30310553 t fired, 3921400 attempts, .
55 BOUND STEQ 180/184 0/5 DoubleExponent-PT-020-UpperBounds-09 --
95 BOUND EXCL 61/151 31/32 DoubleExponent-PT-020-UpperBounds-15 5407801 m, 106503 m/sec, 5407800 t fired, result in [0,1] .
Time elapsed: 186 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: CANCELED task # 95 (type EXCL) for DoubleExponent-PT-020-UpperBounds-15 (memory limit exceeded)
lola: CANCELED task # 55 (type EQUN) for DoubleExponent-PT-020-UpperBounds-09 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 0 1 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 190/214 0/5 DoubleExponent-PT-020-UpperBounds-01 31305436 t fired, 4050471 attempts, .
54 BOUND FNDP 185/219 0/5 DoubleExponent-PT-020-UpperBounds-09 31323415 t fired, 4052432 attempts, .
Time elapsed: 191 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: LAUNCH task # 92 (type EXCL) for 12 DoubleExponent-PT-020-UpperBounds-04
lola: time limit : 154 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 57 (type FNDP) for 18 DoubleExponent-PT-020-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: FINISHED task # 55 (type EQUN) for DoubleExponent-PT-020-UpperBounds-09
lola: result : unknown
lola: time used : 185.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 195/209 0/5 DoubleExponent-PT-020-UpperBounds-01 32545715 t fired, 4210812 attempts, .
54 BOUND FNDP 190/214 0/5 DoubleExponent-PT-020-UpperBounds-09 32547434 t fired, 4210679 attempts, .
57 BOUND FNDP 5/378 0/5 DoubleExponent-PT-020-UpperBounds-06 .
92 BOUND EXCL 5/154 2/32 DoubleExponent-PT-020-UpperBounds-04 328128 m, 65625 m/sec, 328127 t fired, result in [0,1] .
Time elapsed: 196 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
51 BOUND FNDP 200/204 0/5 DoubleExponent-PT-020-UpperBounds-01 33786354 t fired, 4371187 attempts, .
54 BOUND FNDP 195/209 0/5 DoubleExponent-PT-020-UpperBounds-09 33778218 t fired, 4370158 attempts, .
57 BOUND FNDP 10/373 0/5 DoubleExponent-PT-020-UpperBounds-06 .
92 BOUND EXCL 10/154 4/32 DoubleExponent-PT-020-UpperBounds-04 663975 m, 67169 m/sec, 663974 t fired, result in [0,1] .
Time elapsed: 201 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: CANCELED task # 51 (type FNDP) for DoubleExponent-PT-020-UpperBounds-01 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
54 BOUND FNDP 200/204 0/5 DoubleExponent-PT-020-UpperBounds-09 34906927 t fired, 4516244 attempts, .
57 BOUND FNDP 15/368 0/5 DoubleExponent-PT-020-UpperBounds-06 .
92 BOUND EXCL 15/154 6/32 DoubleExponent-PT-020-UpperBounds-04 1015252 m, 70255 m/sec, 1015252 t fired, result in [0,1] .
Time elapsed: 206 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: LAUNCH task # 60 (type FNDP) for 39 DoubleExponent-PT-020-UpperBounds-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
54 BOUND FNDP 205/249 0/5 DoubleExponent-PT-020-UpperBounds-09 36140852 t fired, 4675928 attempts, .
57 BOUND FNDP 20/363 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 5/377 0/5 DoubleExponent-PT-020-UpperBounds-13 1217410 t fired, 157681 attempts, .
92 BOUND EXCL 20/154 8/32 DoubleExponent-PT-020-UpperBounds-04 1360950 m, 69139 m/sec, 1360949 t fired, result in [0,1] .
Time elapsed: 211 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
54 BOUND FNDP 210/244 0/5 DoubleExponent-PT-020-UpperBounds-09 37389115 t fired, 4837588 attempts, .
57 BOUND FNDP 25/358 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 10/372 0/5 DoubleExponent-PT-020-UpperBounds-13 2438545 t fired, 315858 attempts, .
92 BOUND EXCL 25/154 10/32 DoubleExponent-PT-020-UpperBounds-04 1708179 m, 69445 m/sec, 1708178 t fired, result in [0,1] .
Time elapsed: 216 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
54 BOUND FNDP 215/239 0/5 DoubleExponent-PT-020-UpperBounds-09 38637334 t fired, 4998679 attempts, .
57 BOUND FNDP 30/353 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 15/367 0/5 DoubleExponent-PT-020-UpperBounds-13 3655154 t fired, 473030 attempts, .
92 BOUND EXCL 30/154 12/32 DoubleExponent-PT-020-UpperBounds-04 2048131 m, 67990 m/sec, 2048130 t fired, result in [0,1] .
Time elapsed: 221 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
54 BOUND FNDP 220/234 0/5 DoubleExponent-PT-020-UpperBounds-09 39905881 t fired, 5162970 attempts, .
57 BOUND FNDP 35/348 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 20/362 0/5 DoubleExponent-PT-020-UpperBounds-13 4864720 t fired, 629655 attempts, .
92 BOUND EXCL 35/154 14/32 DoubleExponent-PT-020-UpperBounds-04 2388961 m, 68166 m/sec, 2388960 t fired, result in [0,1] .
Time elapsed: 226 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
54 BOUND FNDP 225/229 0/5 DoubleExponent-PT-020-UpperBounds-09 41166164 t fired, 5326162 attempts, .
57 BOUND FNDP 40/343 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 25/357 0/5 DoubleExponent-PT-020-UpperBounds-13 6081148 t fired, 786962 attempts, .
92 BOUND EXCL 40/154 16/32 DoubleExponent-PT-020-UpperBounds-04 2727827 m, 67773 m/sec, 2727827 t fired, result in [0,1] .
Time elapsed: 231 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: CANCELED task # 54 (type FNDP) for DoubleExponent-PT-020-UpperBounds-09 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
57 BOUND FNDP 45/338 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 30/352 0/5 DoubleExponent-PT-020-UpperBounds-13 7294489 t fired, 943751 attempts, .
92 BOUND EXCL 45/154 18/32 DoubleExponent-PT-020-UpperBounds-04 3067054 m, 67845 m/sec, 3067053 t fired, result in [0,1] .
Time elapsed: 236 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: LAUNCH task # 63 (type FNDP) for 36 DoubleExponent-PT-020-UpperBounds-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-01: BOUND 0 2 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
DoubleExponent-PT-020-UpperBounds-05: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-06: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-07: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-08: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-09: BOUND 0 1 0 0 1 1 0 0
DoubleExponent-PT-020-UpperBounds-10: BOUND 0 3 0 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
DoubleExponent-PT-020-UpperBounds-12: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-13: BOUND 0 2 1 0 0 0 0 0
DoubleExponent-PT-020-UpperBounds-15: BOUND 0 2 0 0 0 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
57 BOUND FNDP 50/381 0/5 DoubleExponent-PT-020-UpperBounds-06 .
60 BOUND FNDP 35/394 0/5 DoubleExponent-PT-020-UpperBounds-13 8566167 t fired, 1108551 attempts, .
63 BOUND FNDP 5/373 0/5 DoubleExponent-PT-020-UpperBounds-12 580597 t fired, 75252 attempts, .
92 BOUND EXCL 50/154 20/32 DoubleExponent-PT-020-UpperBounds-04 3406961 m, 67981 m/sec, 3406960 t fired, result in [0,1] .
Time elapsed: 241 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 16
lola: caught signal Terminated - aborting LoLA
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-UpperBounds-00: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-01: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-02: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-03: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-04: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-05: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-06: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-07: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-08: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-09: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-10: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-11: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-12: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-13: BOUND ??? AGGR
DoubleExponent-PT-020-UpperBounds-14: BOUND 1 state space
DoubleExponent-PT-020-UpperBounds-15: BOUND ??? AGGR
Time elapsed: 243 secs. Pages in use: 32
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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r135-smll-167819414500485"
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 ;