About the Execution of LTSMin+red for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.252 | 3257678.00 | 11369004.00 | 3711.10 | ? ? 1 1 ? 1 ? ? ? ? ? ? ? ? 2 ? | 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.r137-smll-167819418600477.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 ltsminxred
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418600477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 169K 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-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678870904336
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 09:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 09:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:01:47] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-15 09:01:47] [INFO ] Transformed 534 places.
[2023-03-15 09:01:47] [INFO ] Transformed 498 transitions.
[2023-03-15 09:01:47] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 498 rows 534 cols
[2023-03-15 09:01:47] [INFO ] Computed 54 place invariants in 122 ms
Incomplete random walk after 10000 steps, including 334 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :4
FORMULA DoubleExponent-PT-010-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 300 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
[2023-03-15 09:01:47] [INFO ] Invariant cache hit.
[2023-03-15 09:01:48] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-15 09:01:48] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 37 ms returned sat
[2023-03-15 09:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:01:48] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-15 09:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:01:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-15 09:01:48] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 40 ms returned sat
[2023-03-15 09:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:01:49] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-03-15 09:01:49] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 6 ms to minimize.
[2023-03-15 09:01:49] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 1 ms to minimize.
[2023-03-15 09:01:50] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 09:01:50] [INFO ] Deduced a trap composed of 176 places in 219 ms of which 2 ms to minimize.
[2023-03-15 09:01:50] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 09:01:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1564 ms
[2023-03-15 09:01:50] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-15 09:01:53] [INFO ] Added : 260 causal constraints over 52 iterations in 2799 ms. Result :unknown
[2023-03-15 09:01:53] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-15 09:01:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-15 09:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:01:54] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-15 09:01:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:01:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 09:01:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 31 ms returned sat
[2023-03-15 09:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:01:54] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2023-03-15 09:01:55] [INFO ] Deduced a trap composed of 193 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:01:55] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 0 ms to minimize.
[2023-03-15 09:01:55] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 1 ms to minimize.
[2023-03-15 09:01:55] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 1 ms to minimize.
[2023-03-15 09:01:55] [INFO ] Deduced a trap composed of 89 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:01:56] [INFO ] Deduced a trap composed of 221 places in 280 ms of which 1 ms to minimize.
[2023-03-15 09:01:56] [INFO ] Deduced a trap composed of 229 places in 288 ms of which 1 ms to minimize.
[2023-03-15 09:01:56] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2023-03-15 09:01:56] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 1 ms to minimize.
[2023-03-15 09:01:57] [INFO ] Deduced a trap composed of 91 places in 247 ms of which 1 ms to minimize.
[2023-03-15 09:01:57] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 0 ms to minimize.
[2023-03-15 09:01:57] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:01:57] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:01:58] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:01:58] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 1 ms to minimize.
[2023-03-15 09:01:58] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:01:58] [INFO ] Deduced a trap composed of 217 places in 241 ms of which 1 ms to minimize.
[2023-03-15 09:01:59] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:01:59] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 1 ms to minimize.
[2023-03-15 09:01:59] [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-15 09:01:59] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:01:59] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned unsat
[2023-03-15 09:01:59] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:01:59] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned unsat
[2023-03-15 09:01:59] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:01:59] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:00] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-15 09:02:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:00] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:00] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-15 09:02:01] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 1 ms to minimize.
[2023-03-15 09:02:01] [INFO ] Deduced a trap composed of 190 places in 248 ms of which 1 ms to minimize.
[2023-03-15 09:02:01] [INFO ] Deduced a trap composed of 189 places in 246 ms of which 1 ms to minimize.
[2023-03-15 09:02:01] [INFO ] Deduced a trap composed of 186 places in 265 ms of which 1 ms to minimize.
[2023-03-15 09:02:02] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 0 ms to minimize.
[2023-03-15 09:02:02] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 1 ms to minimize.
[2023-03-15 09:02:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1622 ms
[2023-03-15 09:02:02] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-15 09:02:03] [INFO ] Added : 150 causal constraints over 30 iterations in 1388 ms. Result :sat
Minimization took 597 ms.
[2023-03-15 09:02:04] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:02:04] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:04] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-15 09:02:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:04] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 26 ms returned sat
[2023-03-15 09:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:05] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-15 09:02:05] [INFO ] Deduced a trap composed of 211 places in 258 ms of which 1 ms to minimize.
[2023-03-15 09:02:05] [INFO ] Deduced a trap composed of 192 places in 273 ms of which 1 ms to minimize.
[2023-03-15 09:02:06] [INFO ] Deduced a trap composed of 189 places in 248 ms of which 0 ms to minimize.
[2023-03-15 09:02:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 957 ms
[2023-03-15 09:02:06] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-15 09:02:07] [INFO ] Added : 109 causal constraints over 22 iterations in 1270 ms. Result :sat
Minimization took 624 ms.
[2023-03-15 09:02:08] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:08] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:08] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-15 09:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 09:02:08] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-15 09:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:09] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2023-03-15 09:02:09] [INFO ] Deduced a trap composed of 205 places in 286 ms of which 1 ms to minimize.
[2023-03-15 09:02:09] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-15 09:02:10] [INFO ] Deduced a trap composed of 241 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:02:10] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 1 ms to minimize.
[2023-03-15 09:02:10] [INFO ] Deduced a trap composed of 83 places in 256 ms of which 1 ms to minimize.
[2023-03-15 09:02:11] [INFO ] Deduced a trap composed of 49 places in 387 ms of which 1 ms to minimize.
[2023-03-15 09:02:11] [INFO ] Deduced a trap composed of 214 places in 256 ms of which 1 ms to minimize.
[2023-03-15 09:02:11] [INFO ] Deduced a trap composed of 219 places in 242 ms of which 1 ms to minimize.
[2023-03-15 09:02:12] [INFO ] Deduced a trap composed of 213 places in 461 ms of which 1 ms to minimize.
[2023-03-15 09:02:12] [INFO ] Deduced a trap composed of 218 places in 268 ms of which 1 ms to minimize.
[2023-03-15 09:02:13] [INFO ] Deduced a trap composed of 199 places in 299 ms of which 1 ms to minimize.
[2023-03-15 09:02:13] [INFO ] Deduced a trap composed of 211 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:02:13] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 1 ms to minimize.
[2023-03-15 09:02: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 6
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-15 09:02:13] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:13] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:14] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-15 09:02:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:14] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:14] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-15 09:02:14] [INFO ] Deduced a trap composed of 209 places in 284 ms of which 1 ms to minimize.
[2023-03-15 09:02:15] [INFO ] Deduced a trap composed of 203 places in 258 ms of which 1 ms to minimize.
[2023-03-15 09:02:15] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 1 ms to minimize.
[2023-03-15 09:02:15] [INFO ] Deduced a trap composed of 220 places in 370 ms of which 1 ms to minimize.
[2023-03-15 09:02:16] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 2 ms to minimize.
[2023-03-15 09:02:16] [INFO ] Deduced a trap composed of 204 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:02:16] [INFO ] Deduced a trap composed of 221 places in 267 ms of which 1 ms to minimize.
[2023-03-15 09:02:17] [INFO ] Deduced a trap composed of 223 places in 270 ms of which 0 ms to minimize.
[2023-03-15 09:02:17] [INFO ] Deduced a trap composed of 225 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:02:17] [INFO ] Deduced a trap composed of 221 places in 270 ms of which 0 ms to minimize.
[2023-03-15 09:02:18] [INFO ] Deduced a trap composed of 207 places in 295 ms of which 5 ms to minimize.
[2023-03-15 09:02:18] [INFO ] Deduced a trap composed of 237 places in 388 ms of which 2 ms to minimize.
[2023-03-15 09:02:18] [INFO ] Deduced a trap composed of 219 places in 273 ms of which 1 ms to minimize.
[2023-03-15 09:02:19] [INFO ] Deduced a trap composed of 215 places in 260 ms of which 1 ms to minimize.
[2023-03-15 09:02:19] [INFO ] Deduced a trap composed of 219 places in 271 ms of which 1 ms to minimize.
[2023-03-15 09:02:19] [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 7
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-15 09:02:19] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-15 09:02:19] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 41 ms returned sat
[2023-03-15 09:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:20] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-15 09:02:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:02:20] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:20] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2023-03-15 09:02:20] [INFO ] Deduced a trap composed of 203 places in 264 ms of which 1 ms to minimize.
[2023-03-15 09:02:21] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:02:21] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 1 ms to minimize.
[2023-03-15 09:02:21] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 0 ms to minimize.
[2023-03-15 09:02:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 836 ms
[2023-03-15 09:02:21] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-15 09:02:25] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 2 ms to minimize.
[2023-03-15 09:02:25] [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 8
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)
[2023-03-15 09:02:25] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:02:25] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-15 09:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:25] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-15 09:02:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:26] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-15 09:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:26] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-15 09:02:26] [INFO ] Deduced a trap composed of 206 places in 287 ms of which 1 ms to minimize.
[2023-03-15 09:02:27] [INFO ] Deduced a trap composed of 204 places in 297 ms of which 5 ms to minimize.
[2023-03-15 09:02:27] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 1 ms to minimize.
[2023-03-15 09:02:27] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:02:27] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 1 ms to minimize.
[2023-03-15 09:02:27] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:02:28] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 0 ms to minimize.
[2023-03-15 09:02:28] [INFO ] Deduced a trap composed of 217 places in 280 ms of which 0 ms to minimize.
[2023-03-15 09:02:28] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 1 ms to minimize.
[2023-03-15 09:02:29] [INFO ] Deduced a trap composed of 199 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:02:29] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 1 ms to minimize.
[2023-03-15 09:02:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3179 ms
[2023-03-15 09:02:29] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-15 09:02:31] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 1 ms to minimize.
[2023-03-15 09:02: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 9
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)
[2023-03-15 09:02:31] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:31] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 09:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:31] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-15 09:02:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:31] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 32 ms returned sat
[2023-03-15 09:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:32] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-15 09:02:32] [INFO ] Deduced a trap composed of 185 places in 275 ms of which 1 ms to minimize.
[2023-03-15 09:02:32] [INFO ] Deduced a trap composed of 192 places in 257 ms of which 1 ms to minimize.
[2023-03-15 09:02:33] [INFO ] Deduced a trap composed of 189 places in 268 ms of which 1 ms to minimize.
[2023-03-15 09:02:33] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 1 ms to minimize.
[2023-03-15 09:02:33] [INFO ] Deduced a trap composed of 228 places in 365 ms of which 1 ms to minimize.
[2023-03-15 09:02:34] [INFO ] Deduced a trap composed of 204 places in 285 ms of which 1 ms to minimize.
[2023-03-15 09:02:34] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:02:34] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 1 ms to minimize.
[2023-03-15 09:02:34] [INFO ] Deduced a trap composed of 215 places in 247 ms of which 1 ms to minimize.
[2023-03-15 09:02:35] [INFO ] Deduced a trap composed of 202 places in 377 ms of which 1 ms to minimize.
[2023-03-15 09:02:35] [INFO ] Deduced a trap composed of 177 places in 279 ms of which 1 ms to minimize.
[2023-03-15 09:02:35] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 0 ms to minimize.
[2023-03-15 09:02:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3613 ms
[2023-03-15 09:02:35] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-15 09:02:36] [INFO ] Added : 75 causal constraints over 15 iterations in 874 ms. Result :unknown
[2023-03-15 09:02:36] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:02:36] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-15 09:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:37] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2023-03-15 09:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:37] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-15 09:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:37] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2023-03-15 09:02:37] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-15 09:02:42] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:02: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.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)
[2023-03-15 09:02:42] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:42] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 09:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:43] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-15 09:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:43] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 09:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:43] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-15 09:02:43] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 1 ms to minimize.
[2023-03-15 09:02:44] [INFO ] Deduced a trap composed of 174 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:02:44] [INFO ] Deduced a trap composed of 167 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:02:44] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:02:45] [INFO ] Deduced a trap composed of 169 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:02:45] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:02:45] [INFO ] Deduced a trap composed of 183 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:02:45] [INFO ] Deduced a trap composed of 194 places in 273 ms of which 0 ms to minimize.
[2023-03-15 09:02:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2416 ms
[2023-03-15 09:02:45] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-15 09:02:47] [INFO ] Deduced a trap composed of 214 places in 276 ms of which 0 ms to minimize.
[2023-03-15 09:02:48] [INFO ] Deduced a trap composed of 207 places in 273 ms of which 1 ms to minimize.
[2023-03-15 09:02:48] [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.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)
[2023-03-15 09:02:48] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:02:48] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2023-03-15 09:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:48] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-15 09:02:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 09:02:48] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:49] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-15 09:02:49] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-15 09:02:50] [INFO ] Deduced a trap composed of 186 places in 246 ms of which 1 ms to minimize.
[2023-03-15 09:02:50] [INFO ] Deduced a trap composed of 204 places in 254 ms of which 1 ms to minimize.
[2023-03-15 09:02:50] [INFO ] Deduced a trap composed of 229 places in 243 ms of which 1 ms to minimize.
[2023-03-15 09:02:50] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 0 ms to minimize.
[2023-03-15 09:02:51] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:02:51] [INFO ] Deduced a trap composed of 221 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:02:51] [INFO ] Deduced a trap composed of 241 places in 247 ms of which 1 ms to minimize.
[2023-03-15 09:02:52] [INFO ] Deduced a trap composed of 221 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:02:52] [INFO ] Deduced a trap composed of 225 places in 278 ms of which 1 ms to minimize.
[2023-03-15 09:02:52] [INFO ] Deduced a trap composed of 226 places in 234 ms of which 1 ms to minimize.
[2023-03-15 09:02:53] [INFO ] Deduced a trap composed of 217 places in 257 ms of which 1 ms to minimize.
[2023-03-15 09:02:53] [INFO ] Deduced a trap composed of 203 places in 275 ms of which 1 ms to minimize.
[2023-03-15 09:02:53] [INFO ] Deduced a trap composed of 206 places in 370 ms of which 1 ms to minimize.
[2023-03-15 09:02:53] [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-15 09:02:54] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:54] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-15 09:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:54] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-15 09:02:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:02:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 09:02:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-15 09:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:02:54] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2023-03-15 09:02:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-15 09:02:59] [INFO ] Added : 325 causal constraints over 65 iterations in 4527 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 2, -1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 527 transition count 390
Reduce places removed 106 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 421 transition count 387
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 222 place count 418 transition count 387
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 222 place count 418 transition count 365
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 266 place count 396 transition count 365
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 446 place count 306 transition count 275
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 480 place count 289 transition count 275
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 517 place count 289 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 554 place count 252 transition count 238
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 596 place count 252 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 597 place count 251 transition count 237
Applied a total of 597 rules in 202 ms. Remains 251 /534 variables (removed 283) and now considering 237/498 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 251/534 places, 237/498 transitions.
// Phase 1: matrix 237 rows 251 cols
[2023-03-15 09:03:15] [INFO ] Computed 50 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 127962 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84683 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84655 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84799 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84755 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84770 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84393 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84927 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84813 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84381 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84817 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84674 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84773 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84908 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 13) seen :1
[2023-03-15 09:03:28] [INFO ] Invariant cache hit.
[2023-03-15 09:03:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:28] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:28] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-15 09:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:29] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:29] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-15 09:03:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:03:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 93 ms returned sat
[2023-03-15 09:03:29] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-15 09:03:30] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 1 ms to minimize.
[2023-03-15 09:03:30] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2023-03-15 09:03:30] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 1 ms to minimize.
[2023-03-15 09:03:30] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:03:30] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-15 09:03:31] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:03:31] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:03:31] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2023-03-15 09:03:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2030 ms
[2023-03-15 09:03:32] [INFO ] Added : 92 causal constraints over 19 iterations in 2798 ms. Result :sat
Minimization took 217 ms.
[2023-03-15 09:03:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:32] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:32] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-15 09:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:32] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 24 ms returned sat
[2023-03-15 09:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:32] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-15 09:03:32] [INFO ] [Nat]Added 33 Read/Feed constraints in 63 ms returned sat
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-15 09:03:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1025 ms
[2023-03-15 09:03:33] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:03:35] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-15 09:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-15 09:03:35] [INFO ] Added : 132 causal constraints over 27 iterations in 1888 ms. Result :sat
Minimization took 429 ms.
[2023-03-15 09:03:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:36] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:36] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-15 09:03:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:36] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:36] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-15 09:03:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 56 ms returned sat
[2023-03-15 09:03:36] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 20 ms.
[2023-03-15 09:03:38] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:03:38] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:03:38] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:03:38] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2023-03-15 09:03:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 635 ms
[2023-03-15 09:03:38] [INFO ] Added : 82 causal constraints over 17 iterations in 1845 ms. Result :sat
Minimization took 161 ms.
[2023-03-15 09:03:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:38] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned unsat
[2023-03-15 09:03:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:38] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:39] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-15 09:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:39] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:39] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-15 09:03:39] [INFO ] [Nat]Added 33 Read/Feed constraints in 480 ms returned sat
[2023-03-15 09:03:39] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-15 09:03:40] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:03:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-15 09:03:40] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 17 ms.
[2023-03-15 09:03:41] [INFO ] Added : 129 causal constraints over 26 iterations in 1927 ms. Result :sat
Minimization took 571 ms.
[2023-03-15 09:03:42] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:42] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:42] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-15 09:03:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:42] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:42] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-15 09:03:43] [INFO ] [Nat]Added 33 Read/Feed constraints in 404 ms returned sat
[2023-03-15 09:03:43] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:03:43] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:03:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2023-03-15 09:03:43] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 17 ms.
[2023-03-15 09:03:45] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:03:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-15 09:03:45] [INFO ] Added : 97 causal constraints over 21 iterations in 1465 ms. Result :sat
Minimization took 465 ms.
[2023-03-15 09:03:45] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:45] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:45] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-15 09:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:45] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:46] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-15 09:03:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 103 ms returned sat
[2023-03-15 09:03:46] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-15 09:03:48] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:03:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-15 09:03:48] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-15 09:03:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 377 ms
[2023-03-15 09:03:48] [INFO ] Added : 172 causal constraints over 35 iterations in 2462 ms. Result :sat
Minimization took 459 ms.
[2023-03-15 09:03:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:49] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2023-03-15 09:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:49] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-15 09:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:49] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:49] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-15 09:03:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 285 ms returned sat
[2023-03-15 09:03:50] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:03:50] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:03:50] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:03:50] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:03:50] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:03:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 728 ms
[2023-03-15 09:03:50] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:03:51] [INFO ] Added : 85 causal constraints over 17 iterations in 744 ms. Result :sat
Minimization took 197 ms.
[2023-03-15 09:03:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:51] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-15 09:03:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:51] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-15 09:03:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 78 ms returned sat
[2023-03-15 09:03:52] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-15 09:03:54] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:03:54] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:03:54] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 1 ms to minimize.
[2023-03-15 09:03:54] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:03:55] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:03:55] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 0 ms to minimize.
[2023-03-15 09:03:55] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:03:55] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 1 ms to minimize.
[2023-03-15 09:03:55] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:03:55] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:03:56] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:03:56] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 0 ms to minimize.
[2023-03-15 09:03:56] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 1 ms to minimize.
[2023-03-15 09:03:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2255 ms
[2023-03-15 09:03:56] [INFO ] Added : 179 causal constraints over 36 iterations in 4385 ms. Result :sat
Minimization took 397 ms.
[2023-03-15 09:03:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:56] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:57] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-15 09:03:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:57] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:57] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-15 09:03:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 96 ms returned sat
[2023-03-15 09:03:57] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:03:58] [INFO ] Added : 120 causal constraints over 24 iterations in 1141 ms. Result :sat
Minimization took 247 ms.
[2023-03-15 09:03:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:03:58] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:59] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-15 09:03:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:03:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:03:59] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:03:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:03:59] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-15 09:03:59] [INFO ] [Nat]Added 33 Read/Feed constraints in 30 ms returned sat
[2023-03-15 09:03:59] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:03:59] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2023-03-15 09:04:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 09:04:00] [INFO ] Added : 69 causal constraints over 15 iterations in 745 ms. Result :sat
Minimization took 326 ms.
[2023-03-15 09:04:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:04:00] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:04:00] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-15 09:04:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:04:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:04:00] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:04:00] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-15 09:04:01] [INFO ] [Nat]Added 33 Read/Feed constraints in 141 ms returned sat
[2023-03-15 09:04:01] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 17 ms.
[2023-03-15 09:04:02] [INFO ] Added : 139 causal constraints over 28 iterations in 1509 ms. Result :sat
Minimization took 393 ms.
[2023-03-15 09:04:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:04:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:04:03] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-15 09:04:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:04:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:04:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:04:03] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-15 09:04:03] [INFO ] [Nat]Added 33 Read/Feed constraints in 123 ms returned sat
[2023-03-15 09:04:03] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-15 09:04:04] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-15 09:04:04] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:04:04] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2023-03-15 09:04:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2023-03-15 09:04:04] [INFO ] Added : 124 causal constraints over 25 iterations in 1406 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 237/237 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 250 transition count 236
Applied a total of 2 rules in 37 ms. Remains 250 /251 variables (removed 1) and now considering 236/237 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 250/251 places, 236/237 transitions.
// Phase 1: matrix 236 rows 250 cols
[2023-03-15 09:04:52] [INFO ] Computed 50 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 128352 resets, run finished after 1248 ms. (steps per millisecond=801 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84823 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84863 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84733 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84979 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84857 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84512 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84731 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84565 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84679 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84894 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84767 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84780 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 12) seen :0
[2023-03-15 09:05:04] [INFO ] Invariant cache hit.
[2023-03-15 09:05:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:04] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:04] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-15 09:05:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:04] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:04] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-15 09:05:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:05:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 73 ms returned sat
[2023-03-15 09:05:04] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-15 09:05:04] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:05] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 1 ms to minimize.
[2023-03-15 09:05:06] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:05:06] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 1 ms to minimize.
[2023-03-15 09:05:06] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 1 ms to minimize.
[2023-03-15 09:05:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 728 ms
[2023-03-15 09:05:06] [INFO ] Added : 109 causal constraints over 23 iterations in 1765 ms. Result :sat
Minimization took 377 ms.
[2023-03-15 09:05:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:06] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:07] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-15 09:05:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:07] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:07] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-15 09:05:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 79 ms returned sat
[2023-03-15 09:05:07] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:05:07] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:05:08] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-15 09:05:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 722 ms
[2023-03-15 09:05:08] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:09] [INFO ] Added : 119 causal constraints over 24 iterations in 1113 ms. Result :sat
Minimization took 287 ms.
[2023-03-15 09:05:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:09] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:09] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-15 09:05:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:09] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:09] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-15 09:05:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 93 ms returned sat
[2023-03-15 09:05:10] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 15 ms.
[2023-03-15 09:05:10] [INFO ] Added : 56 causal constraints over 12 iterations in 411 ms. Result :sat
Minimization took 271 ms.
[2023-03-15 09:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:10] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:10] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-15 09:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:10] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:11] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-15 09:05:12] [INFO ] [Nat]Added 33 Read/Feed constraints in 899 ms returned sat
[2023-03-15 09:05:12] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-15 09:05:13] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2023-03-15 09:05:13] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2023-03-15 09:05:13] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-15 09:05:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-15 09:05:14] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-15 09:05:14] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-15 09:05:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 782 ms
[2023-03-15 09:05:14] [INFO ] Added : 123 causal constraints over 25 iterations in 2340 ms. Result :sat
Minimization took 255 ms.
[2023-03-15 09:05:14] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:14] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:14] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-15 09:05:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:14] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:05:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:15] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-15 09:05:15] [INFO ] [Nat]Added 33 Read/Feed constraints in 253 ms returned sat
[2023-03-15 09:05:15] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:16] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-15 09:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-15 09:05:16] [INFO ] Added : 92 causal constraints over 20 iterations in 1187 ms. Result :sat
Minimization took 293 ms.
[2023-03-15 09:05:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:05:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:17] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:17] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:17] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-15 09:05:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 71 ms returned sat
[2023-03-15 09:05:17] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-15 09:05:17] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:19] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2023-03-15 09:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-15 09:05:19] [INFO ] Added : 176 causal constraints over 36 iterations in 1642 ms. Result :sat
Minimization took 564 ms.
[2023-03-15 09:05:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:19] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:19] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-15 09:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:20] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:20] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-15 09:05:20] [INFO ] [Nat]Added 33 Read/Feed constraints in 105 ms returned sat
[2023-03-15 09:05:20] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:05:20] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 0 ms to minimize.
[2023-03-15 09:05:20] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 1 ms to minimize.
[2023-03-15 09:05:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 502 ms
[2023-03-15 09:05:20] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 17 ms.
[2023-03-15 09:05:21] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2023-03-15 09:05:21] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-15 09:05:22] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:05:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 516 ms
[2023-03-15 09:05:22] [INFO ] Added : 91 causal constraints over 19 iterations in 1304 ms. Result :sat
Minimization took 467 ms.
[2023-03-15 09:05:22] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2023-03-15 09:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:22] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-15 09:05:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:22] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:23] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-15 09:05:23] [INFO ] [Nat]Added 33 Read/Feed constraints in 148 ms returned sat
[2023-03-15 09:05:23] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 22 ms.
[2023-03-15 09:05:25] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 09:05:25] [INFO ] Added : 164 causal constraints over 33 iterations in 1911 ms. Result :sat
Minimization took 391 ms.
[2023-03-15 09:05:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:25] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:25] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-15 09:05:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:26] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:26] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-15 09:05:26] [INFO ] [Nat]Added 33 Read/Feed constraints in 88 ms returned sat
[2023-03-15 09:05:26] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:26] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-15 09:05:27] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-15 09:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2023-03-15 09:05:27] [INFO ] Added : 79 causal constraints over 17 iterations in 911 ms. Result :sat
Minimization took 291 ms.
[2023-03-15 09:05:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:27] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-15 09:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:27] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-15 09:05:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:27] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 09:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:27] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-15 09:05:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 98 ms returned sat
[2023-03-15 09:05:28] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-15 09:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-15 09:05:28] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-15 09:05:28] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-15 09:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 09:05:28] [INFO ] Added : 51 causal constraints over 11 iterations in 484 ms. Result :sat
Minimization took 152 ms.
[2023-03-15 09:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 09:05:28] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 09:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:29] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-15 09:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:29] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 09:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:29] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-15 09:05:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2023-03-15 09:05:29] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-15 09:05:30] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:05:30] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:05:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2023-03-15 09:05:30] [INFO ] Added : 139 causal constraints over 28 iterations in 1359 ms. Result :sat
Minimization took 399 ms.
[2023-03-15 09:05:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 09:05:31] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2023-03-15 09:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:31] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-15 09:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:05:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 09:05:31] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-15 09:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:05:31] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-15 09:05:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 180 ms returned sat
[2023-03-15 09:05:31] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 26 ms.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 0 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2023-03-15 09:05:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 878 ms
[2023-03-15 09:05:33] [INFO ] Added : 124 causal constraints over 25 iterations in 1992 ms. Result :sat
Minimization took 399 ms.
Current structural bounds on expressions (after SMT) : [-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]
Support contains 12 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 236/236 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 250/250 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 236/236 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-15 09:06:05] [INFO ] Invariant cache hit.
[2023-03-15 09:06:05] [INFO ] Implicit Places using invariants in 551 ms returned [21, 27, 48, 53, 76, 81, 102, 110, 132, 137, 138, 158, 163, 187, 193, 200, 210, 216, 241, 247]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 555 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/250 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 235
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 11 place count 229 transition count 226
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 20 place count 220 transition count 226
Applied a total of 20 rules in 38 ms. Remains 220 /230 variables (removed 10) and now considering 226/236 (removed 10) transitions.
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:06:05] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-15 09:06:06] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-15 09:06:06] [INFO ] Invariant cache hit.
[2023-03-15 09:06:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:06:08] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 220/250 places, 226/236 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2940 ms. Remains : 220/250 places, 226/236 transitions.
[2023-03-15 09:06:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144017 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91029 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91409 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91014 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91649 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91272 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91571 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91106 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91486 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91327 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91387 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91308 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91283 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 12) seen :0
[2023-03-15 09:06:18] [INFO ] Invariant cache hit.
[2023-03-15 09:06:18] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:06:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:19] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-15 09:06:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:06:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:19] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-15 09:06:19] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:06:19] [INFO ] [Nat]Added 33 Read/Feed constraints in 105 ms returned sat
[2023-03-15 09:06:19] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:20] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-15 09:06:20] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-15 09:06:20] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 1 ms to minimize.
[2023-03-15 09:06:20] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 0 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 0 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 0 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 1 ms to minimize.
[2023-03-15 09:06:21] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 1 ms to minimize.
[2023-03-15 09:06:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1673 ms
[2023-03-15 09:06:22] [INFO ] Added : 107 causal constraints over 22 iterations in 2588 ms. Result :sat
Minimization took 242 ms.
[2023-03-15 09:06:22] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:22] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-15 09:06:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 09:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:22] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-15 09:06:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 45 ms returned sat
[2023-03-15 09:06:22] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-15 09:06:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 865 ms
[2023-03-15 09:06:26] [INFO ] Added : 191 causal constraints over 39 iterations in 3990 ms. Result :sat
Minimization took 663 ms.
[2023-03-15 09:06:27] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:27] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-15 09:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:27] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-15 09:06:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 95 ms returned sat
[2023-03-15 09:06:28] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-15 09:06:28] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:28] [INFO ] Added : 59 causal constraints over 13 iterations in 383 ms. Result :sat
Minimization took 169 ms.
[2023-03-15 09:06:28] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:28] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-15 09:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:29] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-15 09:06:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 911 ms returned sat
[2023-03-15 09:06:30] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 0 ms to minimize.
[2023-03-15 09:06:30] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-15 09:06:30] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:06:30] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:06:30] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 0 ms to minimize.
[2023-03-15 09:06:30] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:06:31] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:06:31] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 0 ms to minimize.
[2023-03-15 09:06:31] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:06:31] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 1 ms to minimize.
[2023-03-15 09:06:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1728 ms
[2023-03-15 09:06:31] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 09:06:36] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2023-03-15 09:06:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-15 09:06:36] [INFO ] Added : 177 causal constraints over 36 iterations in 4853 ms. Result :sat
Minimization took 3036 ms.
[2023-03-15 09:06:39] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:39] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-15 09:06:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:40] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:06:40] [INFO ] [Nat]Added 33 Read/Feed constraints in 473 ms returned sat
[2023-03-15 09:06:40] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:06:40] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:06:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2023-03-15 09:06:40] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:41] [INFO ] Added : 94 causal constraints over 20 iterations in 888 ms. Result :sat
Minimization took 306 ms.
[2023-03-15 09:06:42] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:42] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-15 09:06:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:42] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-15 09:06:42] [INFO ] [Nat]Added 33 Read/Feed constraints in 168 ms returned sat
[2023-03-15 09:06:42] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 25 ms.
[2023-03-15 09:06:45] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-15 09:06:45] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-15 09:06:45] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-15 09:06:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2023-03-15 09:06:45] [INFO ] Added : 183 causal constraints over 37 iterations in 2673 ms. Result :sat
Minimization took 960 ms.
[2023-03-15 09:06:46] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:46] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-15 09:06:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:46] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2023-03-15 09:06:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 27 ms returned sat
[2023-03-15 09:06:46] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:48] [INFO ] Added : 132 causal constraints over 28 iterations in 1845 ms. Result :sat
Minimization took 570 ms.
[2023-03-15 09:06:49] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:49] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-15 09:06:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:49] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-15 09:06:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 146 ms returned sat
[2023-03-15 09:06:50] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:52] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-15 09:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-15 09:06:52] [INFO ] Added : 155 causal constraints over 32 iterations in 2341 ms. Result :sat
Minimization took 509 ms.
[2023-03-15 09:06:52] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:53] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-15 09:06:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:53] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-15 09:06:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 328 ms returned sat
[2023-03-15 09:06:53] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:54] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:06:54] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:06:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2023-03-15 09:06:54] [INFO ] Added : 79 causal constraints over 17 iterations in 1072 ms. Result :sat
Minimization took 161 ms.
[2023-03-15 09:06:54] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:54] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:55] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-15 09:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:06:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:55] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-15 09:06:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 89 ms returned sat
[2023-03-15 09:06:55] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:06:56] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2023-03-15 09:06:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-15 09:06:56] [INFO ] Added : 89 causal constraints over 19 iterations in 876 ms. Result :sat
Minimization took 488 ms.
[2023-03-15 09:06:56] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:56] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-15 09:06:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:06:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:06:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:06:57] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-15 09:06:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 143 ms returned sat
[2023-03-15 09:06:57] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 18 ms.
[2023-03-15 09:06:59] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 3 ms to minimize.
[2023-03-15 09:06:59] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2023-03-15 09:06:59] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 0 ms to minimize.
[2023-03-15 09:06:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2023-03-15 09:06:59] [INFO ] Added : 132 causal constraints over 27 iterations in 2075 ms. Result :sat
Minimization took 652 ms.
[2023-03-15 09:07:00] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:07:00] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:00] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-15 09:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:07:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:07:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:00] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-15 09:07:00] [INFO ] [Nat]Added 33 Read/Feed constraints in 251 ms returned sat
[2023-03-15 09:07:00] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-15 09:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-15 09:07:00] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 09:07:02] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-15 09:07:02] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 0 ms to minimize.
[2023-03-15 09:07:03] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:07:03] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:07:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 563 ms
[2023-03-15 09:07:03] [INFO ] Added : 139 causal constraints over 29 iterations in 2603 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : [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]
Support contains 12 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Applied a total of 0 rules in 15 ms. Remains 220 /220 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 220/220 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Applied a total of 0 rules in 9 ms. Remains 220 /220 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-15 09:07:32] [INFO ] Invariant cache hit.
[2023-03-15 09:07:33] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-15 09:07:33] [INFO ] Invariant cache hit.
[2023-03-15 09:07:33] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:07:35] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-15 09:07:35] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 09:07:35] [INFO ] Invariant cache hit.
[2023-03-15 09:07:35] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2435 ms. Remains : 220/220 places, 226/226 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
[2023-03-15 09:07:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:07:35] [INFO ] Invariant cache hit.
[2023-03-15 09:07:35] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:07:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:35] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-15 09:07:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:07:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:07:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:35] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-15 09:07:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:07:35] [INFO ] [Nat]Added 33 Read/Feed constraints in 104 ms returned sat
[2023-03-15 09:07:35] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 09:07:36] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 1 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 0 ms to minimize.
[2023-03-15 09:07:37] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:07:38] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2023-03-15 09:07:38] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 1 ms to minimize.
[2023-03-15 09:07:38] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 0 ms to minimize.
[2023-03-15 09:07:38] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 0 ms to minimize.
[2023-03-15 09:07:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1687 ms
[2023-03-15 09:07:38] [INFO ] Added : 107 causal constraints over 22 iterations in 2605 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 210 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 207 transition count 216
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 207 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 206 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 215
Applied a total of 31 rules in 56 ms. Remains 206 /220 variables (removed 14) and now considering 215/226 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 206/220 places, 215/226 transitions.
// Phase 1: matrix 215 rows 206 cols
[2023-03-15 09:07:39] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144252 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91138 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 1) seen :0
[2023-03-15 09:07:40] [INFO ] Invariant cache hit.
[2023-03-15 09:07:40] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 09:07:40] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-15 09:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:40] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-15 09:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:07:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 09:07:40] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-15 09:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:41] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-15 09:07:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:07:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 80 ms returned sat
[2023-03-15 09:07:41] [INFO ] Computed and/alt/rep : 168/1091/168 causal constraints (skipped 46 transitions) in 16 ms.
[2023-03-15 09:07:42] [INFO ] Added : 98 causal constraints over 20 iterations in 1053 ms. Result :sat
Minimization took 596 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 09:07:43] [INFO ] Invariant cache hit.
[2023-03-15 09:07:43] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-15 09:07:43] [INFO ] Invariant cache hit.
[2023-03-15 09:07:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:07:45] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2023-03-15 09:07:45] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 09:07:45] [INFO ] Invariant cache hit.
[2023-03-15 09:07:45] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2457 ms. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 10155 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:07:45] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 1466 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:07:45] [INFO ] Invariant cache hit.
[2023-03-15 09:07:45] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:07:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:45] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-15 09:07:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:07:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:07:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:46] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-15 09:07:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:07:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 45 ms returned sat
[2023-03-15 09:07:46] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-15 09:07:49] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-15 09:07:50] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-15 09:07:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 857 ms
[2023-03-15 09:07:50] [INFO ] Added : 191 causal constraints over 39 iterations in 4057 ms. Result :sat
Minimization took 661 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 220 transition count 222
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 216 transition count 222
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 212 transition count 218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 209 transition count 218
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 209 transition count 214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 32 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 09:07:55] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144150 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91149 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 1) seen :0
[2023-03-15 09:07:57] [INFO ] Invariant cache hit.
[2023-03-15 09:07:57] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:07:57] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:57] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-15 09:07:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:07:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:07:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:07:57] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-15 09:07:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:07:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 47 ms returned sat
[2023-03-15 09:07:57] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2023-03-15 09:07:57] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 0 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2023-03-15 09:07:58] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 1 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 0 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:07:59] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2023-03-15 09:08:00] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3149 ms
[2023-03-15 09:08:00] [INFO ] Computed and/alt/rep : 167/1086/167 causal constraints (skipped 46 transitions) in 14 ms.
[2023-03-15 09:08:02] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-15 09:08:02] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2023-03-15 09:08:03] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2023-03-15 09:08:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2023-03-15 09:08:03] [INFO ] Added : 101 causal constraints over 21 iterations in 2379 ms. Result :sat
Minimization took 493 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:08:08] [INFO ] Invariant cache hit.
[2023-03-15 09:08:09] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-15 09:08:09] [INFO ] Invariant cache hit.
[2023-03-15 09:08:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:08:11] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 3013 ms to find 0 implicit places.
[2023-03-15 09:08:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 09:08:11] [INFO ] Invariant cache hit.
[2023-03-15 09:08:12] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3288 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 26531 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:08:12] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:08:12] [INFO ] Invariant cache hit.
[2023-03-15 09:08:12] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:12] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:12] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:08:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:12] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:12] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-15 09:08:12] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:08:12] [INFO ] [Nat]Added 33 Read/Feed constraints in 95 ms returned sat
[2023-03-15 09:08:12] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-15 09:08:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-15 09:08:12] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:08:13] [INFO ] Added : 59 causal constraints over 13 iterations in 385 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 38 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 09:08:13] [INFO ] Computed 31 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 144332 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91159 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 1) seen :0
[2023-03-15 09:08:15] [INFO ] Invariant cache hit.
[2023-03-15 09:08:15] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:15] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-15 09:08:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:08:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:15] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-15 09:08:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 09:08:15] [INFO ] [Nat]Added 41 Read/Feed constraints in 71 ms returned sat
[2023-03-15 09:08:15] [INFO ] Computed and/alt/rep : 167/1080/167 causal constraints (skipped 46 transitions) in 16 ms.
[2023-03-15 09:08:15] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-15 09:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-15 09:08:15] [INFO ] Added : 46 causal constraints over 11 iterations in 430 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:08:16] [INFO ] Invariant cache hit.
[2023-03-15 09:08:16] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-15 09:08:16] [INFO ] Invariant cache hit.
[2023-03-15 09:08:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 09:08:17] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
[2023-03-15 09:08:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 09:08:17] [INFO ] Invariant cache hit.
[2023-03-15 09:08:17] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1702 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 5680 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:08:17] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:08:17] [INFO ] Invariant cache hit.
[2023-03-15 09:08:17] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:17] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-15 09:08:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:08:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:08:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:18] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-15 09:08:18] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:08:19] [INFO ] [Nat]Added 33 Read/Feed constraints in 887 ms returned sat
[2023-03-15 09:08:19] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:08:19] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-15 09:08:19] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:08:19] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 1 ms to minimize.
[2023-03-15 09:08:19] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 1 ms to minimize.
[2023-03-15 09:08:20] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2023-03-15 09:08:20] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:08:20] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 0 ms to minimize.
[2023-03-15 09:08:20] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:08:20] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2023-03-15 09:08:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1772 ms
[2023-03-15 09:08:20] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:08:22] [INFO ] Added : 125 causal constraints over 25 iterations in 2131 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 220 transition count 221
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 209 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 209 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 206 transition count 214
Applied a total of 31 rules in 38 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 09:08:23] [INFO ] Computed 31 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 144085 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91371 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 1) seen :0
[2023-03-15 09:08:25] [INFO ] Invariant cache hit.
[2023-03-15 09:08:25] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-15 09:08:25] [INFO ] [Real]Absence check using 12 positive and 19 generalized place invariants in 7 ms returned sat
[2023-03-15 09:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:25] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:08:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-15 09:08:25] [INFO ] [Nat]Absence check using 12 positive and 19 generalized place invariants in 7 ms returned sat
[2023-03-15 09:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:25] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-15 09:08:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-15 09:08:26] [INFO ] [Nat]Added 39 Read/Feed constraints in 521 ms returned sat
[2023-03-15 09:08:26] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2023-03-15 09:08:26] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:08:26] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-15 09:08:26] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 1 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2023-03-15 09:08:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1591 ms
[2023-03-15 09:08:28] [INFO ] Computed and/alt/rep : 170/1089/170 causal constraints (skipped 43 transitions) in 16 ms.
[2023-03-15 09:08:30] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-15 09:08:30] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 0 ms to minimize.
[2023-03-15 09:08:30] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:08:30] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-15 09:08:30] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2023-03-15 09:08:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 752 ms
[2023-03-15 09:08:30] [INFO ] Added : 114 causal constraints over 24 iterations in 2858 ms. Result :sat
Minimization took 715 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:08:40] [INFO ] Invariant cache hit.
[2023-03-15 09:08:40] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-15 09:08:40] [INFO ] Invariant cache hit.
[2023-03-15 09:08:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-15 09:08:42] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2023-03-15 09:08:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:08:42] [INFO ] Invariant cache hit.
[2023-03-15 09:08:42] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2458 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 24947 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:08:42] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1469 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 09:08:42] [INFO ] Invariant cache hit.
[2023-03-15 09:08:42] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:42] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-15 09:08:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:08:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:43] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-15 09:08:43] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:08:43] [INFO ] [Nat]Added 33 Read/Feed constraints in 467 ms returned sat
[2023-03-15 09:08:43] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:08:43] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 1 ms to minimize.
[2023-03-15 09:08:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-15 09:08:43] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 15 ms.
[2023-03-15 09:08:44] [INFO ] Added : 94 causal constraints over 20 iterations in 862 ms. Result :sat
Minimization took 306 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 210 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 208 transition count 216
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 208 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 206 transition count 214
Applied a total of 29 rules in 35 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 09:08:45] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144430 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91567 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 1) seen :0
[2023-03-15 09:08:47] [INFO ] Invariant cache hit.
[2023-03-15 09:08:47] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:08:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:47] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-15 09:08:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:08:47] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:47] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-15 09:08:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 09:08:48] [INFO ] [Nat]Added 38 Read/Feed constraints in 312 ms returned sat
[2023-03-15 09:08:48] [INFO ] Computed and/alt/rep : 175/1104/175 causal constraints (skipped 38 transitions) in 16 ms.
[2023-03-15 09:08:49] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:08:49] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:08:49] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:08:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2023-03-15 09:08:49] [INFO ] Added : 78 causal constraints over 18 iterations in 1286 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:08:49] [INFO ] Invariant cache hit.
[2023-03-15 09:08:50] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-15 09:08:50] [INFO ] Invariant cache hit.
[2023-03-15 09:08:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 09:08:52] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned []
Implicit Place search using SMT with State Equation took 2586 ms to find 0 implicit places.
[2023-03-15 09:08:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:08:52] [INFO ] Invariant cache hit.
[2023-03-15 09:08:52] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2837 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 9940 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:08:52] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:08:52] [INFO ] Invariant cache hit.
[2023-03-15 09:08:52] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:08:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:52] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-15 09:08:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:08:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:08:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:08:53] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-15 09:08:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:08:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 113 ms returned sat
[2023-03-15 09:08:53] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 09:08:55] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-15 09:08:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-15 09:08:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-15 09:08:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2023-03-15 09:08:55] [INFO ] Added : 183 causal constraints over 37 iterations in 2603 ms. Result :sat
Minimization took 965 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 212 transition count 218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 209 transition count 218
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 209 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 206 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 215
Applied a total of 31 rules in 24 ms. Remains 206 /220 variables (removed 14) and now considering 215/226 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 206/220 places, 215/226 transitions.
// Phase 1: matrix 215 rows 206 cols
[2023-03-15 09:09:04] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144165 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91418 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties (out of 1) seen :0
[2023-03-15 09:09:06] [INFO ] Invariant cache hit.
[2023-03-15 09:09:06] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:09:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:06] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-15 09:09:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:09:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:09:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:06] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-15 09:09:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:09:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 276 ms returned sat
[2023-03-15 09:09:06] [INFO ] Computed and/alt/rep : 168/1077/168 causal constraints (skipped 46 transitions) in 17 ms.
[2023-03-15 09:09:08] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 0 ms to minimize.
[2023-03-15 09:09:08] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:09:08] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 0 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 0 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2023-03-15 09:09:09] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:09:10] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:09:10] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 1 ms to minimize.
[2023-03-15 09:09:10] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:09:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1761 ms
[2023-03-15 09:09:10] [INFO ] Added : 150 causal constraints over 30 iterations in 3553 ms. Result :sat
Minimization took 1521 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 09:09:15] [INFO ] Invariant cache hit.
[2023-03-15 09:09:15] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-15 09:09:15] [INFO ] Invariant cache hit.
[2023-03-15 09:09:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:09:16] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2023-03-15 09:09:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:09:16] [INFO ] Invariant cache hit.
[2023-03-15 09:09:17] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2130 ms. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 24588 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-09
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:09:17] [INFO ] Computed 31 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 09:09:17] [INFO ] Invariant cache hit.
[2023-03-15 09:09:17] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:09:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:17] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2023-03-15 09:09:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:09:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 09:09:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-15 09:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:17] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-15 09:09:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:09:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 41 ms returned sat
[2023-03-15 09:09:17] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 26 ms.
[2023-03-15 09:09:20] [INFO ] Added : 132 causal constraints over 28 iterations in 2417 ms. Result :sat
Minimization took 692 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 210 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 207 transition count 216
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 207 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 204 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 204 transition count 213
Applied a total of 34 rules in 28 ms. Remains 204 /220 variables (removed 16) and now considering 213/226 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 204/220 places, 213/226 transitions.
// Phase 1: matrix 213 rows 204 cols
[2023-03-15 09:09:21] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144184 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91706 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 1) seen :0
[2023-03-15 09:09:23] [INFO ] Invariant cache hit.
[2023-03-15 09:09:23] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:09:23] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:23] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-15 09:09:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:09:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:09:23] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:23] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-15 09:09:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:09:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 238 ms returned sat
[2023-03-15 09:09:23] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:09:24] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:09:24] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:09:24] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2023-03-15 09:09:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 488 ms
[2023-03-15 09:09:24] [INFO ] Computed and/alt/rep : 165/1067/165 causal constraints (skipped 47 transitions) in 22 ms.
[2023-03-15 09:09:26] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-15 09:09:26] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:09:26] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:09:26] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:09:27] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 1 ms to minimize.
[2023-03-15 09:09:27] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:09:27] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:09:27] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:09:27] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2023-03-15 09:09:27] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 1 ms to minimize.
[2023-03-15 09:09:28] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 0 ms to minimize.
[2023-03-15 09:09:28] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 1 ms to minimize.
[2023-03-15 09:09:28] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 0 ms to minimize.
[2023-03-15 09:09:28] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:09:28] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 0 ms to minimize.
[2023-03-15 09:09:28] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:09:29] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:09:29] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:09:29] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:09:29] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:09:29] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 1 ms to minimize.
[2023-03-15 09:09:29] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 1 ms to minimize.
[2023-03-15 09:09:30] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3797 ms
[2023-03-15 09:09:30] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:09:30] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-15 09:09:30] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:09:30] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2023-03-15 09:09:30] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:09:31] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2023-03-15 09:09:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 881 ms
[2023-03-15 09:09:31] [INFO ] Added : 107 causal constraints over 24 iterations in 6786 ms. Result :sat
Minimization took 614 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 204/204 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-15 09:09:32] [INFO ] Invariant cache hit.
[2023-03-15 09:09:32] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-15 09:09:32] [INFO ] Invariant cache hit.
[2023-03-15 09:09:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:09:34] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2023-03-15 09:09:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:09:34] [INFO ] Invariant cache hit.
[2023-03-15 09:09:34] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2258 ms. Remains : 204/204 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-09 in 17159 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:09:34] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 09:09:34] [INFO ] Invariant cache hit.
[2023-03-15 09:09:34] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:09:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:34] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:09:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:09:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:09:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:34] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-15 09:09:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:09:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 151 ms returned sat
[2023-03-15 09:09:35] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:09:37] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-15 09:09:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 09:09:37] [INFO ] Added : 155 causal constraints over 32 iterations in 2403 ms. Result :sat
Minimization took 507 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 209 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 209 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 214
Applied a total of 31 rules in 22 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 09:09:41] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144220 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91160 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 1) seen :0
[2023-03-15 09:09:42] [INFO ] Invariant cache hit.
[2023-03-15 09:09:42] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:09:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:42] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-15 09:09:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:09:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:09:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:09:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:43] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-15 09:09:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 09:09:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 84 ms returned sat
[2023-03-15 09:09:43] [INFO ] Computed and/alt/rep : 170/1086/170 causal constraints (skipped 43 transitions) in 15 ms.
[2023-03-15 09:09:44] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-15 09:09:44] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 0 ms to minimize.
[2023-03-15 09:09:44] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-15 09:09:44] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2023-03-15 09:09:44] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 1 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 1 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 1 ms to minimize.
[2023-03-15 09:09:45] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:09:46] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:09:46] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-15 09:09:46] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-15 09:09:46] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2023-03-15 09:09:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2024 ms
[2023-03-15 09:09:46] [INFO ] Added : 136 causal constraints over 28 iterations in 3200 ms. Result :sat
Minimization took 649 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:09:53] [INFO ] Invariant cache hit.
[2023-03-15 09:09:53] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-15 09:09:53] [INFO ] Invariant cache hit.
[2023-03-15 09:09:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 09:09:55] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2023-03-15 09:09:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:09:55] [INFO ] Invariant cache hit.
[2023-03-15 09:09:56] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2400 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 21692 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:09:56] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 1472 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 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-15 09:09:56] [INFO ] Invariant cache hit.
[2023-03-15 09:09:56] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 09:09:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:56] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-15 09:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:09:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-15 09:09:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:09:56] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-15 09:09:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:09:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 461 ms returned sat
[2023-03-15 09:09:57] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 09:09:58] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-15 09:09:58] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2023-03-15 09:09:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-15 09:09:58] [INFO ] Added : 79 causal constraints over 17 iterations in 1519 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 34 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 09:09:59] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 144109 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91526 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 1) seen :0
[2023-03-15 09:10:00] [INFO ] Invariant cache hit.
[2023-03-15 09:10:01] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 09:10:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:01] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-15 09:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:01] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-15 09:10:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 09:10:01] [INFO ] [Nat]Added 41 Read/Feed constraints in 92 ms returned sat
[2023-03-15 09:10:01] [INFO ] Computed and/alt/rep : 167/1078/167 causal constraints (skipped 46 transitions) in 24 ms.
[2023-03-15 09:10:02] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-15 09:10:02] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-15 09:10:02] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:10:03] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:10:03] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 0 ms to minimize.
[2023-03-15 09:10:03] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 1 ms to minimize.
[2023-03-15 09:10:03] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 1 ms to minimize.
[2023-03-15 09:10:04] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:10:04] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:10:04] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 0 ms to minimize.
[2023-03-15 09:10:04] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:10:05] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 1 ms to minimize.
[2023-03-15 09:10:05] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 1 ms to minimize.
[2023-03-15 09:10:05] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 1 ms to minimize.
[2023-03-15 09:10:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3572 ms
[2023-03-15 09:10:06] [INFO ] Added : 86 causal constraints over 19 iterations in 4692 ms. Result :sat
Minimization took 439 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:10:10] [INFO ] Invariant cache hit.
[2023-03-15 09:10:11] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-15 09:10:11] [INFO ] Invariant cache hit.
[2023-03-15 09:10:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 09:10:12] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
[2023-03-15 09:10:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:10:12] [INFO ] Invariant cache hit.
[2023-03-15 09:10:13] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2310 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 17158 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:10:13] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1412 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 920 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-15 09:10:13] [INFO ] Invariant cache hit.
[2023-03-15 09:10:13] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:13] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-15 09:10:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:10:13] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:13] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-15 09:10:13] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:10:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 87 ms returned sat
[2023-03-15 09:10:13] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:10:14] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 0 ms to minimize.
[2023-03-15 09:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-15 09:10:14] [INFO ] Added : 89 causal constraints over 19 iterations in 858 ms. Result :sat
Minimization took 491 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 18 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 09:10:15] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144092 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91553 resets, run finished after 655 ms. (steps per millisecond=1526 ) properties (out of 1) seen :0
[2023-03-15 09:10:16] [INFO ] Invariant cache hit.
[2023-03-15 09:10:16] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:16] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-15 09:10:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:17] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:10:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:10:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 81 ms returned sat
[2023-03-15 09:10:17] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 16 ms.
[2023-03-15 09:10:17] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-15 09:10:17] [INFO ] Added : 58 causal constraints over 13 iterations in 674 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:10:18] [INFO ] Invariant cache hit.
[2023-03-15 09:10:18] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-15 09:10:18] [INFO ] Invariant cache hit.
[2023-03-15 09:10:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:10:19] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-03-15 09:10:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 09:10:19] [INFO ] Invariant cache hit.
[2023-03-15 09:10:19] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1789 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 6660 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:10:19] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:10:19] [INFO ] Invariant cache hit.
[2023-03-15 09:10:19] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:19] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:20] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-15 09:10:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:10:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:20] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-15 09:10:20] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:10:20] [INFO ] [Nat]Added 33 Read/Feed constraints in 146 ms returned sat
[2023-03-15 09:10:20] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:10:22] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2023-03-15 09:10:22] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 0 ms to minimize.
[2023-03-15 09:10:22] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:10:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
[2023-03-15 09:10:22] [INFO ] Added : 132 causal constraints over 27 iterations in 2244 ms. Result :sat
Minimization took 648 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 21 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 09:10:26] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144490 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91523 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 1) seen :0
[2023-03-15 09:10:28] [INFO ] Invariant cache hit.
[2023-03-15 09:10:28] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:28] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-15 09:10:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 09:10:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:28] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-15 09:10:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:10:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 113 ms returned sat
[2023-03-15 09:10:29] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2023-03-15 09:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-15 09:10:29] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 15 ms.
[2023-03-15 09:10:30] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-15 09:10:30] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:10:30] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:10:30] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2023-03-15 09:10:30] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-03-15 09:10:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1399 ms
[2023-03-15 09:10:31] [INFO ] Added : 117 causal constraints over 25 iterations in 2547 ms. Result :sat
Minimization took 333 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:10:43] [INFO ] Invariant cache hit.
[2023-03-15 09:10:44] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-15 09:10:44] [INFO ] Invariant cache hit.
[2023-03-15 09:10:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:10:46] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2023-03-15 09:10:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 09:10:46] [INFO ] Invariant cache hit.
[2023-03-15 09:10:46] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2307 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 26372 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 09:10:46] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 09:10:46] [INFO ] Invariant cache hit.
[2023-03-15 09:10:46] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 09:10:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:46] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-15 09:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:10:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:46] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-15 09:10:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 09:10:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 242 ms returned sat
[2023-03-15 09:10:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-03-15 09:10:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-15 09:10:47] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 09:10:48] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-15 09:10:49] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:10:49] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:10:49] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 5 ms to minimize.
[2023-03-15 09:10:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 577 ms
[2023-03-15 09:10:49] [INFO ] Added : 139 causal constraints over 29 iterations in 2566 ms. Result :sat
Minimization took 537 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 209 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 209 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 214
Applied a total of 31 rules in 24 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 09:10:54] [INFO ] Computed 31 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 144793 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91340 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 1) seen :0
[2023-03-15 09:10:56] [INFO ] Invariant cache hit.
[2023-03-15 09:10:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-15 09:10:56] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-15 09:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:56] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-15 09:10:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:10:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 09:10:56] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-15 09:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:10:56] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-15 09:10:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:10:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 67 ms returned sat
[2023-03-15 09:10:56] [INFO ] Computed and/alt/rep : 169/1085/169 causal constraints (skipped 44 transitions) in 16 ms.
[2023-03-15 09:10:57] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2023-03-15 09:10:57] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-15 09:10:57] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 1 ms to minimize.
[2023-03-15 09:10:58] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-15 09:10:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 541 ms
[2023-03-15 09:10:58] [INFO ] Added : 99 causal constraints over 20 iterations in 1360 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 09:10:58] [INFO ] Invariant cache hit.
[2023-03-15 09:10:59] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-15 09:10:59] [INFO ] Invariant cache hit.
[2023-03-15 09:10:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 09:11:01] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2023-03-15 09:11:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:11:01] [INFO ] Invariant cache hit.
[2023-03-15 09:11:01] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2344 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 15046 ms.
[2023-03-15 09:11:01] [INFO ] Flatten gal took : 92 ms
[2023-03-15 09:11:01] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-15 09:11:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 226 transitions and 1236 arcs took 4 ms.
Total runtime 554809 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/2514/ub_0_ --maxsum=/tmp/2514/ub_1_ --maxsum=/tmp/2514/ub_2_ --maxsum=/tmp/2514/ub_3_ --maxsum=/tmp/2514/ub_4_ --maxsum=/tmp/2514/ub_5_ --maxsum=/tmp/2514/ub_6_ --maxsum=/tmp/2514/ub_7_ --maxsum=/tmp/2514/ub_8_ --maxsum=/tmp/2514/ub_9_ --maxsum=/tmp/2514/ub_10_ --maxsum=/tmp/2514/ub_11_
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-00
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-01
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-04
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-06
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-07
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-08
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-09
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-10
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-11
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-12
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-13
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-15
BK_STOP 1678874162014
--------------------
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
mcc2023
ub formula name DoubleExponent-PT-010-UpperBounds-00
ub formula formula --maxsum=/tmp/2514/ub_0_
ub formula name DoubleExponent-PT-010-UpperBounds-01
ub formula formula --maxsum=/tmp/2514/ub_1_
ub formula name DoubleExponent-PT-010-UpperBounds-04
ub formula formula --maxsum=/tmp/2514/ub_2_
ub formula name DoubleExponent-PT-010-UpperBounds-06
ub formula formula --maxsum=/tmp/2514/ub_3_
ub formula name DoubleExponent-PT-010-UpperBounds-07
ub formula formula --maxsum=/tmp/2514/ub_4_
ub formula name DoubleExponent-PT-010-UpperBounds-08
ub formula formula --maxsum=/tmp/2514/ub_5_
ub formula name DoubleExponent-PT-010-UpperBounds-09
ub formula formula --maxsum=/tmp/2514/ub_6_
ub formula name DoubleExponent-PT-010-UpperBounds-10
ub formula formula --maxsum=/tmp/2514/ub_7_
ub formula name DoubleExponent-PT-010-UpperBounds-11
ub formula formula --maxsum=/tmp/2514/ub_8_
ub formula name DoubleExponent-PT-010-UpperBounds-12
ub formula formula --maxsum=/tmp/2514/ub_9_
ub formula name DoubleExponent-PT-010-UpperBounds-13
ub formula formula --maxsum=/tmp/2514/ub_10_
ub formula name DoubleExponent-PT-010-UpperBounds-15
ub formula formula --maxsum=/tmp/2514/ub_11_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 220 places, 226 transitions and 1236 arcs
pnml2lts-sym: Petri net DoubleExponent_PT_010 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 226->226 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 220; there are 226 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-010, 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 r137-smll-167819418600477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "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 ;