About the Execution of Marcie+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 |
| 10910.415 | 3600000.00 | 3675528.00 | 9930.00 | ? ? 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.r138-smll-167819420800477.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 marciexred
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 r138-smll-167819420800477
=====================================================================
--------------------
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 1678863798060
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 07:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 07:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:03:21] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-15 07:03:21] [INFO ] Transformed 534 places.
[2023-03-15 07:03:21] [INFO ] Transformed 498 transitions.
[2023-03-15 07:03:21] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 498 rows 534 cols
[2023-03-15 07:03:21] [INFO ] Computed 54 place invariants in 160 ms
Incomplete random walk after 10000 steps, including 341 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 287 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 282 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 293 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 293 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 284 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 281 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 279 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 276 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 281 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 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
[2023-03-15 07:03:21] [INFO ] Invariant cache hit.
[2023-03-15 07:03:22] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-15 07:03:22] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 45 ms returned sat
[2023-03-15 07:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:22] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-15 07:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-15 07:03:23] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 32 ms returned sat
[2023-03-15 07:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:23] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-03-15 07:03:24] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 8 ms to minimize.
[2023-03-15 07:03:24] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 2 ms to minimize.
[2023-03-15 07:03:24] [INFO ] Deduced a trap composed of 236 places in 395 ms of which 2 ms to minimize.
[2023-03-15 07:03:25] [INFO ] Deduced a trap composed of 176 places in 255 ms of which 2 ms to minimize.
[2023-03-15 07:03:25] [INFO ] Deduced a trap composed of 228 places in 360 ms of which 1 ms to minimize.
[2023-03-15 07:03:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2130 ms
[2023-03-15 07:03:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-15 07:03:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 07:03:28] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-15 07:03:28] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 44 ms returned sat
[2023-03-15 07:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:28] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2023-03-15 07:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 07:03:29] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 33 ms returned sat
[2023-03-15 07:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:29] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2023-03-15 07:03:30] [INFO ] Deduced a trap composed of 193 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:03:30] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:03:30] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 1 ms to minimize.
[2023-03-15 07:03:30] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 0 ms to minimize.
[2023-03-15 07:03:30] [INFO ] Deduced a trap composed of 89 places in 257 ms of which 1 ms to minimize.
[2023-03-15 07:03:31] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:03:31] [INFO ] Deduced a trap composed of 229 places in 268 ms of which 1 ms to minimize.
[2023-03-15 07:03:31] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 1 ms to minimize.
[2023-03-15 07:03:32] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 2 ms to minimize.
[2023-03-15 07:03:32] [INFO ] Deduced a trap composed of 91 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:03:32] [INFO ] Deduced a trap composed of 165 places in 359 ms of which 1 ms to minimize.
[2023-03-15 07:03:33] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 1 ms to minimize.
[2023-03-15 07:03:33] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:03:33] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:03:34] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 2 ms to minimize.
[2023-03-15 07:03:34] [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 07:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-15 07:03:34] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned unsat
[2023-03-15 07:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 07:03:34] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned unsat
[2023-03-15 07:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 07:03:34] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 34 ms returned sat
[2023-03-15 07:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:34] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-15 07:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2023-03-15 07:03:35] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 44 ms returned sat
[2023-03-15 07:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:36] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2023-03-15 07:03:36] [INFO ] Deduced a trap composed of 55 places in 469 ms of which 2 ms to minimize.
[2023-03-15 07:03:36] [INFO ] Deduced a trap composed of 190 places in 445 ms of which 2 ms to minimize.
[2023-03-15 07:03:37] [INFO ] Deduced a trap composed of 189 places in 321 ms of which 1 ms to minimize.
[2023-03-15 07:03:37] [INFO ] Deduced a trap composed of 186 places in 293 ms of which 1 ms to minimize.
[2023-03-15 07:03:38] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:03:38] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:03:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2310 ms
[2023-03-15 07:03:38] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-15 07:03:40] [INFO ] Deduced a trap composed of 8 places in 520 ms of which 1 ms to minimize.
[2023-03-15 07:03:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 07:03:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-15 07:03:40] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 45 ms returned sat
[2023-03-15 07:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:41] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-15 07:03:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 07:03:41] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 31 ms returned sat
[2023-03-15 07:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:41] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-15 07:03:41] [INFO ] Deduced a trap composed of 211 places in 441 ms of which 1 ms to minimize.
[2023-03-15 07:03:42] [INFO ] Deduced a trap composed of 192 places in 396 ms of which 1 ms to minimize.
[2023-03-15 07:03:42] [INFO ] Deduced a trap composed of 189 places in 241 ms of which 1 ms to minimize.
[2023-03-15 07:03:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1292 ms
[2023-03-15 07:03:42] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-15 07:03:44] [INFO ] Added : 109 causal constraints over 22 iterations in 1924 ms. Result :sat
Minimization took 963 ms.
[2023-03-15 07:03:45] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:03:45] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-15 07:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:46] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2023-03-15 07:03:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 07:03:46] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 07:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:47] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-15 07:03:47] [INFO ] Deduced a trap composed of 205 places in 290 ms of which 2 ms to minimize.
[2023-03-15 07:03:47] [INFO ] Deduced a trap composed of 226 places in 429 ms of which 1 ms to minimize.
[2023-03-15 07:03:48] [INFO ] Deduced a trap composed of 241 places in 297 ms of which 1 ms to minimize.
[2023-03-15 07:03:48] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 2 ms to minimize.
[2023-03-15 07:03:49] [INFO ] Deduced a trap composed of 83 places in 432 ms of which 4 ms to minimize.
[2023-03-15 07:03:49] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 1 ms to minimize.
[2023-03-15 07:03:50] [INFO ] Deduced a trap composed of 214 places in 346 ms of which 1 ms to minimize.
[2023-03-15 07:03:50] [INFO ] Deduced a trap composed of 219 places in 432 ms of which 1 ms to minimize.
[2023-03-15 07:03:51] [INFO ] Deduced a trap composed of 213 places in 410 ms of which 1 ms to minimize.
[2023-03-15 07:03:51] [INFO ] Deduced a trap composed of 218 places in 415 ms of which 1 ms to minimize.
[2023-03-15 07:03:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 07:03:51] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:03:51] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 07:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:51] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2023-03-15 07:03:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-15 07:03:52] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 42 ms returned sat
[2023-03-15 07:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:52] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-15 07:03:53] [INFO ] Deduced a trap composed of 209 places in 310 ms of which 1 ms to minimize.
[2023-03-15 07:03:53] [INFO ] Deduced a trap composed of 203 places in 303 ms of which 1 ms to minimize.
[2023-03-15 07:03:53] [INFO ] Deduced a trap composed of 43 places in 303 ms of which 1 ms to minimize.
[2023-03-15 07:03:54] [INFO ] Deduced a trap composed of 220 places in 285 ms of which 1 ms to minimize.
[2023-03-15 07:03:54] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 1 ms to minimize.
[2023-03-15 07:03:54] [INFO ] Deduced a trap composed of 204 places in 232 ms of which 1 ms to minimize.
[2023-03-15 07:03:54] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:03:55] [INFO ] Deduced a trap composed of 223 places in 242 ms of which 1 ms to minimize.
[2023-03-15 07:03:55] [INFO ] Deduced a trap composed of 225 places in 378 ms of which 1 ms to minimize.
[2023-03-15 07:03:56] [INFO ] Deduced a trap composed of 221 places in 281 ms of which 1 ms to minimize.
[2023-03-15 07:03:56] [INFO ] Deduced a trap composed of 207 places in 237 ms of which 2 ms to minimize.
[2023-03-15 07:03:56] [INFO ] Deduced a trap composed of 237 places in 235 ms of which 1 ms to minimize.
[2023-03-15 07:03:56] [INFO ] Deduced a trap composed of 219 places in 239 ms of which 1 ms to minimize.
[2023-03-15 07:03:57] [INFO ] Deduced a trap composed of 215 places in 358 ms of which 1 ms to minimize.
[2023-03-15 07:03:57] [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 07:03:57] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:03:57] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 26 ms returned sat
[2023-03-15 07:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:57] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-15 07:03:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:03:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:03:58] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-15 07:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:03:58] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-03-15 07:03:58] [INFO ] Deduced a trap composed of 203 places in 364 ms of which 2 ms to minimize.
[2023-03-15 07:03:59] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:03:59] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 3 ms to minimize.
[2023-03-15 07:03:59] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2023-03-15 07:03:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1064 ms
[2023-03-15 07:03:59] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-15 07:04:02] [INFO ] Added : 180 causal constraints over 36 iterations in 3354 ms. Result :unknown
[2023-03-15 07:04:03] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:04:03] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 07:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:03] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-15 07:04:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:04:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:04:03] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 32 ms returned sat
[2023-03-15 07:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:03] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-15 07:04:04] [INFO ] Deduced a trap composed of 206 places in 373 ms of which 1 ms to minimize.
[2023-03-15 07:04:04] [INFO ] Deduced a trap composed of 204 places in 425 ms of which 1 ms to minimize.
[2023-03-15 07:04:05] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 1 ms to minimize.
[2023-03-15 07:04:05] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:04:05] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 1 ms to minimize.
[2023-03-15 07:04:05] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:04:06] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 1 ms to minimize.
[2023-03-15 07:04:06] [INFO ] Deduced a trap composed of 217 places in 403 ms of which 4 ms to minimize.
[2023-03-15 07:04:06] [INFO ] Deduced a trap composed of 77 places in 369 ms of which 1 ms to minimize.
[2023-03-15 07:04:07] [INFO ] Deduced a trap composed of 199 places in 378 ms of which 3 ms to minimize.
[2023-03-15 07:04:07] [INFO ] Deduced a trap composed of 43 places in 321 ms of which 2 ms to minimize.
[2023-03-15 07:04:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3883 ms
[2023-03-15 07:04:07] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-15 07:04:08] [INFO ] Added : 20 causal constraints over 4 iterations in 641 ms. Result :unknown
[2023-03-15 07:04:08] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:04:08] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 31 ms returned sat
[2023-03-15 07:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:09] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-15 07:04:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:04:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 07:04:09] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-15 07:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:09] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-15 07:04:10] [INFO ] Deduced a trap composed of 185 places in 349 ms of which 1 ms to minimize.
[2023-03-15 07:04:10] [INFO ] Deduced a trap composed of 192 places in 280 ms of which 1 ms to minimize.
[2023-03-15 07:04:10] [INFO ] Deduced a trap composed of 189 places in 277 ms of which 1 ms to minimize.
[2023-03-15 07:04:11] [INFO ] Deduced a trap composed of 196 places in 376 ms of which 1 ms to minimize.
[2023-03-15 07:04:11] [INFO ] Deduced a trap composed of 228 places in 378 ms of which 1 ms to minimize.
[2023-03-15 07:04:11] [INFO ] Deduced a trap composed of 204 places in 441 ms of which 1 ms to minimize.
[2023-03-15 07:04:12] [INFO ] Deduced a trap composed of 236 places in 365 ms of which 1 ms to minimize.
[2023-03-15 07:04:12] [INFO ] Deduced a trap composed of 65 places in 300 ms of which 1 ms to minimize.
[2023-03-15 07:04:13] [INFO ] Deduced a trap composed of 215 places in 307 ms of which 1 ms to minimize.
[2023-03-15 07:04:13] [INFO ] Deduced a trap composed of 202 places in 296 ms of which 2 ms to minimize.
[2023-03-15 07:04:13] [INFO ] Deduced a trap composed of 177 places in 269 ms of which 1 ms to minimize.
[2023-03-15 07:04:13] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 1 ms to minimize.
[2023-03-15 07:04:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4254 ms
[2023-03-15 07:04:13] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-15 07:04:14] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-15 07:04:14] [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 10
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 07:04:14] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 07:04:14] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-15 07:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:14] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-15 07:04:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:04:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-15 07:04:14] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 38 ms returned sat
[2023-03-15 07:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:15] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-15 07:04:15] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-15 07:04:19] [INFO ] Added : 245 causal constraints over 49 iterations in 4406 ms. Result :unknown
[2023-03-15 07:04:19] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-15 07:04:20] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 44 ms returned sat
[2023-03-15 07:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:20] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2023-03-15 07:04:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:04:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-15 07:04:20] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 42 ms returned sat
[2023-03-15 07:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:21] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-15 07:04:21] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 0 ms to minimize.
[2023-03-15 07:04:21] [INFO ] Deduced a trap composed of 174 places in 357 ms of which 1 ms to minimize.
[2023-03-15 07:04:22] [INFO ] Deduced a trap composed of 167 places in 302 ms of which 1 ms to minimize.
[2023-03-15 07:04:22] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:04:22] [INFO ] Deduced a trap composed of 169 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:04:23] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 1 ms to minimize.
[2023-03-15 07:04:23] [INFO ] Deduced a trap composed of 183 places in 317 ms of which 1 ms to minimize.
[2023-03-15 07:04:24] [INFO ] Deduced a trap composed of 194 places in 403 ms of which 1 ms to minimize.
[2023-03-15 07:04:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3183 ms
[2023-03-15 07:04:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-15 07:04:25] [INFO ] Deduced a trap composed of 8 places in 436 ms of which 2 ms to minimize.
[2023-03-15 07:04: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 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 07:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-15 07:04:26] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 40 ms returned sat
[2023-03-15 07:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:26] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-15 07:04:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:04:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-15 07:04:26] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 36 ms returned sat
[2023-03-15 07:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:27] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2023-03-15 07:04:27] [INFO ] Deduced a trap composed of 232 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:04:28] [INFO ] Deduced a trap composed of 186 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:04:28] [INFO ] Deduced a trap composed of 204 places in 374 ms of which 1 ms to minimize.
[2023-03-15 07:04:28] [INFO ] Deduced a trap composed of 229 places in 364 ms of which 1 ms to minimize.
[2023-03-15 07:04:29] [INFO ] Deduced a trap composed of 67 places in 372 ms of which 1 ms to minimize.
[2023-03-15 07:04:29] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 1 ms to minimize.
[2023-03-15 07:04:30] [INFO ] Deduced a trap composed of 221 places in 393 ms of which 1 ms to minimize.
[2023-03-15 07:04:30] [INFO ] Deduced a trap composed of 241 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:04:31] [INFO ] Deduced a trap composed of 221 places in 388 ms of which 2 ms to minimize.
[2023-03-15 07:04:31] [INFO ] Deduced a trap composed of 225 places in 403 ms of which 2 ms to minimize.
[2023-03-15 07:04:31] [INFO ] Deduced a trap composed of 226 places in 361 ms of which 1 ms to minimize.
[2023-03-15 07:04: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 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 07:04:32] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-15 07:04:32] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 38 ms returned sat
[2023-03-15 07:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:32] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2023-03-15 07:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:04:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-15 07:04:32] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-15 07:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:04:33] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-15 07:04:33] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-15 07:04:37] [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 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 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 5 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 13 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 11 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 249 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 249 ms. Remains : 251/534 places, 237/498 transitions.
// Phase 1: matrix 237 rows 251 cols
[2023-03-15 07:04:49] [INFO ] Computed 50 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 128373 resets, run finished after 1534 ms. (steps per millisecond=651 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84992 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84962 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84955 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84725 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84829 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84662 resets, run finished after 875 ms. (steps per millisecond=1142 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84641 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84764 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 85021 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84860 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84690 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84886 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84616 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 13) seen :1
[2023-03-15 07:05:02] [INFO ] Invariant cache hit.
[2023-03-15 07:05:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:02] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2023-03-15 07:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:03] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-15 07:05:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-15 07:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:03] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-15 07:05:03] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:05:03] [INFO ] [Nat]Added 33 Read/Feed constraints in 93 ms returned sat
[2023-03-15 07:05:03] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 36 ms.
[2023-03-15 07:05:04] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 1 ms to minimize.
[2023-03-15 07:05:05] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 1 ms to minimize.
[2023-03-15 07:05:05] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 1 ms to minimize.
[2023-03-15 07:05:05] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 0 ms to minimize.
[2023-03-15 07:05:05] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:05:06] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2023-03-15 07:05:06] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:05:07] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-15 07:05:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2918 ms
[2023-03-15 07:05:07] [INFO ] Added : 92 causal constraints over 19 iterations in 3942 ms. Result :sat
Minimization took 314 ms.
[2023-03-15 07:05:07] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 07:05:07] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-15 07:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:08] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-15 07:05:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:08] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-15 07:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:08] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-15 07:05:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 93 ms returned sat
[2023-03-15 07:05:08] [INFO ] Deduced a trap composed of 76 places in 296 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-15 07:05:09] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-15 07:05:10] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-15 07:05:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1631 ms
[2023-03-15 07:05:10] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 47 ms.
[2023-03-15 07:05:12] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-15 07:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 07:05:12] [INFO ] Added : 132 causal constraints over 27 iterations in 2725 ms. Result :sat
Minimization took 657 ms.
[2023-03-15 07:05:13] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2023-03-15 07:05:13] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-15 07:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:13] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-15 07:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:13] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2023-03-15 07:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:14] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2023-03-15 07:05:14] [INFO ] [Nat]Added 33 Read/Feed constraints in 68 ms returned sat
[2023-03-15 07:05:14] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 24 ms.
[2023-03-15 07:05:15] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-15 07:05:15] [INFO ] Deduced a trap composed of 78 places in 267 ms of which 1 ms to minimize.
[2023-03-15 07:05:16] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 1 ms to minimize.
[2023-03-15 07:05:16] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 1 ms to minimize.
[2023-03-15 07:05:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1086 ms
[2023-03-15 07:05:16] [INFO ] Added : 82 causal constraints over 17 iterations in 2387 ms. Result :sat
Minimization took 210 ms.
[2023-03-15 07:05:16] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:05:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 30 ms returned unsat
[2023-03-15 07:05:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-15 07:05:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:17] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-15 07:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:05:17] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 30 ms returned sat
[2023-03-15 07:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:17] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-15 07:05:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 637 ms returned sat
[2023-03-15 07:05:18] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:05:18] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2023-03-15 07:05:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2023-03-15 07:05:18] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-15 07:05:21] [INFO ] Added : 129 causal constraints over 26 iterations in 2628 ms. Result :sat
Minimization took 847 ms.
[2023-03-15 07:05:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 07:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:22] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-15 07:05:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:22] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-15 07:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:22] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-15 07:05:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 375 ms returned sat
[2023-03-15 07:05:22] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-15 07:05:23] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-15 07:05:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-03-15 07:05:23] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-15 07:05:24] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-15 07:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 07:05:24] [INFO ] Added : 97 causal constraints over 21 iterations in 1772 ms. Result :sat
Minimization took 668 ms.
[2023-03-15 07:05:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:25] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 07:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:25] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-15 07:05:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:25] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2023-03-15 07:05:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:25] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-15 07:05:26] [INFO ] [Nat]Added 33 Read/Feed constraints in 166 ms returned sat
[2023-03-15 07:05:26] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 30 ms.
[2023-03-15 07:05:29] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2023-03-15 07:05:29] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-15 07:05:29] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:05:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 619 ms
[2023-03-15 07:05:29] [INFO ] Added : 172 causal constraints over 35 iterations in 3777 ms. Result :sat
Minimization took 631 ms.
[2023-03-15 07:05:30] [INFO ] [Real]Absence check using 2 positive place invariants in 35 ms returned sat
[2023-03-15 07:05:30] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 29 ms returned sat
[2023-03-15 07:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:30] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-15 07:05:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:30] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-15 07:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:31] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2023-03-15 07:05:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 412 ms returned sat
[2023-03-15 07:05:31] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:05:31] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2023-03-15 07:05:32] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:05:32] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-15 07:05:32] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2023-03-15 07:05:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 989 ms
[2023-03-15 07:05:32] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 36 ms.
[2023-03-15 07:05:33] [INFO ] Added : 85 causal constraints over 17 iterations in 1168 ms. Result :sat
Minimization took 312 ms.
[2023-03-15 07:05:34] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:05:34] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 44 ms returned sat
[2023-03-15 07:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:34] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-15 07:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:05:34] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 29 ms returned sat
[2023-03-15 07:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:34] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-15 07:05:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 122 ms returned sat
[2023-03-15 07:05:34] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 28 ms.
[2023-03-15 07:05:38] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:05:38] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 0 ms to minimize.
[2023-03-15 07:05:38] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 1 ms to minimize.
[2023-03-15 07:05:38] [INFO ] Deduced a trap composed of 87 places in 197 ms of which 3 ms to minimize.
[2023-03-15 07:05:39] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:05:39] [INFO ] Deduced a trap composed of 76 places in 247 ms of which 1 ms to minimize.
[2023-03-15 07:05:39] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 1 ms to minimize.
[2023-03-15 07:05:39] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:05:40] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:05:40] [INFO ] Deduced a trap composed of 82 places in 245 ms of which 0 ms to minimize.
[2023-03-15 07:05:40] [INFO ] Deduced a trap composed of 77 places in 215 ms of which 1 ms to minimize.
[2023-03-15 07:05:41] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 1 ms to minimize.
[2023-03-15 07:05:41] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:05:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3504 ms
[2023-03-15 07:05:41] [INFO ] Added : 179 causal constraints over 36 iterations in 6565 ms. Result :sat
Minimization took 581 ms.
[2023-03-15 07:05:42] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:42] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2023-03-15 07:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:42] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-15 07:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:42] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2023-03-15 07:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:42] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-15 07:05:42] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2023-03-15 07:05:42] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-15 07:05:44] [INFO ] Added : 120 causal constraints over 24 iterations in 1761 ms. Result :sat
Minimization took 373 ms.
[2023-03-15 07:05:44] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:05:44] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-15 07:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:45] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-15 07:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:45] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-15 07:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:45] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-15 07:05:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 32 ms returned sat
[2023-03-15 07:05:45] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-15 07:05:46] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2023-03-15 07:05:46] [INFO ] Added : 69 causal constraints over 15 iterations in 937 ms. Result :sat
Minimization took 333 ms.
[2023-03-15 07:05:46] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:05:46] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-15 07:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:46] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-15 07:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:47] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-15 07:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:47] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2023-03-15 07:05:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 222 ms returned sat
[2023-03-15 07:05:47] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-15 07:05:49] [INFO ] Added : 139 causal constraints over 28 iterations in 2291 ms. Result :sat
Minimization took 512 ms.
[2023-03-15 07:05:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:05:50] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2023-03-15 07:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:50] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-15 07:05:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:05:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:05:50] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-15 07:05:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:05:50] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-15 07:05:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 130 ms returned sat
[2023-03-15 07:05:51] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 32 ms.
[2023-03-15 07:05:52] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:05:53] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-15 07:05:53] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:05:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 724 ms
[2023-03-15 07:05:53] [INFO ] Added : 124 causal constraints over 25 iterations in 2276 ms. Result :sat
Minimization took 486 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 3 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 33 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 33 ms. Remains : 250/251 places, 236/237 transitions.
// Phase 1: matrix 236 rows 250 cols
[2023-03-15 07:06:42] [INFO ] Computed 50 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 128447 resets, run finished after 1651 ms. (steps per millisecond=605 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84482 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84502 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84798 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84891 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84649 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84609 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84666 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84671 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84649 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84802 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84834 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84702 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 12) seen :0
[2023-03-15 07:06:55] [INFO ] Invariant cache hit.
[2023-03-15 07:06:55] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:06:55] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 07:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:06:55] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-15 07:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:06:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:06:55] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 07:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:06:55] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-15 07:06:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:06:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 117 ms returned sat
[2023-03-15 07:06:55] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-15 07:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-15 07:06:55] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 28 ms.
[2023-03-15 07:06:57] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 1 ms to minimize.
[2023-03-15 07:06:57] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 1 ms to minimize.
[2023-03-15 07:06:58] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:06:58] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 1 ms to minimize.
[2023-03-15 07:06:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1189 ms
[2023-03-15 07:06:58] [INFO ] Added : 109 causal constraints over 23 iterations in 2800 ms. Result :sat
Minimization took 574 ms.
[2023-03-15 07:06:59] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:06:59] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-15 07:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:06:59] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-15 07:06:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:06:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:06:59] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-15 07:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:06:59] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2023-03-15 07:06:59] [INFO ] [Nat]Added 33 Read/Feed constraints in 119 ms returned sat
[2023-03-15 07:07:00] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 1 ms to minimize.
[2023-03-15 07:07:00] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 1 ms to minimize.
[2023-03-15 07:07:00] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:07:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1104 ms
[2023-03-15 07:07:01] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 22 ms.
[2023-03-15 07:07:02] [INFO ] Added : 119 causal constraints over 24 iterations in 1684 ms. Result :sat
Minimization took 449 ms.
[2023-03-15 07:07:03] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:07:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-15 07:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:03] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-15 07:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 24 ms returned sat
[2023-03-15 07:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:03] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-15 07:07:03] [INFO ] [Nat]Added 33 Read/Feed constraints in 140 ms returned sat
[2023-03-15 07:07:03] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 52 ms.
[2023-03-15 07:07:04] [INFO ] Added : 56 causal constraints over 12 iterations in 602 ms. Result :sat
Minimization took 403 ms.
[2023-03-15 07:07:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:07:05] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-15 07:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:05] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-15 07:07:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:05] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2023-03-15 07:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:05] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-15 07:07:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 1020 ms returned sat
[2023-03-15 07:07:06] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 38 ms.
[2023-03-15 07:07:08] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-15 07:07:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1041 ms
[2023-03-15 07:07:09] [INFO ] Added : 123 causal constraints over 25 iterations in 3132 ms. Result :sat
Minimization took 265 ms.
[2023-03-15 07:07:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:07:10] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 07:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:10] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-15 07:07:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:07:10] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-15 07:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:10] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2023-03-15 07:07:11] [INFO ] [Nat]Added 33 Read/Feed constraints in 409 ms returned sat
[2023-03-15 07:07:11] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-15 07:07:12] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 0 ms to minimize.
[2023-03-15 07:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 07:07:13] [INFO ] Added : 92 causal constraints over 20 iterations in 1871 ms. Result :sat
Minimization took 472 ms.
[2023-03-15 07:07:13] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:13] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-15 07:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:13] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-15 07:07:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:13] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-15 07:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:14] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-03-15 07:07:14] [INFO ] [Nat]Added 33 Read/Feed constraints in 111 ms returned sat
[2023-03-15 07:07:14] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:07:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 07:07:14] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 26 ms.
[2023-03-15 07:07:16] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-15 07:07:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-15 07:07:16] [INFO ] Added : 176 causal constraints over 36 iterations in 2235 ms. Result :sat
Minimization took 811 ms.
[2023-03-15 07:07:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:07:17] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-15 07:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:17] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-15 07:07:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:07:17] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2023-03-15 07:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:18] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-15 07:07:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 154 ms returned sat
[2023-03-15 07:07:18] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 1 ms to minimize.
[2023-03-15 07:07:18] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:07:18] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:07:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 628 ms
[2023-03-15 07:07:18] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-15 07:07:20] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2023-03-15 07:07:20] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:07:20] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 0 ms to minimize.
[2023-03-15 07:07:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 686 ms
[2023-03-15 07:07:20] [INFO ] Added : 91 causal constraints over 19 iterations in 1909 ms. Result :sat
Minimization took 477 ms.
[2023-03-15 07:07:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:07:21] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-15 07:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:21] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-15 07:07:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:07:21] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-15 07:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:22] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-15 07:07:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 235 ms returned sat
[2023-03-15 07:07:22] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 28 ms.
[2023-03-15 07:07:24] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 0 ms to minimize.
[2023-03-15 07:07:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-15 07:07:24] [INFO ] Added : 164 causal constraints over 33 iterations in 2401 ms. Result :sat
Minimization took 412 ms.
[2023-03-15 07:07:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:25] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-15 07:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:25] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-15 07:07:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:07:25] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2023-03-15 07:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:25] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-15 07:07:25] [INFO ] [Nat]Added 33 Read/Feed constraints in 98 ms returned sat
[2023-03-15 07:07:25] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-15 07:07:26] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-15 07:07:27] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:07:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2023-03-15 07:07:27] [INFO ] Added : 79 causal constraints over 17 iterations in 1376 ms. Result :sat
Minimization took 444 ms.
[2023-03-15 07:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:27] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-15 07:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:27] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-15 07:07:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:28] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-15 07:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:28] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-15 07:07:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 100 ms returned sat
[2023-03-15 07:07:28] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-15 07:07:28] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 27 ms.
[2023-03-15 07:07:29] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 07:07:29] [INFO ] Added : 51 causal constraints over 11 iterations in 781 ms. Result :sat
Minimization took 233 ms.
[2023-03-15 07:07:29] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:07:29] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-15 07:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:29] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-15 07:07:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-15 07:07:30] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-15 07:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:30] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-15 07:07:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 171 ms returned sat
[2023-03-15 07:07:30] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 28 ms.
[2023-03-15 07:07:32] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-15 07:07:32] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2023-03-15 07:07:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2023-03-15 07:07:32] [INFO ] Added : 139 causal constraints over 28 iterations in 2100 ms. Result :sat
Minimization took 629 ms.
[2023-03-15 07:07:33] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:07:33] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-15 07:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:33] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-15 07:07:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:07:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:07:33] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-15 07:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:07:33] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-15 07:07:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 168 ms returned sat
[2023-03-15 07:07:34] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 28 ms.
[2023-03-15 07:07:35] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:07:35] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:07:36] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:07:36] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-15 07:07:36] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:07:36] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:07:36] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-03-15 07:07:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1262 ms
[2023-03-15 07:07:36] [INFO ] Added : 124 causal constraints over 25 iterations in 2884 ms. Result :sat
Minimization took 566 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 17 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 17 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 17 ms. Remains 250 /250 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-15 07:08:09] [INFO ] Invariant cache hit.
[2023-03-15 07:08:10] [INFO ] Implicit Places using invariants in 768 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 775 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 48 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 07:08:10] [INFO ] Computed 31 place invariants in 29 ms
[2023-03-15 07:08:10] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-15 07:08:10] [INFO ] Invariant cache hit.
[2023-03-15 07:08:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:08:13] [INFO ] Implicit Places using invariants and state equation in 2713 ms returned []
Implicit Place search using SMT with State Equation took 3060 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 3901 ms. Remains : 220/250 places, 226/236 transitions.
[2023-03-15 07:08:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 143934 resets, run finished after 1625 ms. (steps per millisecond=615 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91436 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91656 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91538 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91391 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91611 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91332 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91627 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91575 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91523 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91383 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91429 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91643 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 12) seen :0
[2023-03-15 07:08:24] [INFO ] Invariant cache hit.
[2023-03-15 07:08:24] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:08:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-15 07:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:24] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-15 07:08:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:08:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 07:08:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:08:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:25] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-15 07:08:25] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:08:25] [INFO ] [Nat]Added 33 Read/Feed constraints in 100 ms returned sat
[2023-03-15 07:08:25] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-15 07:08:26] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2023-03-15 07:08:26] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-15 07:08:26] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:08:27] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:08:27] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2023-03-15 07:08:27] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2023-03-15 07:08:27] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 1 ms to minimize.
[2023-03-15 07:08:27] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:08:28] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 1 ms to minimize.
[2023-03-15 07:08:28] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 0 ms to minimize.
[2023-03-15 07:08:28] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 0 ms to minimize.
[2023-03-15 07:08:28] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:08:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2614 ms
[2023-03-15 07:08:28] [INFO ] Added : 107 causal constraints over 22 iterations in 3542 ms. Result :sat
Minimization took 365 ms.
[2023-03-15 07:08:29] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:08:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:29] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-15 07:08:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:08:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 07:08:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:29] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2023-03-15 07:08:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 64 ms returned sat
[2023-03-15 07:08:29] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 19 ms.
[2023-03-15 07:08:33] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-15 07:08:33] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-15 07:08:33] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-15 07:08:33] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-15 07:08:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-15 07:08:34] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-03-15 07:08:34] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-03-15 07:08:34] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-03-15 07:08:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1031 ms
[2023-03-15 07:08:34] [INFO ] Added : 191 causal constraints over 39 iterations in 4569 ms. Result :sat
Minimization took 822 ms.
[2023-03-15 07:08:35] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:08:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:35] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-15 07:08:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:08:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 07:08:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:08:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:35] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-15 07:08:35] [INFO ] [Nat]Added 33 Read/Feed constraints in 140 ms returned sat
[2023-03-15 07:08:36] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-15 07:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-15 07:08:36] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 27 ms.
[2023-03-15 07:08:36] [INFO ] Added : 59 causal constraints over 13 iterations in 601 ms. Result :sat
Minimization took 267 ms.
[2023-03-15 07:08:37] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:08:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:37] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-15 07:08:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:08:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-15 07:08:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:37] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-15 07:08:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 903 ms returned sat
[2023-03-15 07:08:38] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:08:38] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:08:39] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 1 ms to minimize.
[2023-03-15 07:08:39] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 1 ms to minimize.
[2023-03-15 07:08:39] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 1 ms to minimize.
[2023-03-15 07:08:39] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 1 ms to minimize.
[2023-03-15 07:08:40] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 0 ms to minimize.
[2023-03-15 07:08:40] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 0 ms to minimize.
[2023-03-15 07:08:40] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:08:40] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:08:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2602 ms
[2023-03-15 07:08:41] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 29 ms.
[2023-03-15 07:08:48] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:08:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-15 07:08:48] [INFO ] Added : 177 causal constraints over 36 iterations in 7017 ms. Result :sat
Minimization took 3001 ms.
[2023-03-15 07:08:51] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:08:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-15 07:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:51] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-15 07:08:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:08:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 07:08:51] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:51] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-15 07:08:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 524 ms returned sat
[2023-03-15 07:08:52] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:08:52] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:08:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2023-03-15 07:08:52] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 19 ms.
[2023-03-15 07:08:53] [INFO ] Added : 94 causal constraints over 20 iterations in 1254 ms. Result :sat
Minimization took 482 ms.
[2023-03-15 07:08:54] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:08:54] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:54] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-15 07:08:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:08:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:08:54] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-15 07:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:08:54] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2023-03-15 07:08:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 181 ms returned sat
[2023-03-15 07:08:55] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 30 ms.
[2023-03-15 07:08:58] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-15 07:08:58] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2023-03-15 07:08:58] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-15 07:08:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2023-03-15 07:08:58] [INFO ] Added : 183 causal constraints over 37 iterations in 3825 ms. Result :sat
Minimization took 1086 ms.
[2023-03-15 07:09:00] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 07:09:00] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:00] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-15 07:09:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 07:09:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:00] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2023-03-15 07:09:00] [INFO ] [Nat]Added 33 Read/Feed constraints in 41 ms returned sat
[2023-03-15 07:09:00] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 26 ms.
[2023-03-15 07:09:03] [INFO ] Added : 132 causal constraints over 28 iterations in 2637 ms. Result :sat
Minimization took 694 ms.
[2023-03-15 07:09:03] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:09:03] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:04] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-15 07:09:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-15 07:09:04] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:04] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-15 07:09:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 158 ms returned sat
[2023-03-15 07:09:04] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-15 07:09:07] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2023-03-15 07:09:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-15 07:09:07] [INFO ] Added : 155 causal constraints over 32 iterations in 2644 ms. Result :sat
Minimization took 527 ms.
[2023-03-15 07:09:07] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:09:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-15 07:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:08] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-15 07:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:09:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:08] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-15 07:09:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 338 ms returned sat
[2023-03-15 07:09:08] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-15 07:09:09] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:09:09] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-15 07:09:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2023-03-15 07:09:10] [INFO ] Added : 79 causal constraints over 17 iterations in 1298 ms. Result :sat
Minimization took 167 ms.
[2023-03-15 07:09:10] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:09:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:10] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-15 07:09:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:09:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:10] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-15 07:09:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 89 ms returned sat
[2023-03-15 07:09:10] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-15 07:09:11] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:09:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-15 07:09:11] [INFO ] Added : 89 causal constraints over 19 iterations in 1060 ms. Result :sat
Minimization took 502 ms.
[2023-03-15 07:09:12] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:09:12] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-15 07:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:12] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2023-03-15 07:09:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:09:12] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:12] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-15 07:09:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 148 ms returned sat
[2023-03-15 07:09:13] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 14 ms.
[2023-03-15 07:09:15] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:09:15] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 2 ms to minimize.
[2023-03-15 07:09:15] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:09:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2023-03-15 07:09:15] [INFO ] Added : 132 causal constraints over 27 iterations in 2410 ms. Result :sat
Minimization took 981 ms.
[2023-03-15 07:09:16] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:09:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:16] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-15 07:09:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:09:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:16] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-15 07:09:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 279 ms returned sat
[2023-03-15 07:09:17] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-15 07:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-15 07:09:17] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-15 07:09:19] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:09:19] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:09:19] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:09:19] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:09:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 756 ms
[2023-03-15 07:09:20] [INFO ] Added : 139 causal constraints over 29 iterations in 2908 ms. Result :sat
Minimization took 798 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 12 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 12 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 10 ms. Remains 220 /220 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-15 07:09:51] [INFO ] Invariant cache hit.
[2023-03-15 07:09:51] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-15 07:09:51] [INFO ] Invariant cache hit.
[2023-03-15 07:09:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:09:54] [INFO ] Implicit Places using invariants and state equation in 2807 ms returned []
Implicit Place search using SMT with State Equation took 3109 ms to find 0 implicit places.
[2023-03-15 07:09:54] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 07:09:54] [INFO ] Invariant cache hit.
[2023-03-15 07:09:54] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3355 ms. Remains : 220/220 places, 226/226 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
[2023-03-15 07:09:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1458 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 910 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 07:09:54] [INFO ] Invariant cache hit.
[2023-03-15 07:09:54] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 07:09:54] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:55] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-15 07:09:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:09:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:09:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:09:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:09:55] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-15 07:09:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:09:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 112 ms returned sat
[2023-03-15 07:09:55] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 20 ms.
[2023-03-15 07:09:56] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 1 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 0 ms to minimize.
[2023-03-15 07:09:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2289 ms
[2023-03-15 07:09:59] [INFO ] Added : 107 causal constraints over 22 iterations in 3630 ms. Result :sat
Minimization took 362 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 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 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 72 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 72 ms. Remains : 206/220 places, 215/226 transitions.
// Phase 1: matrix 215 rows 206 cols
[2023-03-15 07:09:59] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 144509 resets, run finished after 1197 ms. (steps per millisecond=835 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91616 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 1) seen :0
[2023-03-15 07:10:01] [INFO ] Invariant cache hit.
[2023-03-15 07:10:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 07:10:01] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-15 07:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:01] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-03-15 07:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 07:10:01] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-15 07:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:01] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-15 07:10:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:10:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 82 ms returned sat
[2023-03-15 07:10:02] [INFO ] Computed and/alt/rep : 168/1091/168 causal constraints (skipped 46 transitions) in 26 ms.
[2023-03-15 07:10:03] [INFO ] Added : 98 causal constraints over 20 iterations in 1144 ms. Result :sat
Minimization took 575 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 12 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 13 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 11 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 07:10:04] [INFO ] Invariant cache hit.
[2023-03-15 07:10:04] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-15 07:10:04] [INFO ] Invariant cache hit.
[2023-03-15 07:10:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:10:07] [INFO ] Implicit Places using invariants and state equation in 3326 ms returned []
Implicit Place search using SMT with State Equation took 3659 ms to find 0 implicit places.
[2023-03-15 07:10:07] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 07:10:08] [INFO ] Invariant cache hit.
[2023-03-15 07:10:08] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3898 ms. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 13331 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:10:08] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 1458 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 938 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 07:10:08] [INFO ] Invariant cache hit.
[2023-03-15 07:10:08] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 07:10:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:08] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-15 07:10:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:10:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:08] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-15 07:10:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:10:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 47 ms returned sat
[2023-03-15 07:10:08] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-15 07:10: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 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 1 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 1 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 0 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 37 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 37 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 07:10:13] [INFO ] Computed 31 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 143798 resets, run finished after 962 ms. (steps per millisecond=1039 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91626 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 1) seen :0
[2023-03-15 07:10:15] [INFO ] Invariant cache hit.
[2023-03-15 07:10:15] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:10:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:15] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-15 07:10:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 07:10:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:15] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-15 07:10:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:10:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 70 ms returned sat
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 0 ms to minimize.
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 0 ms to minimize.
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 0 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 0 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 0 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 0 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4500 ms
[2023-03-15 07:10:20] [INFO ] Computed and/alt/rep : 167/1086/167 causal constraints (skipped 46 transitions) in 26 ms.
[2023-03-15 07:10:23] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-15 07:10:23] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2023-03-15 07:10:23] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2023-03-15 07:10:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2023-03-15 07:10:23] [INFO ] Added : 101 causal constraints over 21 iterations in 3250 ms. Result :sat
Minimization took 772 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 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 07:10:29] [INFO ] Invariant cache hit.
[2023-03-15 07:10:29] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-15 07:10:29] [INFO ] Invariant cache hit.
[2023-03-15 07:10:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:10:32] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2023-03-15 07:10:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 07:10:32] [INFO ] Invariant cache hit.
[2023-03-15 07:10:32] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2657 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 24094 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:10:32] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1409 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 911 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 07:10:32] [INFO ] Invariant cache hit.
[2023-03-15 07:10:32] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:10:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:32] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-15 07:10:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-15 07:10:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:10:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:32] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-15 07:10:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:10:32] [INFO ] [Nat]Added 33 Read/Feed constraints in 95 ms returned sat
[2023-03-15 07:10:33] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-15 07:10:33] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 23 ms.
[2023-03-15 07:10:33] [INFO ] Added : 59 causal constraints over 13 iterations in 509 ms. Result :sat
Minimization took 269 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 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 28 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 28 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 07:10:34] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144188 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91396 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 1) seen :0
[2023-03-15 07:10:35] [INFO ] Invariant cache hit.
[2023-03-15 07:10:35] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 07:10:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:35] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-15 07:10:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 07:10:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:36] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-15 07:10:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 07:10:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 112 ms returned sat
[2023-03-15 07:10:36] [INFO ] Computed and/alt/rep : 167/1080/167 causal constraints (skipped 46 transitions) in 20 ms.
[2023-03-15 07:10:36] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-15 07:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-15 07:10:36] [INFO ] Added : 46 causal constraints over 11 iterations in 589 ms. Result :sat
Minimization took 150 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 07:10:36] [INFO ] Invariant cache hit.
[2023-03-15 07:10:37] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-15 07:10:37] [INFO ] Invariant cache hit.
[2023-03-15 07:10:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 07:10:39] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
[2023-03-15 07:10:39] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 07:10:39] [INFO ] Invariant cache hit.
[2023-03-15 07:10:39] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2988 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 7656 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:10:39] [INFO ] Computed 31 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 946 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-15 07:10:40] [INFO ] Invariant cache hit.
[2023-03-15 07:10:40] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:10:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-15 07:10:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:40] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2023-03-15 07:10:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-15 07:10:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:40] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-15 07:10:40] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:10:41] [INFO ] [Nat]Added 33 Read/Feed constraints in 1141 ms returned sat
[2023-03-15 07:10:41] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 1 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 1 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 0 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 0 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 0 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2159 ms
[2023-03-15 07:10:44] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-15 07:10:45] [INFO ] Added : 70 causal constraints over 14 iterations in 1390 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 0 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 28 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 28 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 07:10:46] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144050 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91177 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 1) seen :0
[2023-03-15 07:10:48] [INFO ] Invariant cache hit.
[2023-03-15 07:10:48] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-15 07:10:48] [INFO ] [Real]Absence check using 12 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-15 07:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:48] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-15 07:10:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:10:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-15 07:10:48] [INFO ] [Nat]Absence check using 12 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-15 07:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:10:48] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-15 07:10:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-15 07:10:49] [INFO ] [Nat]Added 39 Read/Feed constraints in 655 ms returned sat
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 1 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 1 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 0 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 0 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 0 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 0 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2018 ms
[2023-03-15 07:10:51] [INFO ] Computed and/alt/rep : 170/1089/170 causal constraints (skipped 43 transitions) in 22 ms.
[2023-03-15 07:10:54] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:10:54] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 1 ms to minimize.
[2023-03-15 07:10:54] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 1 ms to minimize.
[2023-03-15 07:10:54] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:10:55] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 0 ms to minimize.
[2023-03-15 07:10:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1210 ms
[2023-03-15 07:10:55] [INFO ] Added : 114 causal constraints over 24 iterations in 4294 ms. Result :sat
Minimization took 1057 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 12 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 12 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 5 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 07:11:05] [INFO ] Invariant cache hit.
[2023-03-15 07:11:05] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-15 07:11:05] [INFO ] Invariant cache hit.
[2023-03-15 07:11:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-15 07:11:08] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
[2023-03-15 07:11:08] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 07:11:08] [INFO ] Invariant cache hit.
[2023-03-15 07:11:08] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3527 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 28961 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:11:08] [INFO ] Computed 31 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 1436 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 925 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 07:11:08] [INFO ] Invariant cache hit.
[2023-03-15 07:11:09] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:11:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:09] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-15 07:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:11:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:11:09] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-15 07:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:09] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-15 07:11:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:11:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 730 ms returned sat
[2023-03-15 07:11:10] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:11:10] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-15 07:11:10] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 23 ms.
[2023-03-15 07:11:11] [INFO ] Added : 94 causal constraints over 20 iterations in 1301 ms. Result :sat
Minimization took 481 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 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 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 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 42 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 43 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 07:11:13] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144046 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91434 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 1) seen :0
[2023-03-15 07:11:15] [INFO ] Invariant cache hit.
[2023-03-15 07:11:15] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:11:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-15 07:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:15] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-15 07:11:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:11:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:11:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:15] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-15 07:11:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 07:11:16] [INFO ] [Nat]Added 38 Read/Feed constraints in 364 ms returned sat
[2023-03-15 07:11:16] [INFO ] Computed and/alt/rep : 175/1104/175 causal constraints (skipped 38 transitions) in 20 ms.
[2023-03-15 07:11:17] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:11:17] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:11:17] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-03-15 07:11:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 624 ms
[2023-03-15 07:11:18] [INFO ] Added : 78 causal constraints over 18 iterations in 1924 ms. Result :sat
Minimization took 335 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 8 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 8 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 7 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 07:11:18] [INFO ] Invariant cache hit.
[2023-03-15 07:11:18] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-15 07:11:18] [INFO ] Invariant cache hit.
[2023-03-15 07:11:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 07:11:21] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 2855 ms to find 0 implicit places.
[2023-03-15 07:11:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:11:21] [INFO ] Invariant cache hit.
[2023-03-15 07:11:21] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3175 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 12883 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:11:21] [INFO ] Computed 31 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-15 07:11:21] [INFO ] Invariant cache hit.
[2023-03-15 07:11:21] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:11:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:22] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-15 07:11:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:11:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-15 07:11:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-15 07:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:22] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-15 07:11:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:11:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 180 ms returned sat
[2023-03-15 07:11:22] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 29 ms.
[2023-03-15 07:11:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-15 07:11:26] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-15 07:11:26] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-15 07:11:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 376 ms
[2023-03-15 07:11:26] [INFO ] Added : 183 causal constraints over 37 iterations in 3891 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 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 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 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 36 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 36 ms. Remains : 206/220 places, 215/226 transitions.
// Phase 1: matrix 215 rows 206 cols
[2023-03-15 07:11:27] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144098 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91103 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 1) seen :0
[2023-03-15 07:11:29] [INFO ] Invariant cache hit.
[2023-03-15 07:11:29] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-15 07:11:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:29] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2023-03-15 07:11:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:11:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:11:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:29] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-15 07:11:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:11:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 270 ms returned sat
[2023-03-15 07:11:29] [INFO ] Computed and/alt/rep : 168/1077/168 causal constraints (skipped 46 transitions) in 24 ms.
[2023-03-15 07:11:32] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:11:32] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 0 ms to minimize.
[2023-03-15 07:11:32] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 0 ms to minimize.
[2023-03-15 07:11:32] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 1 ms to minimize.
[2023-03-15 07:11:32] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:11:33] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:11:33] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 0 ms to minimize.
[2023-03-15 07:11:33] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 0 ms to minimize.
[2023-03-15 07:11:33] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:11:34] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 0 ms to minimize.
[2023-03-15 07:11:34] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:11:34] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:11:34] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:11:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3002 ms
[2023-03-15 07:11:34] [INFO ] Added : 150 causal constraints over 30 iterations in 4932 ms. Result :sat
Minimization took 1491 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 5 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 5 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 07:11:40] [INFO ] Invariant cache hit.
[2023-03-15 07:11:40] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-15 07:11:40] [INFO ] Invariant cache hit.
[2023-03-15 07:11:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:11:42] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2023-03-15 07:11:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:11:42] [INFO ] Invariant cache hit.
[2023-03-15 07:11:42] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2284 ms. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 20520 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-09
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:11:42] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 07:11:42] [INFO ] Invariant cache hit.
[2023-03-15 07:11:42] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:11:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:42] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2023-03-15 07:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:11:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:11:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-15 07:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:43] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-15 07:11:43] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:11:43] [INFO ] [Nat]Added 33 Read/Feed constraints in 41 ms returned sat
[2023-03-15 07:11:43] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 38 ms.
[2023-03-15 07:11:45] [INFO ] Added : 132 causal constraints over 28 iterations in 2828 ms. Result :sat
Minimization took 757 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 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 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 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 38 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 39 ms. Remains : 204/220 places, 213/226 transitions.
// Phase 1: matrix 213 rows 204 cols
[2023-03-15 07:11:47] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 144092 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91493 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 1) seen :0
[2023-03-15 07:11:49] [INFO ] Invariant cache hit.
[2023-03-15 07:11:49] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:11:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-15 07:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:49] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-15 07:11:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:11:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:11:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:11:49] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-15 07:11:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:11:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 241 ms returned sat
[2023-03-15 07:11:49] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:11:50] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-15 07:11:50] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:11:50] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2023-03-15 07:11:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 594 ms
[2023-03-15 07:11:50] [INFO ] Computed and/alt/rep : 165/1067/165 causal constraints (skipped 47 transitions) in 24 ms.
[2023-03-15 07:11:52] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:11:52] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-15 07:11:52] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 0 ms to minimize.
[2023-03-15 07:11:52] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 1 ms to minimize.
[2023-03-15 07:11:52] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 0 ms to minimize.
[2023-03-15 07:11:53] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:11:53] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 0 ms to minimize.
[2023-03-15 07:11:53] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 0 ms to minimize.
[2023-03-15 07:11:53] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2023-03-15 07:11:53] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 0 ms to minimize.
[2023-03-15 07:11:53] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 1 ms to minimize.
[2023-03-15 07:11:54] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:11:54] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:11:54] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 1 ms to minimize.
[2023-03-15 07:11:54] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:11:54] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 1 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:11:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3992 ms
[2023-03-15 07:11:56] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-15 07:11:56] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:11:56] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 1 ms to minimize.
[2023-03-15 07:11:56] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:11:56] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2023-03-15 07:11:57] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2023-03-15 07:11:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1071 ms
[2023-03-15 07:11:57] [INFO ] Added : 107 causal constraints over 24 iterations in 6841 ms. Result :sat
Minimization took 872 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 9 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 9 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 7 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-15 07:11:58] [INFO ] Invariant cache hit.
[2023-03-15 07:11:58] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-15 07:11:58] [INFO ] Invariant cache hit.
[2023-03-15 07:11:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:12:01] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2023-03-15 07:12:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:12:01] [INFO ] Invariant cache hit.
[2023-03-15 07:12:01] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2913 ms. Remains : 204/204 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-09 in 19094 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:12:01] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-15 07:12:01] [INFO ] Invariant cache hit.
[2023-03-15 07:12:01] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:12:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:01] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2023-03-15 07:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:12:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:02] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-15 07:12:02] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:12:02] [INFO ] [Nat]Added 33 Read/Feed constraints in 238 ms returned sat
[2023-03-15 07:12:02] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 27 ms.
[2023-03-15 07:12:05] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-15 07:12:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 07:12:05] [INFO ] Added : 155 causal constraints over 32 iterations in 3398 ms. Result :sat
Minimization took 548 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 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 39 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 39 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 07:12:09] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 144385 resets, run finished after 1379 ms. (steps per millisecond=725 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91282 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 1) seen :0
[2023-03-15 07:12:11] [INFO ] Invariant cache hit.
[2023-03-15 07:12:11] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:12:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:12] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-15 07:12:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:12:12] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-15 07:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:12] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-15 07:12:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 07:12:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 87 ms returned sat
[2023-03-15 07:12:12] [INFO ] Computed and/alt/rep : 170/1086/170 causal constraints (skipped 43 transitions) in 17 ms.
[2023-03-15 07:12:13] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-15 07:12:13] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 1 ms to minimize.
[2023-03-15 07:12:14] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:12:14] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:12:14] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:12:14] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:12:14] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:12:14] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 0 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 1 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 0 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 1 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 0 ms to minimize.
[2023-03-15 07:12:15] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2023-03-15 07:12:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-15 07:12:16] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2023-03-15 07:12:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2557 ms
[2023-03-15 07:12:16] [INFO ] Added : 136 causal constraints over 28 iterations in 3825 ms. Result :sat
Minimization took 653 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 07:12:24] [INFO ] Invariant cache hit.
[2023-03-15 07:12:24] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-15 07:12:24] [INFO ] Invariant cache hit.
[2023-03-15 07:12:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 07:12:26] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
[2023-03-15 07:12:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:12:26] [INFO ] Invariant cache hit.
[2023-03-15 07:12:26] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2644 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 25308 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:12:26] [INFO ] Computed 31 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 1448 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 912 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 07:12:26] [INFO ] Invariant cache hit.
[2023-03-15 07:12:26] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 07:12:26] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:27] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-15 07:12:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 07:12:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 15 ms returned sat
[2023-03-15 07:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:27] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-15 07:12:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:12:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 538 ms returned sat
[2023-03-15 07:12:27] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 27 ms.
[2023-03-15 07:12:28] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-15 07:12:29] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-15 07:12:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-03-15 07:12:29] [INFO ] Added : 79 causal constraints over 17 iterations in 1389 ms. Result :sat
Minimization took 167 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 31 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 31 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-15 07:12:29] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144410 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91429 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 1) seen :0
[2023-03-15 07:12:31] [INFO ] Invariant cache hit.
[2023-03-15 07:12:31] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 07:12:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:31] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-15 07:12:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:12:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:31] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-15 07:12:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 07:12:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 89 ms returned sat
[2023-03-15 07:12:32] [INFO ] Computed and/alt/rep : 167/1078/167 causal constraints (skipped 46 transitions) in 23 ms.
[2023-03-15 07:12:32] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2023-03-15 07:12:32] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2023-03-15 07:12:33] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:12:33] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2023-03-15 07:12:33] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-15 07:12:33] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:12:34] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 0 ms to minimize.
[2023-03-15 07:12:34] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 0 ms to minimize.
[2023-03-15 07:12:34] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 1 ms to minimize.
[2023-03-15 07:12:34] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 0 ms to minimize.
[2023-03-15 07:12:34] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 1 ms to minimize.
[2023-03-15 07:12:34] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:12:35] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:12:35] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:12:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2974 ms
[2023-03-15 07:12:35] [INFO ] Added : 86 causal constraints over 19 iterations in 3887 ms. Result :sat
Minimization took 526 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 07:12:41] [INFO ] Invariant cache hit.
[2023-03-15 07:12:41] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-15 07:12:41] [INFO ] Invariant cache hit.
[2023-03-15 07:12:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 07:12:43] [INFO ] Implicit Places using invariants and state equation in 2119 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2023-03-15 07:12:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:12:43] [INFO ] Invariant cache hit.
[2023-03-15 07:12:43] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2554 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 16956 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:12:43] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1436 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 923 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-15 07:12:43] [INFO ] Invariant cache hit.
[2023-03-15 07:12:43] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 07:12:43] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:43] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-15 07:12:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:12:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:44] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-15 07:12:44] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:12:44] [INFO ] [Nat]Added 33 Read/Feed constraints in 103 ms returned sat
[2023-03-15 07:12:44] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 20 ms.
[2023-03-15 07:12:45] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 07:12:45] [INFO ] Added : 89 causal constraints over 19 iterations in 1342 ms. Result :sat
Minimization took 790 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 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 22 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 07:12:46] [INFO ] Computed 31 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 144370 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91232 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 1) seen :0
[2023-03-15 07:12:48] [INFO ] Invariant cache hit.
[2023-03-15 07:12:48] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 07:12:48] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 07:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:48] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-15 07:12:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 07:12:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:48] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-15 07:12:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:12:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 98 ms returned sat
[2023-03-15 07:12:48] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 19 ms.
[2023-03-15 07:12:49] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-15 07:12:49] [INFO ] Added : 58 causal constraints over 13 iterations in 798 ms. Result :sat
Minimization took 196 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 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 07:12:49] [INFO ] Invariant cache hit.
[2023-03-15 07:12:50] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-15 07:12:50] [INFO ] Invariant cache hit.
[2023-03-15 07:12:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:12:51] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2023-03-15 07:12:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:12:51] [INFO ] Invariant cache hit.
[2023-03-15 07:12:51] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1902 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 8067 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:12:51] [INFO ] Computed 31 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-15 07:12:51] [INFO ] Invariant cache hit.
[2023-03-15 07:12:51] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 07:12:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 07:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:52] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-15 07:12:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:12:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-15 07:12:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-15 07:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:12:52] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2023-03-15 07:12:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:12:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 233 ms returned sat
[2023-03-15 07:12:52] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 28 ms.
[2023-03-15 07:12:54] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 0 ms to minimize.
[2023-03-15 07:12:54] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 0 ms to minimize.
[2023-03-15 07:12:55] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:12:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 540 ms
[2023-03-15 07:12:55] [INFO ] Added : 132 causal constraints over 27 iterations in 2547 ms. Result :sat
Minimization took 928 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 0 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 07:12:59] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144192 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91254 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 1) seen :0
[2023-03-15 07:13:01] [INFO ] Invariant cache hit.
[2023-03-15 07:13:01] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 07:13:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:13:01] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-15 07:13:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:13:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 07:13:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 07:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:13:01] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-15 07:13:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:13:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 183 ms returned sat
[2023-03-15 07:13:02] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-03-15 07:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 07:13:02] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 23 ms.
[2023-03-15 07:13:03] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-15 07:13:04] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2023-03-15 07:13:04] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 0 ms to minimize.
[2023-03-15 07:13:04] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:13:04] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:13:05] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:13:05] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:13:05] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 1 ms to minimize.
[2023-03-15 07:13:05] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:13:05] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2023-03-15 07:13:06] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-15 07:13:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2426 ms
[2023-03-15 07:13:06] [INFO ] Added : 117 causal constraints over 25 iterations in 4110 ms. Result :sat
Minimization took 535 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 07:13:19] [INFO ] Invariant cache hit.
[2023-03-15 07:13:20] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-15 07:13:20] [INFO ] Invariant cache hit.
[2023-03-15 07:13:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:13:21] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-15 07:13:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 07:13:21] [INFO ] Invariant cache hit.
[2023-03-15 07:13:22] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2172 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 30365 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 226 rows 220 cols
[2023-03-15 07:13:22] [INFO ] Computed 31 place invariants in 15 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 916 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 07:13:22] [INFO ] Invariant cache hit.
[2023-03-15 07:13:22] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 07:13:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:13:22] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-15 07:13:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:13:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 07:13:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 07:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:13:22] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-15 07:13:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-15 07:13:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 238 ms returned sat
[2023-03-15 07:13:22] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-03-15 07:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-15 07:13:22] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 29 ms.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:13:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 915 ms
[2023-03-15 07:13:26] [INFO ] Added : 139 causal constraints over 29 iterations in 4026 ms. Result :sat
Minimization took 424 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 0 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 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 40 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 41 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-15 07:13:27] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144307 resets, run finished after 1202 ms. (steps per millisecond=831 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91439 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 1) seen :0
[2023-03-15 07:13:29] [INFO ] Invariant cache hit.
[2023-03-15 07:13:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 07:13:29] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-15 07:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:13:29] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-15 07:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:13:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 07:13:29] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-15 07:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:13:29] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-15 07:13:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:13:30] [INFO ] [Nat]Added 42 Read/Feed constraints in 102 ms returned sat
[2023-03-15 07:13:30] [INFO ] Computed and/alt/rep : 169/1085/169 causal constraints (skipped 44 transitions) in 24 ms.
[2023-03-15 07:13:31] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-03-15 07:13:31] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-15 07:13:31] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:13:32] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2023-03-15 07:13:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 930 ms
[2023-03-15 07:13:32] [INFO ] Added : 99 causal constraints over 20 iterations in 2206 ms. Result :sat
Minimization took 385 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-15 07:13:33] [INFO ] Invariant cache hit.
[2023-03-15 07:13:33] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-15 07:13:33] [INFO ] Invariant cache hit.
[2023-03-15 07:13:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-15 07:13:35] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-03-15 07:13:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 07:13:35] [INFO ] Invariant cache hit.
[2023-03-15 07:13:35] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2167 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 13563 ms.
[2023-03-15 07:13:36] [INFO ] Flatten gal took : 151 ms
[2023-03-15 07:13:36] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/UpperBounds.sr.xml took 15 ms.
[2023-03-15 07:13:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 226 transitions and 1236 arcs took 5 ms.
Total runtime 615028 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: DoubleExponent_PT_010
(NrP: 220 NrTr: 226 NrArc: 1236)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.011sec
net check time: 0m 0.000sec
init dd package: 0m 3.615sec
before gc: list nodes free: 445004
after gc: idd nodes used:2932841, unused:61067159; list nodes free:325117360
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5242172 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097068 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
50949 163216 240766 296977 304545 340582 392285 391821 449602 505407 494011 546782 544542 599335 645475 646803 704942 699630 747246 804855 797599 851588 854359 903880 960338 948985 1004096 1008791 1049233 1104108 1101163 1157604 1162936 1205839 1263232 1252404 1307378 1317042 1352944 1407482 1404306 1459407 1504107 1509851 1565767 1555038 1610942 1670404 1656486 1713911 1708655 1759559 1813660 1813228 1868397 1862698 1916021 1973439 1961966 2017276 2016702 2062173 2120723 2114042 2166170 2170719 2220296 2274202 2267258 2323085 2324692 2367536 2424066 2416498 2467742 2478621 2521982 2569495 2571276 2628662 2632568 2673489 2731235 2720027 2774019 2786471 2822008 2876737 2873573 2928578 2973332 2979019 3034797 3024156 3082080 3138847 3127702 3183265 3177437 3229562 3286913 3280207 3329757 3331277 3385749 3431668 3434068 3491119 3485078 3536155 3595105 3583237 3639740 3638835 3684189
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="marciexred"
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 marciexred"
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 r138-smll-167819420800477"
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 ;