About the Execution of 2021-gold for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16244.044 | 3600000.00 | 3557090.00 | 74612.60 | ? ? ? ? ? ? ? 29 ? ? ? ? ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878300010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is CANInsertWithFailure-PT-030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878300010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 8.8K May 30 15:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 30 15:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 30 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 30 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 15K May 30 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 30 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 30 15:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 5.6M May 29 12:20 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 CANInsertWithFailure-PT-030-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-030-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654677120485
Running Version 0
[2022-06-08 08:32:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 08:32:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 08:32:03] [INFO ] Load time of PNML (sax parser for PT used): 806 ms
[2022-06-08 08:32:03] [INFO ] Transformed 2164 places.
[2022-06-08 08:32:04] [INFO ] Transformed 5580 transitions.
[2022-06-08 08:32:04] [INFO ] Parsed PT model containing 2164 places and 5580 transitions in 928 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 5580 rows 2164 cols
[2022-06-08 08:32:04] [INFO ] Computed 33 place invariants in 351 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
// Phase 1: matrix 5580 rows 2164 cols
[2022-06-08 08:32:05] [INFO ] Computed 33 place invariants in 187 ms
[2022-06-08 08:32:05] [INFO ] [Real]Absence check using 31 positive place invariants in 79 ms returned sat
[2022-06-08 08:32:05] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 08:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:08] [INFO ] [Real]Absence check using state equation in 2364 ms returned sat
[2022-06-08 08:32:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 57 ms returned sat
[2022-06-08 08:32:08] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 37 ms returned sat
[2022-06-08 08:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:11] [INFO ] [Nat]Absence check using state equation in 2200 ms returned sat
[2022-06-08 08:32:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-06-08 08:32:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:32:13] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2354 ms returned unknown
[2022-06-08 08:32:13] [INFO ] [Real]Absence check using 31 positive place invariants in 55 ms returned sat
[2022-06-08 08:32:13] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 08:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:16] [INFO ] [Real]Absence check using state equation in 2784 ms returned sat
[2022-06-08 08:32:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 59 ms returned sat
[2022-06-08 08:32:17] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 08:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:19] [INFO ] [Nat]Absence check using state equation in 2403 ms returned sat
[2022-06-08 08:32:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:32:22] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2192 ms returned unknown
[2022-06-08 08:32:22] [INFO ] [Real]Absence check using 31 positive place invariants in 50 ms returned sat
[2022-06-08 08:32:22] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:25] [INFO ] [Real]Absence check using state equation in 3321 ms returned sat
[2022-06-08 08:32:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 50 ms returned sat
[2022-06-08 08:32:26] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 08:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:29] [INFO ] [Nat]Absence check using state equation in 3380 ms returned sat
[2022-06-08 08:32:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:32:30] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1312 ms returned unknown
[2022-06-08 08:32:31] [INFO ] [Real]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-06-08 08:32:31] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 25 ms returned sat
[2022-06-08 08:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:33] [INFO ] [Real]Absence check using state equation in 2100 ms returned sat
[2022-06-08 08:32:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 57 ms returned sat
[2022-06-08 08:32:33] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:36] [INFO ] [Nat]Absence check using state equation in 2192 ms returned sat
[2022-06-08 08:32:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:32:38] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2488 ms returned unknown
[2022-06-08 08:32:39] [INFO ] [Real]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-06-08 08:32:39] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 08:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:42] [INFO ] [Real]Absence check using state equation in 3075 ms returned sat
[2022-06-08 08:32:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 50 ms returned sat
[2022-06-08 08:32:42] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 08:32:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:45] [INFO ] [Nat]Absence check using state equation in 3262 ms returned sat
[2022-06-08 08:32:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:32:47] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1457 ms returned unknown
[2022-06-08 08:32:47] [INFO ] [Real]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:32:47] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:50] [INFO ] [Real]Absence check using state equation in 2506 ms returned sat
[2022-06-08 08:32:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 93 ms returned sat
[2022-06-08 08:32:50] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 49 ms returned sat
[2022-06-08 08:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:54] [INFO ] [Nat]Absence check using state equation in 3301 ms returned sat
[2022-06-08 08:32:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:32:55] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1305 ms returned unknown
[2022-06-08 08:32:55] [INFO ] [Real]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:32:55] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:32:58] [INFO ] [Real]Absence check using state equation in 2219 ms returned sat
[2022-06-08 08:32:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:32:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 49 ms returned sat
[2022-06-08 08:32:58] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:00] [INFO ] [Nat]Absence check using state equation in 2255 ms returned sat
[2022-06-08 08:33:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:03] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2422 ms returned unknown
[2022-06-08 08:33:03] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2022-06-08 08:33:03] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 08:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:05] [INFO ] [Real]Absence check using state equation in 2126 ms returned sat
[2022-06-08 08:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-06-08 08:33:06] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:08] [INFO ] [Nat]Absence check using state equation in 2225 ms returned sat
[2022-06-08 08:33:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:10] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2447 ms returned unknown
[2022-06-08 08:33:11] [INFO ] [Real]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:33:11] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 08:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:13] [INFO ] [Real]Absence check using state equation in 2411 ms returned sat
[2022-06-08 08:33:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:33:14] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:16] [INFO ] [Nat]Absence check using state equation in 2348 ms returned sat
[2022-06-08 08:33:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:18] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2342 ms returned unknown
[2022-06-08 08:33:19] [INFO ] [Real]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:33:19] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 08:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:21] [INFO ] [Real]Absence check using state equation in 2298 ms returned sat
[2022-06-08 08:33:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:33:22] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:24] [INFO ] [Nat]Absence check using state equation in 2218 ms returned sat
[2022-06-08 08:33:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:26] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2470 ms returned unknown
[2022-06-08 08:33:27] [INFO ] [Real]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:33:27] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:29] [INFO ] [Real]Absence check using state equation in 2251 ms returned sat
[2022-06-08 08:33:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-06-08 08:33:29] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 08:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:32] [INFO ] [Nat]Absence check using state equation in 2275 ms returned sat
[2022-06-08 08:33:34] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2259 ms returned sat
[2022-06-08 08:33:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 08:33:35] [INFO ] [Real]Absence check using 31 positive place invariants in 85 ms returned sat
[2022-06-08 08:33:35] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 43 ms returned sat
[2022-06-08 08:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:37] [INFO ] [Real]Absence check using state equation in 2385 ms returned sat
[2022-06-08 08:33:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 79 ms returned sat
[2022-06-08 08:33:38] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 55 ms returned sat
[2022-06-08 08:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:40] [INFO ] [Nat]Absence check using state equation in 2195 ms returned sat
[2022-06-08 08:33:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:42] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2386 ms returned unknown
[2022-06-08 08:33:43] [INFO ] [Real]Absence check using 31 positive place invariants in 58 ms returned sat
[2022-06-08 08:33:43] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 24 ms returned sat
[2022-06-08 08:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:45] [INFO ] [Real]Absence check using state equation in 2329 ms returned sat
[2022-06-08 08:33:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2022-06-08 08:33:46] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 08:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:48] [INFO ] [Nat]Absence check using state equation in 2259 ms returned sat
[2022-06-08 08:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:50] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2371 ms returned unknown
[2022-06-08 08:33:51] [INFO ] [Real]Absence check using 31 positive place invariants in 46 ms returned sat
[2022-06-08 08:33:51] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 08:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:53] [INFO ] [Real]Absence check using state equation in 2390 ms returned sat
[2022-06-08 08:33:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:33:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2022-06-08 08:33:54] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 08:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:33:57] [INFO ] [Nat]Absence check using state equation in 2906 ms returned sat
[2022-06-08 08:33:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:33:58] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1725 ms returned unknown
[2022-06-08 08:33:59] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2022-06-08 08:33:59] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:01] [INFO ] [Real]Absence check using state equation in 2112 ms returned sat
[2022-06-08 08:34:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:34:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-06-08 08:34:01] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:04] [INFO ] [Nat]Absence check using state equation in 2163 ms returned sat
[2022-06-08 08:34:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:34:06] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2533 ms returned unknown
[2022-06-08 08:34:06] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2022-06-08 08:34:06] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 08:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:09] [INFO ] [Real]Absence check using state equation in 2540 ms returned sat
[2022-06-08 08:34:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:34:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2022-06-08 08:34:09] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 08:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:12] [INFO ] [Nat]Absence check using state equation in 2062 ms returned sat
[2022-06-08 08:34:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:34:14] [INFO ] [Nat]Added 1770 Read/Feed constraints in 2607 ms returned unknown
Current structural bounds on expressions (after SMT) : [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30] Max seen :[0, 1, 1, 1, 0, 0, 1, 5, 1, 1, 0, 0, 1, 1, 1, 1]
Support contains 16 out of 2164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 209 place count 2163 transition count 5372
Reduce places removed 208 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 210 rules applied. Total rules applied 419 place count 1955 transition count 5370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 421 place count 1953 transition count 5370
Performed 752 Post agglomeration using F-continuation condition.Transition count delta: 752
Deduced a syphon composed of 752 places in 4 ms
Reduce places removed 752 places and 0 transitions.
Iterating global reduction 3 with 1504 rules applied. Total rules applied 1925 place count 1201 transition count 4618
Drop transitions removed 696 transitions
Redundant transition composition rules discarded 696 transitions
Iterating global reduction 3 with 696 rules applied. Total rules applied 2621 place count 1201 transition count 3922
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2623 place count 1201 transition count 3920
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2625 place count 1199 transition count 3920
Partial Free-agglomeration rule applied 1054 times.
Drop transitions removed 1054 transitions
Iterating global reduction 4 with 1054 rules applied. Total rules applied 3679 place count 1199 transition count 3920
Applied a total of 3679 rules in 2065 ms. Remains 1199 /2164 variables (removed 965) and now considering 3920/5580 (removed 1660) transitions.
Finished structural reductions, in 1 iterations. Remains : 1199/2164 places, 3920/5580 transitions.
// Phase 1: matrix 3920 rows 1199 cols
[2022-06-08 08:34:16] [INFO ] Computed 32 place invariants in 145 ms
Incomplete random walk after 1000000 steps, including 6180 resets, run finished after 9980 ms. (steps per millisecond=100 ) properties (out of 16) seen :37
Incomplete Best-First random walk after 1000001 steps, including 186 resets, run finished after 1281 ms. (steps per millisecond=780 ) properties (out of 16) seen :33
Incomplete Best-First random walk after 1000001 steps, including 187 resets, run finished after 1285 ms. (steps per millisecond=778 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 1000001 steps, including 189 resets, run finished after 1293 ms. (steps per millisecond=773 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 1000001 steps, including 188 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1284 ms. (steps per millisecond=778 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 1000001 steps, including 189 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 1000001 steps, including 186 resets, run finished after 1292 ms. (steps per millisecond=773 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 1000001 steps, including 190 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 16) seen :30
Incomplete Best-First random walk after 1000001 steps, including 188 resets, run finished after 1292 ms. (steps per millisecond=773 ) properties (out of 16) seen :30
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1263 ms. (steps per millisecond=791 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1293 ms. (steps per millisecond=773 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1283 ms. (steps per millisecond=779 ) properties (out of 16) seen :26
// Phase 1: matrix 3920 rows 1199 cols
[2022-06-08 08:34:47] [INFO ] Computed 32 place invariants in 129 ms
[2022-06-08 08:34:47] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:34:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:48] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2022-06-08 08:34:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:34:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:34:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:50] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2022-06-08 08:34:50] [INFO ] State equation strengthened by 3519 read => feed constraints.
[2022-06-08 08:34:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:34:56] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6317 ms returned unknown
[2022-06-08 08:34:56] [INFO ] [Real]Absence check using 30 positive place invariants in 45 ms returned sat
[2022-06-08 08:34:56] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:58] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2022-06-08 08:34:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:34:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:34:58] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:34:59] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2022-06-08 08:35:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:05] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6316 ms returned unknown
[2022-06-08 08:35:05] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:35:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2022-06-08 08:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:07] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2022-06-08 08:35:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:35:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:35:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:08] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2022-06-08 08:35:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:14] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6309 ms returned unknown
[2022-06-08 08:35:15] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:35:15] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:16] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2022-06-08 08:35:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:35:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:35:16] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:17] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2022-06-08 08:35:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:23] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6315 ms returned unknown
[2022-06-08 08:35:24] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:35:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:25] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2022-06-08 08:35:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:35:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:35:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:26] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2022-06-08 08:35:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:32] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6305 ms returned unknown
[2022-06-08 08:35:32] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:35:33] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2022-06-08 08:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:34] [INFO ] [Real]Absence check using state equation in 1297 ms returned sat
[2022-06-08 08:35:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:35:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:35:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:35] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2022-06-08 08:35:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:42] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6311 ms returned unknown
[2022-06-08 08:35:42] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:35:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:43] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2022-06-08 08:35:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:35:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:35:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:44] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2022-06-08 08:35:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:51] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6313 ms returned unknown
[2022-06-08 08:35:51] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:35:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:52] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2022-06-08 08:35:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:35:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:35:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2022-06-08 08:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:35:53] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2022-06-08 08:35:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:35:59] [INFO ] [Nat]Added 3519 Read/Feed constraints in 5214 ms returned unsat
[2022-06-08 08:35:59] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:35:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:00] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2022-06-08 08:36:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:01] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2022-06-08 08:36:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:36:08] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6312 ms returned unknown
[2022-06-08 08:36:08] [INFO ] [Real]Absence check using 30 positive place invariants in 47 ms returned sat
[2022-06-08 08:36:08] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:09] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2022-06-08 08:36:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:36:09] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:11] [INFO ] [Nat]Absence check using state equation in 1168 ms returned sat
[2022-06-08 08:36:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:36:17] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6305 ms returned unknown
[2022-06-08 08:36:17] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:18] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2022-06-08 08:36:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:19] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2022-06-08 08:36:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:36:26] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6301 ms returned unknown
[2022-06-08 08:36:26] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:36:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:27] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2022-06-08 08:36:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:28] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2022-06-08 08:36:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:36:35] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6302 ms returned unknown
[2022-06-08 08:36:35] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:35] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:36] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2022-06-08 08:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 42 ms returned sat
[2022-06-08 08:36:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:37] [INFO ] [Nat]Absence check using state equation in 1073 ms returned sat
[2022-06-08 08:36:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:36:44] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6300 ms returned unknown
[2022-06-08 08:36:44] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:45] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2022-06-08 08:36:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:46] [INFO ] [Nat]Absence check using state equation in 1084 ms returned sat
[2022-06-08 08:36:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:36:53] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6300 ms returned unknown
[2022-06-08 08:36:53] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:53] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:54] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2022-06-08 08:36:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:36:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:36:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:36:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:36:55] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2022-06-08 08:36:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:37:02] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6309 ms returned unknown
[2022-06-08 08:37:02] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:37:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:37:03] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2022-06-08 08:37:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:37:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:37:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:37:04] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2022-06-08 08:37:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:37:10] [INFO ] [Nat]Added 3519 Read/Feed constraints in 6307 ms returned unknown
Current structural bounds on expressions (after SMT) : [30, 30, 30, 30, 30, 30, 30, 29, 30, 30, 30, 30, 30, 30, 30, 30] Max seen :[1, 1, 1, 1, 1, 1, 1, 29, 1, 1, 1, 1, 1, 12, 1, 1]
FORMULA CANInsertWithFailure-PT-030-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 1199 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1199/1199 places, 3920/3920 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1199 transition count 3919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1198 transition count 3919
Applied a total of 2 rules in 420 ms. Remains 1198 /1199 variables (removed 1) and now considering 3919/3920 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1198/1199 places, 3919/3920 transitions.
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:37:11] [INFO ] Computed 32 place invariants in 75 ms
Incomplete random walk after 1000000 steps, including 6255 resets, run finished after 9844 ms. (steps per millisecond=101 ) properties (out of 15) seen :26
Incomplete Best-First random walk after 1000001 steps, including 187 resets, run finished after 1285 ms. (steps per millisecond=778 ) properties (out of 15) seen :19
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 1288 ms. (steps per millisecond=776 ) properties (out of 15) seen :19
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 1286 ms. (steps per millisecond=777 ) properties (out of 15) seen :21
Incomplete Best-First random walk after 1000001 steps, including 181 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties (out of 15) seen :22
Incomplete Best-First random walk after 1000001 steps, including 181 resets, run finished after 1290 ms. (steps per millisecond=775 ) properties (out of 15) seen :22
Incomplete Best-First random walk after 1000001 steps, including 187 resets, run finished after 1283 ms. (steps per millisecond=779 ) properties (out of 15) seen :22
Incomplete Best-First random walk after 1000001 steps, including 183 resets, run finished after 1302 ms. (steps per millisecond=768 ) properties (out of 15) seen :21
Incomplete Best-First random walk after 1000001 steps, including 182 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 15) seen :21
Incomplete Best-First random walk after 1000001 steps, including 183 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 1000001 steps, including 183 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties (out of 15) seen :25
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 1290 ms. (steps per millisecond=775 ) properties (out of 15) seen :21
Incomplete Best-First random walk after 1000001 steps, including 187 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 15) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1240 ms. (steps per millisecond=806 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000001 steps, including 181 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 15) seen :24
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1335 ms. (steps per millisecond=749 ) properties (out of 15) seen :21
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:37:40] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:37:41] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:37:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:37:42] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2022-06-08 08:37:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:37:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:37:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:37:43] [INFO ] [Nat]Absence check using state equation in 1219 ms returned sat
[2022-06-08 08:37:43] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:37:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:37:50] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6652 ms returned unknown
[2022-06-08 08:37:50] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:37:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:37:51] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2022-06-08 08:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:37:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:37:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 08:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:37:53] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2022-06-08 08:37:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:37:59] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6334 ms returned unknown
[2022-06-08 08:37:59] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:37:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:00] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2022-06-08 08:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 29 ms returned sat
[2022-06-08 08:38:01] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:02] [INFO ] [Nat]Absence check using state equation in 1061 ms returned sat
[2022-06-08 08:38:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:38:08] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6316 ms returned unknown
[2022-06-08 08:38:08] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:38:08] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:10] [INFO ] [Real]Absence check using state equation in 1619 ms returned sat
[2022-06-08 08:38:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:38:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:12] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2022-06-08 08:38:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:38:18] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6316 ms returned unknown
[2022-06-08 08:38:18] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:38:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:19] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2022-06-08 08:38:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:38:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:21] [INFO ] [Nat]Absence check using state equation in 1064 ms returned sat
[2022-06-08 08:38:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:38:27] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6315 ms returned unknown
[2022-06-08 08:38:27] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:38:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:28] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2022-06-08 08:38:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:38:29] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:30] [INFO ] [Nat]Absence check using state equation in 1212 ms returned sat
[2022-06-08 08:38:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:38:36] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6321 ms returned unknown
[2022-06-08 08:38:36] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:38:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:38] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2022-06-08 08:38:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:38:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:39] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2022-06-08 08:38:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:38:45] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6315 ms returned unknown
[2022-06-08 08:38:45] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:38:46] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:47] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2022-06-08 08:38:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:38:47] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:48] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2022-06-08 08:38:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:38:54] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6315 ms returned unknown
[2022-06-08 08:38:54] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:38:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:56] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2022-06-08 08:38:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:38:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:38:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:38:57] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2022-06-08 08:39:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:03] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6316 ms returned unknown
[2022-06-08 08:39:04] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:39:04] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:05] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2022-06-08 08:39:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:39:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:39:05] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:06] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2022-06-08 08:39:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:12] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6317 ms returned unknown
[2022-06-08 08:39:12] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:39:12] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:14] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2022-06-08 08:39:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:39:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:39:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:15] [INFO ] [Nat]Absence check using state equation in 1299 ms returned sat
[2022-06-08 08:39:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:22] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6312 ms returned unknown
[2022-06-08 08:39:22] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:39:22] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:23] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2022-06-08 08:39:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:39:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:39:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:24] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2022-06-08 08:39:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:31] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6330 ms returned unknown
[2022-06-08 08:39:31] [INFO ] [Real]Absence check using 30 positive place invariants in 41 ms returned sat
[2022-06-08 08:39:31] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:32] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2022-06-08 08:39:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:39:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:39:32] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:39:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:34] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2022-06-08 08:39:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:40] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6324 ms returned unknown
[2022-06-08 08:39:40] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:39:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:41] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2022-06-08 08:39:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:39:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:39:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:43] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2022-06-08 08:39:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:49] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6309 ms returned unknown
[2022-06-08 08:39:49] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:39:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:50] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2022-06-08 08:39:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:39:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:39:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:39:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:39:52] [INFO ] [Nat]Absence check using state equation in 1052 ms returned sat
[2022-06-08 08:39:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:39:58] [INFO ] [Nat]Added 3605 Read/Feed constraints in 6312 ms returned unknown
Current structural bounds on expressions (after SMT) : [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1]
Support contains 15 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Applied a total of 0 rules in 133 ms. Remains 1198 /1198 variables (removed 0) and now considering 3919/3919 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1198/1198 places, 3919/3919 transitions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Applied a total of 0 rules in 198 ms. Remains 1198 /1198 variables (removed 0) and now considering 3919/3919 (removed 0) transitions.
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:39:58] [INFO ] Computed 32 place invariants in 95 ms
[2022-06-08 08:40:00] [INFO ] Implicit Places using invariants in 1831 ms returned []
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:40:00] [INFO ] Computed 32 place invariants in 76 ms
[2022-06-08 08:40:01] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:40:02] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 3446 ms to find 0 implicit places.
[2022-06-08 08:40:02] [INFO ] Redundant transitions in 426 ms returned []
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:40:02] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 08:40:05] [INFO ] Dead Transitions using invariants and state equation in 3215 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1198/1198 places, 3919/3919 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:40:06] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 61 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:40:06] [INFO ] Computed 32 place invariants in 75 ms
[2022-06-08 08:40:06] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:40:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 08:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:40:07] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2022-06-08 08:40:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:40:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:40:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:40:08] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2022-06-08 08:40:08] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:40:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:40:12] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3722 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[0]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1193 transition count 3914
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1193 transition count 3913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 517 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:13] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 1000000 steps, including 6359 resets, run finished after 9779 ms. (steps per millisecond=102 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 184 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:24] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:40:24] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:40:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:40:25] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2022-06-08 08:40:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:40:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:40:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:40:27] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2022-06-08 08:40:27] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:40:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:40:33] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6328 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 126 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 129 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:33] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:40:35] [INFO ] Implicit Places using invariants in 1903 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:35] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:40:36] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:40:36] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 3143 ms to find 0 implicit places.
[2022-06-08 08:40:37] [INFO ] Redundant transitions in 384 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:37] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:40:39] [INFO ] Dead Transitions using invariants and state equation in 2801 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:40] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 1000000 steps, including 6358 resets, run finished after 9604 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1268 ms. (steps per millisecond=788 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:40:51] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:40:51] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:40:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:40:52] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2022-06-08 08:40:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:40:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:40:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:40:53] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2022-06-08 08:40:53] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:40:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:40:59] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6332 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 108 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 100 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:41:00] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:41:02] [INFO ] Implicit Places using invariants in 1859 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:41:02] [INFO ] Computed 32 place invariants in 84 ms
[2022-06-08 08:41:02] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:41:03] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 3079 ms to find 0 implicit places.
[2022-06-08 08:41:03] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:41:03] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 08:41:06] [INFO ] Dead Transitions using invariants and state equation in 2740 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00 in 60389 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:41:06] [INFO ] Computed 32 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 59 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:41:06] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:41:06] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:41:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:07] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2022-06-08 08:41:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:41:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:41:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:09] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2022-06-08 08:41:09] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:41:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:41:13] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3712 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 506 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:41:13] [INFO ] Computed 32 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 6364 resets, run finished after 9675 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 180 resets, run finished after 1274 ms. (steps per millisecond=784 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:41:24] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:41:24] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:41:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:26] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2022-06-08 08:41:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:41:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:41:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:27] [INFO ] [Nat]Absence check using state equation in 1151 ms returned sat
[2022-06-08 08:41:27] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:41:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:41:33] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6335 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 113 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 99 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:41:34] [INFO ] Computed 32 place invariants in 85 ms
[2022-06-08 08:41:35] [INFO ] Implicit Places using invariants in 1767 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:41:35] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:41:36] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:41:37] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
[2022-06-08 08:41:37] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:41:37] [INFO ] Computed 32 place invariants in 68 ms
[2022-06-08 08:41:39] [INFO ] Dead Transitions using invariants and state equation in 2554 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01 in 33633 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:41:40] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 61 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:41:40] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 08:41:40] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:41:40] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:41] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2022-06-08 08:41:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:41:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:41:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:42] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2022-06-08 08:41:42] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:41:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:41:46] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3724 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[0]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1193 transition count 3914
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1193 transition count 3913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 455 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:41:47] [INFO ] Computed 32 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 6358 resets, run finished after 9653 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 186 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:41:58] [INFO ] Computed 32 place invariants in 61 ms
[2022-06-08 08:41:58] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:41:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:41:59] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2022-06-08 08:41:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:41:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:41:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:42:00] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2022-06-08 08:42:00] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:42:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:42:07] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6329 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 124 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:07] [INFO ] Computed 32 place invariants in 69 ms
[2022-06-08 08:42:09] [INFO ] Implicit Places using invariants in 1770 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:09] [INFO ] Computed 32 place invariants in 76 ms
[2022-06-08 08:42:10] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:42:10] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 3007 ms to find 0 implicit places.
[2022-06-08 08:42:10] [INFO ] Redundant transitions in 303 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:10] [INFO ] Computed 32 place invariants in 62 ms
[2022-06-08 08:42:13] [INFO ] Dead Transitions using invariants and state equation in 2764 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:13] [INFO ] Computed 32 place invariants in 71 ms
Incomplete random walk after 1000000 steps, including 6342 resets, run finished after 9602 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 1269 ms. (steps per millisecond=788 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:24] [INFO ] Computed 32 place invariants in 71 ms
[2022-06-08 08:42:24] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:42:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:42:25] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2022-06-08 08:42:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:42:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:42:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:42:27] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2022-06-08 08:42:27] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:42:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:42:33] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6328 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 100 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:33] [INFO ] Computed 32 place invariants in 62 ms
[2022-06-08 08:42:35] [INFO ] Implicit Places using invariants in 1757 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:35] [INFO ] Computed 32 place invariants in 75 ms
[2022-06-08 08:42:36] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:42:36] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 2954 ms to find 0 implicit places.
[2022-06-08 08:42:37] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:42:37] [INFO ] Computed 32 place invariants in 62 ms
[2022-06-08 08:42:40] [INFO ] Dead Transitions using invariants and state equation in 3809 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02 in 60828 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:42:40] [INFO ] Computed 32 place invariants in 63 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:42:41] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:42:41] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:42:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:42:43] [INFO ] [Real]Absence check using state equation in 1703 ms returned sat
[2022-06-08 08:42:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:42:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 29 ms returned sat
[2022-06-08 08:42:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:42:44] [INFO ] [Nat]Absence check using state equation in 1628 ms returned sat
[2022-06-08 08:42:44] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:42:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:42:48] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3150 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 450 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:42:48] [INFO ] Computed 32 place invariants in 69 ms
Incomplete random walk after 1000000 steps, including 6359 resets, run finished after 10320 ms. (steps per millisecond=96 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 179 resets, run finished after 1317 ms. (steps per millisecond=759 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:43:00] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:43:00] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2022-06-08 08:43:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:01] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2022-06-08 08:43:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:43:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:43:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:03] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2022-06-08 08:43:03] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:43:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:43:09] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6329 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 98 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 95 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:43:09] [INFO ] Computed 32 place invariants in 68 ms
[2022-06-08 08:43:11] [INFO ] Implicit Places using invariants in 1797 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:43:11] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:43:12] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:43:12] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
[2022-06-08 08:43:13] [INFO ] Redundant transitions in 303 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:43:13] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:43:15] [INFO ] Dead Transitions using invariants and state equation in 2640 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03 in 34861 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:43:15] [INFO ] Computed 32 place invariants in 63 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:43:15] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:43:16] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:43:16] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:17] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2022-06-08 08:43:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:43:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:43:17] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:18] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2022-06-08 08:43:18] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:43:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:43:22] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3695 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 1191 transition count 3912
Applied a total of 21 rules in 330 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:43:22] [INFO ] Computed 32 place invariants in 84 ms
Incomplete random walk after 1000000 steps, including 6371 resets, run finished after 9659 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 182 resets, run finished after 1329 ms. (steps per millisecond=752 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:43:33] [INFO ] Computed 32 place invariants in 80 ms
[2022-06-08 08:43:34] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:43:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:35] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2022-06-08 08:43:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:43:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:43:35] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:36] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2022-06-08 08:43:36] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:43:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:43:43] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6324 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 95 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:43:43] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:43:44] [INFO ] Implicit Places using invariants in 1768 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:43:45] [INFO ] Computed 32 place invariants in 92 ms
[2022-06-08 08:43:45] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:43:46] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2022-06-08 08:43:46] [INFO ] Redundant transitions in 305 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:43:46] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:43:49] [INFO ] Dead Transitions using invariants and state equation in 2698 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04 in 33552 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-05
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:43:49] [INFO ] Computed 32 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 63 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:43:49] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:43:49] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:43:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:50] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2022-06-08 08:43:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:43:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:43:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:43:52] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2022-06-08 08:43:52] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:43:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:43:55] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3573 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1193 transition count 3914
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1193 transition count 3913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 452 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:43:56] [INFO ] Computed 32 place invariants in 69 ms
Incomplete random walk after 1000000 steps, including 6359 resets, run finished after 9652 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 181 resets, run finished after 1273 ms. (steps per millisecond=785 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:07] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:44:07] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:44:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:08] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2022-06-08 08:44:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:44:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:44:09] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:10] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2022-06-08 08:44:10] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:44:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:44:16] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6325 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 98 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:16] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:44:18] [INFO ] Implicit Places using invariants in 1783 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:18] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 08:44:19] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:44:19] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 3015 ms to find 0 implicit places.
[2022-06-08 08:44:20] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:20] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 08:44:23] [INFO ] Dead Transitions using invariants and state equation in 3200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-05 in 34050 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-06
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:44:23] [INFO ] Computed 32 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:44:23] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:44:23] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:44:23] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:24] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2022-06-08 08:44:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:44:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:44:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:26] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2022-06-08 08:44:26] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:44:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:44:30] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3634 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1193 transition count 3914
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1193 transition count 3913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 431 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:30] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 1000000 steps, including 6355 resets, run finished after 9606 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 179 resets, run finished after 1269 ms. (steps per millisecond=788 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:41] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:44:41] [INFO ] [Real]Absence check using 30 positive place invariants in 30 ms returned sat
[2022-06-08 08:44:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:42] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2022-06-08 08:44:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:44:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:44:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:44] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2022-06-08 08:44:44] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:44:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:44:50] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6332 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 104 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 99 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:50] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:44:52] [INFO ] Implicit Places using invariants in 1733 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:52] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:44:53] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:44:53] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 2936 ms to find 0 implicit places.
[2022-06-08 08:44:53] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:44:53] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:44:56] [INFO ] Dead Transitions using invariants and state equation in 2882 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-06 in 33477 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:44:56] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:44:57] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:44:57] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:44:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:58] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2022-06-08 08:44:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:44:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:44:58] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:44:59] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2022-06-08 08:44:59] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:45:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:45:03] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3682 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 441 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:04] [INFO ] Computed 32 place invariants in 72 ms
Incomplete random walk after 1000000 steps, including 6347 resets, run finished after 9644 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 183 resets, run finished after 1277 ms. (steps per millisecond=783 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:14] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:45:15] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:45:15] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:45:16] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2022-06-08 08:45:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:45:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:45:16] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:45:17] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2022-06-08 08:45:17] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:45:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:45:24] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6326 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 103 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 95 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:24] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:45:26] [INFO ] Implicit Places using invariants in 1737 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:26] [INFO ] Computed 32 place invariants in 68 ms
[2022-06-08 08:45:26] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:45:27] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 2969 ms to find 0 implicit places.
[2022-06-08 08:45:27] [INFO ] Redundant transitions in 303 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:27] [INFO ] Computed 32 place invariants in 69 ms
[2022-06-08 08:45:30] [INFO ] Dead Transitions using invariants and state equation in 2593 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08 in 33402 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-09
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:45:30] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 64 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:45:30] [INFO ] Computed 32 place invariants in 63 ms
[2022-06-08 08:45:30] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:45:30] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:45:31] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2022-06-08 08:45:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:45:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:45:32] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:45:33] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2022-06-08 08:45:33] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:45:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:45:36] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3657 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 450 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:37] [INFO ] Computed 32 place invariants in 68 ms
Incomplete random walk after 1000000 steps, including 6371 resets, run finished after 9623 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 180 resets, run finished after 1263 ms. (steps per millisecond=791 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:48] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:45:48] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:45:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:45:49] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2022-06-08 08:45:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:45:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:45:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:45:51] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2022-06-08 08:45:51] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:45:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:45:57] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6319 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 99 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 96 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:57] [INFO ] Computed 32 place invariants in 92 ms
[2022-06-08 08:45:59] [INFO ] Implicit Places using invariants in 1770 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:45:59] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:46:00] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:46:00] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2022-06-08 08:46:00] [INFO ] Redundant transitions in 303 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:46:00] [INFO ] Computed 32 place invariants in 68 ms
[2022-06-08 08:46:03] [INFO ] Dead Transitions using invariants and state equation in 2584 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-09 in 33361 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-10
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:46:03] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 65 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:46:03] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:46:03] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:46:03] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:46:04] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2022-06-08 08:46:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:46:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 08:46:05] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:46:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:46:06] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2022-06-08 08:46:06] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:46:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:46:10] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3672 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[0]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 1193 transition count 3914
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1193 transition count 3913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 434 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:10] [INFO ] Computed 32 place invariants in 65 ms
Incomplete random walk after 1000000 steps, including 6366 resets, run finished after 9638 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 183 resets, run finished after 1271 ms. (steps per millisecond=786 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:21] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:46:21] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:46:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 08:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:46:22] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2022-06-08 08:46:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:46:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:46:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:46:24] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2022-06-08 08:46:24] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:46:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:46:30] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6322 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:30] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:46:32] [INFO ] Implicit Places using invariants in 1767 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:32] [INFO ] Computed 32 place invariants in 69 ms
[2022-06-08 08:46:33] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:46:33] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 2992 ms to find 0 implicit places.
[2022-06-08 08:46:34] [INFO ] Redundant transitions in 305 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:34] [INFO ] Computed 32 place invariants in 72 ms
[2022-06-08 08:46:36] [INFO ] Dead Transitions using invariants and state equation in 2607 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:36] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 1000000 steps, including 6382 resets, run finished after 9613 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 181 resets, run finished after 1278 ms. (steps per millisecond=782 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:47] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:46:47] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:46:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:46:49] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2022-06-08 08:46:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:46:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:46:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:46:50] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2022-06-08 08:46:50] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:46:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:46:56] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6328 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 102 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:57] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:46:58] [INFO ] Implicit Places using invariants in 1763 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:46:58] [INFO ] Computed 32 place invariants in 69 ms
[2022-06-08 08:46:59] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:46:59] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2022-06-08 08:47:00] [INFO ] Redundant transitions in 303 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:47:00] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 08:47:02] [INFO ] Dead Transitions using invariants and state equation in 2522 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-10 in 59257 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:47:02] [INFO ] Computed 32 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 63 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:47:03] [INFO ] Computed 32 place invariants in 73 ms
[2022-06-08 08:47:03] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:47:03] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:04] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2022-06-08 08:47:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:47:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:47:04] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:06] [INFO ] [Nat]Absence check using state equation in 1275 ms returned sat
[2022-06-08 08:47:06] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:47:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:47:09] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3503 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1193 transition count 3914
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 1193 transition count 3913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 437 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:47:10] [INFO ] Computed 32 place invariants in 74 ms
Incomplete random walk after 1000000 steps, including 6362 resets, run finished after 9636 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 181 resets, run finished after 1275 ms. (steps per millisecond=784 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:47:21] [INFO ] Computed 32 place invariants in 62 ms
[2022-06-08 08:47:21] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:47:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:22] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2022-06-08 08:47:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:47:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:47:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:23] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2022-06-08 08:47:23] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:47:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:47:30] [INFO ] [Nat]Added 3710 Read/Feed constraints in 6324 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 96 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:47:30] [INFO ] Computed 32 place invariants in 62 ms
[2022-06-08 08:47:32] [INFO ] Implicit Places using invariants in 1766 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:47:32] [INFO ] Computed 32 place invariants in 69 ms
[2022-06-08 08:47:32] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2022-06-08 08:47:33] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 2956 ms to find 0 implicit places.
[2022-06-08 08:47:33] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:47:33] [INFO ] Computed 32 place invariants in 62 ms
[2022-06-08 08:47:36] [INFO ] Dead Transitions using invariants and state equation in 2577 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11 in 33428 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:47:36] [INFO ] Computed 32 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 63 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:47:36] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:47:36] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:47:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 08:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:37] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2022-06-08 08:47:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:47:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:47:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:39] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2022-06-08 08:47:39] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:47:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:47:42] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3690 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 423 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:47:43] [INFO ] Computed 32 place invariants in 79 ms
Incomplete random walk after 1000000 steps, including 6360 resets, run finished after 9640 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 182 resets, run finished after 1275 ms. (steps per millisecond=784 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:47:54] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:47:54] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:47:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:55] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2022-06-08 08:47:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:47:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:47:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:47:57] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2022-06-08 08:47:57] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:48:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:48:03] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6336 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 97 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 95 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:48:03] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:48:05] [INFO ] Implicit Places using invariants in 1709 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:48:05] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:48:06] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:48:06] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 2888 ms to find 0 implicit places.
[2022-06-08 08:48:06] [INFO ] Redundant transitions in 302 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:48:07] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:48:09] [INFO ] Dead Transitions using invariants and state equation in 2578 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12 in 33320 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:48:09] [INFO ] Computed 32 place invariants in 70 ms
Incomplete random walk after 10000 steps, including 62 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:48:09] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:48:09] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:48:09] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:48:11] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2022-06-08 08:48:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:48:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:48:11] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:48:12] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2022-06-08 08:48:12] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:48:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:48:16] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3619 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[4]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1191 transition count 3912
Applied a total of 23 rules in 339 ms. Remains 1191 /1198 variables (removed 7) and now considering 3912/3919 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1198 places, 3912/3919 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:16] [INFO ] Computed 32 place invariants in 73 ms
Incomplete random walk after 1000000 steps, including 6286 resets, run finished after 9402 ms. (steps per millisecond=106 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1226 ms. (steps per millisecond=815 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:27] [INFO ] Computed 32 place invariants in 70 ms
[2022-06-08 08:48:27] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2022-06-08 08:48:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:48:28] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2022-06-08 08:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:48:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:48:29] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:48:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:48:30] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2022-06-08 08:48:30] [INFO ] State equation strengthened by 3626 read => feed constraints.
[2022-06-08 08:48:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:48:36] [INFO ] [Nat]Added 3626 Read/Feed constraints in 6330 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[14]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 94 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 92 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:36] [INFO ] Computed 32 place invariants in 70 ms
[2022-06-08 08:48:38] [INFO ] Implicit Places using invariants in 1681 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:38] [INFO ] Computed 32 place invariants in 72 ms
[2022-06-08 08:48:39] [INFO ] State equation strengthened by 3626 read => feed constraints.
[2022-06-08 08:48:39] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 2879 ms to find 0 implicit places.
[2022-06-08 08:48:39] [INFO ] Redundant transitions in 303 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:40] [INFO ] Computed 32 place invariants in 72 ms
[2022-06-08 08:48:42] [INFO ] Dead Transitions using invariants and state equation in 2624 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:42] [INFO ] Computed 32 place invariants in 71 ms
Incomplete random walk after 1000000 steps, including 6271 resets, run finished after 9385 ms. (steps per millisecond=106 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties (out of 1) seen :1
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:48:53] [INFO ] Computed 32 place invariants in 71 ms
[2022-06-08 08:48:53] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:48:53] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:48:54] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2022-06-08 08:48:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:48:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2022-06-08 08:48:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:48:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:48:56] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2022-06-08 08:48:56] [INFO ] State equation strengthened by 3626 read => feed constraints.
[2022-06-08 08:48:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:49:02] [INFO ] [Nat]Added 3626 Read/Feed constraints in 6326 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[14]
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 99 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Starting structural reductions, iteration 0 : 1191/1191 places, 3912/3912 transitions.
Applied a total of 0 rules in 93 ms. Remains 1191 /1191 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:49:02] [INFO ] Computed 32 place invariants in 71 ms
[2022-06-08 08:49:04] [INFO ] Implicit Places using invariants in 1679 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:49:04] [INFO ] Computed 32 place invariants in 78 ms
[2022-06-08 08:49:05] [INFO ] State equation strengthened by 3626 read => feed constraints.
[2022-06-08 08:49:05] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 2880 ms to find 0 implicit places.
[2022-06-08 08:49:05] [INFO ] Redundant transitions in 302 ms returned []
// Phase 1: matrix 3912 rows 1191 cols
[2022-06-08 08:49:05] [INFO ] Computed 32 place invariants in 75 ms
[2022-06-08 08:49:08] [INFO ] Dead Transitions using invariants and state equation in 2612 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1191/1191 places, 3912/3912 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13 in 59002 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:49:08] [INFO ] Computed 32 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 61 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:49:08] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:49:08] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:49:08] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:49:10] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2022-06-08 08:49:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:49:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:49:10] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:49:11] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2022-06-08 08:49:11] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:49:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:49:15] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3555 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 435 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:15] [INFO ] Computed 32 place invariants in 89 ms
Incomplete random walk after 1000000 steps, including 6364 resets, run finished after 9604 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 182 resets, run finished after 1259 ms. (steps per millisecond=794 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:26] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:49:26] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2022-06-08 08:49:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:49:28] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2022-06-08 08:49:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:49:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:49:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:49:29] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2022-06-08 08:49:29] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:49:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:49:35] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6332 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 100 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 94 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:36] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:49:37] [INFO ] Implicit Places using invariants in 1753 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:37] [INFO ] Computed 32 place invariants in 68 ms
[2022-06-08 08:49:38] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:49:38] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 2981 ms to find 0 implicit places.
[2022-06-08 08:49:39] [INFO ] Redundant transitions in 307 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:39] [INFO ] Computed 32 place invariants in 69 ms
[2022-06-08 08:49:41] [INFO ] Dead Transitions using invariants and state equation in 2603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14 in 33333 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:49:41] [INFO ] Computed 32 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 63 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 3919 rows 1198 cols
[2022-06-08 08:49:42] [INFO ] Computed 32 place invariants in 64 ms
[2022-06-08 08:49:42] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:49:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:49:43] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2022-06-08 08:49:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:49:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 27 ms returned sat
[2022-06-08 08:49:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 08:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:49:44] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2022-06-08 08:49:44] [INFO ] State equation strengthened by 3605 read => feed constraints.
[2022-06-08 08:49:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:49:48] [INFO ] [Nat]Added 3605 Read/Feed constraints in 3668 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1198/1198 places, 3919/3919 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1192 transition count 3913
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1192 transition count 3912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1191 transition count 3912
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1191 transition count 3911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1190 transition count 3911
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 1190 transition count 3911
Applied a total of 24 rules in 441 ms. Remains 1190 /1198 variables (removed 8) and now considering 3911/3919 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1198 places, 3911/3919 transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:49] [INFO ] Computed 32 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 6356 resets, run finished after 9634 ms. (steps per millisecond=103 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 186 resets, run finished after 1259 ms. (steps per millisecond=794 ) properties (out of 1) seen :1
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:49:59] [INFO ] Computed 32 place invariants in 66 ms
[2022-06-08 08:50:00] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:50:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 08:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 08:50:01] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2022-06-08 08:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 08:50:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2022-06-08 08:50:01] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2022-06-08 08:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 08:50:02] [INFO ] [Nat]Absence check using state equation in 1121 ms returned sat
[2022-06-08 08:50:02] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:50:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 08:50:09] [INFO ] [Nat]Added 3711 Read/Feed constraints in 6319 ms returned unknown
Current structural bounds on expressions (after SMT) : [30] Max seen :[1]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 103 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Starting structural reductions, iteration 0 : 1190/1190 places, 3911/3911 transitions.
Applied a total of 0 rules in 96 ms. Remains 1190 /1190 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:50:09] [INFO ] Computed 32 place invariants in 74 ms
[2022-06-08 08:50:10] [INFO ] Implicit Places using invariants in 1733 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:50:11] [INFO ] Computed 32 place invariants in 68 ms
[2022-06-08 08:50:11] [INFO ] State equation strengthened by 3711 read => feed constraints.
[2022-06-08 08:50:12] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 2970 ms to find 0 implicit places.
[2022-06-08 08:50:12] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 3911 rows 1190 cols
[2022-06-08 08:50:12] [INFO ] Computed 32 place invariants in 67 ms
[2022-06-08 08:50:15] [INFO ] Dead Transitions using invariants and state equation in 2596 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1190/1190 places, 3911/3911 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15 in 33285 ms.
[2022-06-08 08:50:16] [INFO ] Flatten gal took : 750 ms
[2022-06-08 08:50:16] [INFO ] Applying decomposition
[2022-06-08 08:50:16] [INFO ] Flatten gal took : 189 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17520087462829252160.txt, -o, /tmp/graph17520087462829252160.bin, -w, /tmp/graph17520087462829252160.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17520087462829252160.bin, -l, -1, -v, -w, /tmp/graph17520087462829252160.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 08:50:17] [INFO ] Decomposing Gal with order
[2022-06-08 08:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 08:50:18] [INFO ] Removed a total of 2983 redundant transitions.
[2022-06-08 08:50:19] [INFO ] Flatten gal took : 1111 ms
[2022-06-08 08:50:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 3369 labels/synchronizations in 386 ms.
[2022-06-08 08:50:19] [INFO ] Time to serialize gal into /tmp/UpperBounds18326555190762741181.gal : 75 ms
[2022-06-08 08:50:19] [INFO ] Time to serialize properties into /tmp/UpperBounds5988129562550494658.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18326555190762741181.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5988129562550494658.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18326555190762741181.gal -t CGAL -reachable-file /tmp/UpperBounds5988129562550494658.prop --nowitness
Loading property file /tmp/UpperBounds5988129562550494658.prop.
Detected timeout of ITS tools.
[2022-06-08 09:16:30] [INFO ] Flatten gal took : 1022 ms
[2022-06-08 09:16:31] [INFO ] Time to serialize gal into /tmp/UpperBounds11654160799181894289.gal : 312 ms
[2022-06-08 09:16:31] [INFO ] Time to serialize properties into /tmp/UpperBounds12181686290255296029.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11654160799181894289.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12181686290255296029.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11654160799181894289.gal -t CGAL -reachable-file /tmp/UpperBounds12181686290255296029.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds12181686290255296029.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is CANInsertWithFailure-PT-030, 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 r305-smll-165463878300010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;