About the Execution of GreatSPN+red for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8242.808 | 3600000.00 | 4977914.00 | 6948.20 | ? ? ? ? ? 1 ? ? ? ? ? ? ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r069-tall-171620503800117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r069-tall-171620503800117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716393232229
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 15:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:53:53] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-22 15:53:53] [INFO ] Transformed 2164 places.
[2024-05-22 15:53:53] [INFO ] Transformed 5580 transitions.
[2024-05-22 15:53:53] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 5580 rows 2164 cols
[2024-05-22 15:53:54] [INFO ] Computed 33 invariants in 281 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 30, 30, 30, 30, 1, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 10000 steps (14 resets) in 103 ms. (96 steps per ms)
FORMULA CANInsertWithFailure-PT-030-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 159 ms. (937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-22 15:53:54] [INFO ] Invariant cache hit.
[2024-05-22 15:53:55] [INFO ] [Real]Absence check using 31 positive place invariants in 49 ms returned sat
[2024-05-22 15:53:55] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-22 15:53:56] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2024-05-22 15:53:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-22 15:53:56] [INFO ] [Real]Added 1770 Read/Feed constraints in 185 ms returned sat
[2024-05-22 15:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:53:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2024-05-22 15:53:57] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:53:58] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2024-05-22 15:53:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:53:59] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1087 ms returned unknown
[2024-05-22 15:53:59] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:53:59] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:01] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2024-05-22 15:54:01] [INFO ] [Real]Added 1770 Read/Feed constraints in 174 ms returned sat
[2024-05-22 15:54:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-22 15:54:01] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:03] [INFO ] [Nat]Absence check using state equation in 1321 ms returned sat
[2024-05-22 15:54:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:04] [INFO ] [Nat]Added 1770 Read/Feed constraints in 978 ms returned sat
[2024-05-22 15:54:04] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 273 ms.
[2024-05-22 15:54:05] [INFO ] Added : 10 causal constraints over 2 iterations in 1023 ms. Result :sat
Minimization took 1245 ms.
[2024-05-22 15:54:06] [INFO ] [Real]Absence check using 31 positive place invariants in 35 ms returned sat
[2024-05-22 15:54:06] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-22 15:54:08] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2024-05-22 15:54:08] [INFO ] [Real]Added 1770 Read/Feed constraints in 202 ms returned sat
[2024-05-22 15:54:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-22 15:54:09] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:54:10] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2024-05-22 15:54:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:11] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1087 ms returned unknown
[2024-05-22 15:54:12] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-22 15:54:12] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 15:54:13] [INFO ] [Real]Absence check using state equation in 1504 ms returned sat
[2024-05-22 15:54:13] [INFO ] [Real]Added 1770 Read/Feed constraints in 190 ms returned sat
[2024-05-22 15:54:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-22 15:54:14] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-22 15:54:15] [INFO ] [Nat]Absence check using state equation in 1505 ms returned sat
[2024-05-22 15:54:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:16] [INFO ] [Nat]Added 1770 Read/Feed constraints in 989 ms returned sat
[2024-05-22 15:54:17] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 292 ms.
[2024-05-22 15:54:18] [INFO ] Added : 11 causal constraints over 3 iterations in 1206 ms. Result :sat
Minimization took 841 ms.
[2024-05-22 15:54:19] [INFO ] [Real]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-22 15:54:19] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 15:54:20] [INFO ] [Real]Absence check using state equation in 1392 ms returned sat
[2024-05-22 15:54:21] [INFO ] [Real]Added 1770 Read/Feed constraints in 235 ms returned sat
[2024-05-22 15:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-22 15:54:21] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:22] [INFO ] [Nat]Absence check using state equation in 1375 ms returned sat
[2024-05-22 15:54:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:23] [INFO ] [Nat]Added 1770 Read/Feed constraints in 893 ms returned sat
[2024-05-22 15:54:24] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 394 ms.
[2024-05-22 15:54:25] [INFO ] Added : 11 causal constraints over 3 iterations in 1276 ms. Result :sat
Minimization took 1028 ms.
[2024-05-22 15:54:26] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-22 15:54:26] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:54:27] [INFO ] [Real]Absence check using state equation in 1546 ms returned sat
[2024-05-22 15:54:28] [INFO ] [Real]Added 1770 Read/Feed constraints in 220 ms returned sat
[2024-05-22 15:54:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 55 ms returned sat
[2024-05-22 15:54:28] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-22 15:54:30] [INFO ] [Nat]Absence check using state equation in 1526 ms returned sat
[2024-05-22 15:54:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:31] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1095 ms returned unknown
[2024-05-22 15:54:31] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-22 15:54:31] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-22 15:54:32] [INFO ] [Real]Absence check using state equation in 1461 ms returned sat
[2024-05-22 15:54:33] [INFO ] [Real]Added 1770 Read/Feed constraints in 164 ms returned sat
[2024-05-22 15:54:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-22 15:54:33] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:35] [INFO ] [Nat]Absence check using state equation in 1483 ms returned sat
[2024-05-22 15:54:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:35] [INFO ] [Nat]Added 1770 Read/Feed constraints in 761 ms returned sat
[2024-05-22 15:54:36] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 243 ms.
[2024-05-22 15:54:37] [INFO ] Added : 11 causal constraints over 3 iterations in 1086 ms. Result :sat
Minimization took 1293 ms.
[2024-05-22 15:54:38] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-22 15:54:38] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:54:40] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2024-05-22 15:54:40] [INFO ] [Real]Added 1770 Read/Feed constraints in 191 ms returned sat
[2024-05-22 15:54:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:54:40] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:42] [INFO ] [Nat]Absence check using state equation in 1536 ms returned sat
[2024-05-22 15:54:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:43] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1084 ms returned unknown
[2024-05-22 15:54:43] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-22 15:54:43] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:45] [INFO ] [Real]Absence check using state equation in 1466 ms returned sat
[2024-05-22 15:54:45] [INFO ] [Real]Added 1770 Read/Feed constraints in 215 ms returned sat
[2024-05-22 15:54:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:54:45] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:47] [INFO ] [Nat]Absence check using state equation in 1474 ms returned sat
[2024-05-22 15:54:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:48] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1098 ms returned unknown
[2024-05-22 15:54:48] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-22 15:54:48] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:54:50] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2024-05-22 15:54:50] [INFO ] [Real]Added 1770 Read/Feed constraints in 194 ms returned sat
[2024-05-22 15:54:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-22 15:54:51] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:52] [INFO ] [Nat]Absence check using state equation in 1825 ms returned sat
[2024-05-22 15:54:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:54] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1089 ms returned unknown
[2024-05-22 15:54:54] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:54:54] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:54:56] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2024-05-22 15:54:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:54:56] [INFO ] [Real]Added 1770 Read/Feed constraints in 633 ms returned sat
[2024-05-22 15:54:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:54:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:54:57] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:54:58] [INFO ] [Nat]Absence check using state equation in 1796 ms returned sat
[2024-05-22 15:54:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:55:00] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1109 ms returned unknown
[2024-05-22 15:55:00] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-22 15:55:00] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 15:55:01] [INFO ] [Real]Absence check using state equation in 1571 ms returned sat
[2024-05-22 15:55:02] [INFO ] [Real]Added 1770 Read/Feed constraints in 371 ms returned sat
[2024-05-22 15:55:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:55:02] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:55:04] [INFO ] [Nat]Absence check using state equation in 1576 ms returned sat
[2024-05-22 15:55:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:55:05] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1086 ms returned unknown
[2024-05-22 15:55:05] [INFO ] [Real]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-22 15:55:05] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:55:07] [INFO ] [Real]Absence check using state equation in 1549 ms returned sat
[2024-05-22 15:55:07] [INFO ] [Real]Added 1770 Read/Feed constraints in 484 ms returned sat
[2024-05-22 15:55:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2024-05-22 15:55:08] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:55:09] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2024-05-22 15:55:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:55:10] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1087 ms returned unknown
[2024-05-22 15:55:11] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-22 15:55:11] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-22 15:55:13] [INFO ] [Real]Absence check using state equation in 1854 ms returned sat
[2024-05-22 15:55:13] [INFO ] [Real]Added 1770 Read/Feed constraints in 291 ms returned sat
[2024-05-22 15:55:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-22 15:55:13] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:55:15] [INFO ] [Nat]Absence check using state equation in 1872 ms returned sat
[2024-05-22 15:55:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:55:16] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1090 ms returned unknown
[2024-05-22 15:55:16] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-22 15:55:16] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 15:55:18] [INFO ] [Real]Absence check using state equation in 1753 ms returned sat
[2024-05-22 15:55:19] [INFO ] [Real]Added 1770 Read/Feed constraints in 305 ms returned sat
[2024-05-22 15:55:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-22 15:55:19] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:55:21] [INFO ] [Nat]Absence check using state equation in 1758 ms returned sat
[2024-05-22 15:55:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:55:22] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1092 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 421 place count 1953 transition count 5370
Performed 863 Post agglomeration using F-continuation condition.Transition count delta: 863
Deduced a syphon composed of 863 places in 2 ms
Reduce places removed 863 places and 0 transitions.
Iterating global reduction 2 with 1726 rules applied. Total rules applied 2147 place count 1090 transition count 4507
Drop transitions (Redundant composition of simpler transitions.) removed 805 transitions
Redundant transition composition rules discarded 805 transitions
Iterating global reduction 2 with 805 rules applied. Total rules applied 2952 place count 1090 transition count 3702
Partial Free-agglomeration rule applied 950 times.
Drop transitions (Partial Free agglomeration) removed 950 transitions
Iterating global reduction 2 with 950 rules applied. Total rules applied 3902 place count 1090 transition count 3702
Applied a total of 3902 rules in 1081 ms. Remains 1090 /2164 variables (removed 1074) and now considering 3702/5580 (removed 1878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 1090/2164 places, 3702/5580 transitions.
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 15:55:23] [INFO ] Computed 32 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7128 resets) in 7948 ms. (125 steps per ms)
BEST_FIRST walk for 15000015 steps (3063 resets) in 14011 ms. (1070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-22 15:55:45] [INFO ] Invariant cache hit.
[2024-05-22 15:55:45] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:55:45] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:55:46] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2024-05-22 15:55:46] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 15:55:46] [INFO ] [Real]Added 3582 Read/Feed constraints in 256 ms returned sat
[2024-05-22 15:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:55:46] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:55:47] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-05-22 15:55:47] [INFO ] [Nat]Added 3582 Read/Feed constraints in 296 ms returned sat
[2024-05-22 15:55:48] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 186 ms.
[2024-05-22 15:55:48] [INFO ] Added : 5 causal constraints over 1 iterations in 536 ms. Result :sat
Minimization took 4518 ms.
[2024-05-22 15:55:53] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:55:53] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:55:53] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-22 15:55:53] [INFO ] [Real]Added 3582 Read/Feed constraints in 237 ms returned sat
[2024-05-22 15:55:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2024-05-22 15:55:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:55:54] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-05-22 15:55:55] [INFO ] [Nat]Added 3582 Read/Feed constraints in 273 ms returned sat
[2024-05-22 15:55:55] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-22 15:55:55] [INFO ] Added : 6 causal constraints over 2 iterations in 628 ms. Result :sat
Minimization took 4500 ms.
[2024-05-22 15:56:00] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:00] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-22 15:56:01] [INFO ] [Real]Added 3582 Read/Feed constraints in 248 ms returned sat
[2024-05-22 15:56:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:56:01] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:56:02] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-22 15:56:02] [INFO ] [Nat]Added 3582 Read/Feed constraints in 284 ms returned sat
[2024-05-22 15:56:02] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-22 15:56:03] [INFO ] Added : 6 causal constraints over 2 iterations in 644 ms. Result :sat
Minimization took 4516 ms.
[2024-05-22 15:56:07] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:56:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-22 15:56:08] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-22 15:56:08] [INFO ] [Real]Added 3582 Read/Feed constraints in 257 ms returned sat
[2024-05-22 15:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:56:09] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-05-22 15:56:09] [INFO ] [Nat]Added 3582 Read/Feed constraints in 309 ms returned sat
[2024-05-22 15:56:09] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-22 15:56:10] [INFO ] Added : 8 causal constraints over 2 iterations in 642 ms. Result :sat
Minimization took 4519 ms.
[2024-05-22 15:56:15] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:15] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:56:15] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-22 15:56:16] [INFO ] [Real]Added 3582 Read/Feed constraints in 244 ms returned sat
[2024-05-22 15:56:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:16] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 15:56:16] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-22 15:56:17] [INFO ] [Nat]Added 3582 Read/Feed constraints in 303 ms returned sat
[2024-05-22 15:56:17] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 189 ms.
[2024-05-22 15:56:17] [INFO ] Added : 13 causal constraints over 3 iterations in 766 ms. Result :sat
Minimization took 4511 ms.
[2024-05-22 15:56:22] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:22] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:23] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-22 15:56:23] [INFO ] [Real]Added 3582 Read/Feed constraints in 242 ms returned sat
[2024-05-22 15:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:56:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:56:24] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2024-05-22 15:56:24] [INFO ] [Nat]Added 3582 Read/Feed constraints in 270 ms returned sat
[2024-05-22 15:56:24] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 191 ms.
[2024-05-22 15:56:25] [INFO ] Added : 7 causal constraints over 2 iterations in 648 ms. Result :sat
Minimization took 4512 ms.
[2024-05-22 15:56:29] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:30] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2024-05-22 15:56:30] [INFO ] [Real]Added 3582 Read/Feed constraints in 264 ms returned sat
[2024-05-22 15:56:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:56:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:31] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-05-22 15:56:31] [INFO ] [Nat]Added 3582 Read/Feed constraints in 244 ms returned sat
[2024-05-22 15:56:32] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-22 15:56:32] [INFO ] Added : 4 causal constraints over 1 iterations in 511 ms. Result :sat
Minimization took 4513 ms.
[2024-05-22 15:56:37] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:37] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-22 15:56:37] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2024-05-22 15:56:38] [INFO ] [Real]Added 3582 Read/Feed constraints in 256 ms returned sat
[2024-05-22 15:56:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:56:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:38] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-22 15:56:39] [INFO ] [Nat]Added 3582 Read/Feed constraints in 311 ms returned sat
[2024-05-22 15:56:39] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 181 ms.
[2024-05-22 15:56:39] [INFO ] Added : 10 causal constraints over 2 iterations in 637 ms. Result :sat
Minimization took 4518 ms.
[2024-05-22 15:56:44] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:45] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2024-05-22 15:56:45] [INFO ] [Real]Added 3582 Read/Feed constraints in 257 ms returned sat
[2024-05-22 15:56:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:56:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:46] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-22 15:56:46] [INFO ] [Nat]Added 3582 Read/Feed constraints in 285 ms returned sat
[2024-05-22 15:56:46] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 178 ms.
[2024-05-22 15:56:47] [INFO ] Added : 4 causal constraints over 1 iterations in 524 ms. Result :sat
Minimization took 4517 ms.
[2024-05-22 15:56:51] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:52] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-22 15:56:52] [INFO ] [Real]Added 3582 Read/Feed constraints in 270 ms returned sat
[2024-05-22 15:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:56:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:56:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:56:53] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-22 15:56:53] [INFO ] [Nat]Added 3582 Read/Feed constraints in 407 ms returned sat
[2024-05-22 15:56:54] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 176 ms.
[2024-05-22 15:56:54] [INFO ] Added : 10 causal constraints over 2 iterations in 647 ms. Result :sat
Minimization took 4531 ms.
[2024-05-22 15:56:59] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:56:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:56:59] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2024-05-22 15:57:00] [INFO ] [Real]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-22 15:57:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:57:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:57:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:57:01] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2024-05-22 15:57:01] [INFO ] [Nat]Added 3582 Read/Feed constraints in 312 ms returned sat
[2024-05-22 15:57:01] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 187 ms.
[2024-05-22 15:57:02] [INFO ] Added : 9 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 4531 ms.
[2024-05-22 15:57:06] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:57:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 15:57:07] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2024-05-22 15:57:07] [INFO ] [Real]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-22 15:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:57:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:57:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:57:08] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-22 15:57:08] [INFO ] [Nat]Added 3582 Read/Feed constraints in 313 ms returned sat
[2024-05-22 15:57:09] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 189 ms.
[2024-05-22 15:57:09] [INFO ] Added : 10 causal constraints over 2 iterations in 665 ms. Result :sat
Minimization took 4514 ms.
[2024-05-22 15:57:14] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:57:14] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:57:14] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-22 15:57:15] [INFO ] [Real]Added 3582 Read/Feed constraints in 247 ms returned sat
[2024-05-22 15:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:57:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:57:15] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:57:15] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-22 15:57:16] [INFO ] [Nat]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-22 15:57:16] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 193 ms.
[2024-05-22 15:57:16] [INFO ] Added : 8 causal constraints over 2 iterations in 665 ms. Result :sat
Minimization took 4516 ms.
[2024-05-22 15:57:21] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:57:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:57:22] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-22 15:57:22] [INFO ] [Real]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-22 15:57:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:57:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:57:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:57:23] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2024-05-22 15:57:23] [INFO ] [Nat]Added 3582 Read/Feed constraints in 371 ms returned sat
[2024-05-22 15:57:23] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 197 ms.
[2024-05-22 15:57:24] [INFO ] Added : 9 causal constraints over 2 iterations in 662 ms. Result :sat
Minimization took 4522 ms.
[2024-05-22 15:57:29] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:57:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:57:29] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-22 15:57:30] [INFO ] [Real]Added 3582 Read/Feed constraints in 256 ms returned sat
[2024-05-22 15:57:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:57:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:57:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:57:30] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-22 15:57:31] [INFO ] [Nat]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-22 15:57:31] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 197 ms.
[2024-05-22 15:57:31] [INFO ] Added : 9 causal constraints over 2 iterations in 673 ms. Result :sat
Minimization took 4526 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 89 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 72 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-22 15:57:36] [INFO ] Invariant cache hit.
[2024-05-22 15:57:37] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-22 15:57:37] [INFO ] Invariant cache hit.
[2024-05-22 15:57:38] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 15:57:57] [INFO ] Implicit Places using invariants and state equation in 19856 ms returned []
Implicit Place search using SMT with State Equation took 20792 ms to find 0 implicit places.
[2024-05-22 15:57:57] [INFO ] Redundant transitions in 223 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-22 15:57:57] [INFO ] Invariant cache hit.
[2024-05-22 15:57:57] [INFO ] State equation strengthened by 3582 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 33251ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 33315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54450 ms. Remains : 1090/1090 places, 3702/3702 transitions.
[2024-05-22 15:58:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
RANDOM walk for 1000000 steps (7134 resets) in 8117 ms. (123 steps per ms)
BEST_FIRST walk for 15000013 steps (3070 resets) in 15838 ms. (947 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-22 15:58:54] [INFO ] Invariant cache hit.
[2024-05-22 15:58:55] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:58:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 15:58:55] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2024-05-22 15:58:55] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 15:58:56] [INFO ] [Real]Added 3582 Read/Feed constraints in 299 ms returned sat
[2024-05-22 15:58:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:58:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:58:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:58:57] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-05-22 15:58:57] [INFO ] [Nat]Added 3582 Read/Feed constraints in 308 ms returned sat
[2024-05-22 15:58:57] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 226 ms.
[2024-05-22 15:58:58] [INFO ] Added : 5 causal constraints over 1 iterations in 601 ms. Result :sat
Minimization took 4511 ms.
[2024-05-22 15:59:02] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:03] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2024-05-22 15:59:03] [INFO ] [Real]Added 3582 Read/Feed constraints in 290 ms returned sat
[2024-05-22 15:59:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:59:04] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:04] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2024-05-22 15:59:05] [INFO ] [Nat]Added 3582 Read/Feed constraints in 334 ms returned sat
[2024-05-22 15:59:05] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 207 ms.
[2024-05-22 15:59:05] [INFO ] Added : 6 causal constraints over 2 iterations in 718 ms. Result :sat
Minimization took 4801 ms.
[2024-05-22 15:59:10] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:11] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-22 15:59:11] [INFO ] [Real]Added 3582 Read/Feed constraints in 250 ms returned sat
[2024-05-22 15:59:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:12] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:12] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-22 15:59:12] [INFO ] [Nat]Added 3582 Read/Feed constraints in 317 ms returned sat
[2024-05-22 15:59:13] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 228 ms.
[2024-05-22 15:59:13] [INFO ] Added : 6 causal constraints over 2 iterations in 722 ms. Result :sat
Minimization took 4719 ms.
[2024-05-22 15:59:18] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:59:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:19] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2024-05-22 15:59:19] [INFO ] [Real]Added 3582 Read/Feed constraints in 297 ms returned sat
[2024-05-22 15:59:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-22 15:59:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 15:59:20] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2024-05-22 15:59:20] [INFO ] [Nat]Added 3582 Read/Feed constraints in 350 ms returned sat
[2024-05-22 15:59:21] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 222 ms.
[2024-05-22 15:59:21] [INFO ] Added : 8 causal constraints over 2 iterations in 726 ms. Result :sat
Minimization took 4869 ms.
[2024-05-22 15:59:26] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 15:59:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 15:59:27] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2024-05-22 15:59:27] [INFO ] [Real]Added 3582 Read/Feed constraints in 291 ms returned sat
[2024-05-22 15:59:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:59:28] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2024-05-22 15:59:28] [INFO ] [Nat]Added 3582 Read/Feed constraints in 352 ms returned sat
[2024-05-22 15:59:29] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 220 ms.
[2024-05-22 15:59:29] [INFO ] Added : 13 causal constraints over 3 iterations in 829 ms. Result :sat
Minimization took 4843 ms.
[2024-05-22 15:59:34] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:59:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:35] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2024-05-22 15:59:35] [INFO ] [Real]Added 3582 Read/Feed constraints in 297 ms returned sat
[2024-05-22 15:59:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:59:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:36] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-22 15:59:37] [INFO ] [Nat]Added 3582 Read/Feed constraints in 284 ms returned sat
[2024-05-22 15:59:37] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 188 ms.
[2024-05-22 15:59:37] [INFO ] Added : 7 causal constraints over 2 iterations in 666 ms. Result :sat
Minimization took 4871 ms.
[2024-05-22 15:59:42] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:43] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2024-05-22 15:59:43] [INFO ] [Real]Added 3582 Read/Feed constraints in 271 ms returned sat
[2024-05-22 15:59:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 15:59:44] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-22 15:59:44] [INFO ] [Nat]Added 3582 Read/Feed constraints in 260 ms returned sat
[2024-05-22 15:59:45] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 181 ms.
[2024-05-22 15:59:45] [INFO ] Added : 4 causal constraints over 1 iterations in 540 ms. Result :sat
Minimization took 4795 ms.
[2024-05-22 15:59:50] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:59:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:50] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-22 15:59:51] [INFO ] [Real]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-22 15:59:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:52] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-22 15:59:52] [INFO ] [Nat]Added 3582 Read/Feed constraints in 331 ms returned sat
[2024-05-22 15:59:52] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-22 15:59:53] [INFO ] Added : 10 causal constraints over 2 iterations in 657 ms. Result :sat
Minimization took 4866 ms.
[2024-05-22 15:59:58] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 15:59:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:58] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-22 15:59:59] [INFO ] [Real]Added 3582 Read/Feed constraints in 264 ms returned sat
[2024-05-22 15:59:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 15:59:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 15:59:59] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2024-05-22 16:00:00] [INFO ] [Nat]Added 3582 Read/Feed constraints in 285 ms returned sat
[2024-05-22 16:00:00] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 185 ms.
[2024-05-22 16:00:00] [INFO ] Added : 4 causal constraints over 1 iterations in 542 ms. Result :sat
Minimization took 4872 ms.
[2024-05-22 16:00:05] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:00:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:06] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-05-22 16:00:06] [INFO ] [Real]Added 3582 Read/Feed constraints in 279 ms returned sat
[2024-05-22 16:00:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:00:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:00:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:07] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2024-05-22 16:00:08] [INFO ] [Nat]Added 3582 Read/Feed constraints in 407 ms returned sat
[2024-05-22 16:00:08] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 187 ms.
[2024-05-22 16:00:08] [INFO ] Added : 10 causal constraints over 2 iterations in 687 ms. Result :sat
Minimization took 4860 ms.
[2024-05-22 16:00:13] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:00:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:14] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-22 16:00:14] [INFO ] [Real]Added 3582 Read/Feed constraints in 268 ms returned sat
[2024-05-22 16:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:00:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:00:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:15] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2024-05-22 16:00:15] [INFO ] [Nat]Added 3582 Read/Feed constraints in 302 ms returned sat
[2024-05-22 16:00:16] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 182 ms.
[2024-05-22 16:00:16] [INFO ] Added : 9 causal constraints over 2 iterations in 661 ms. Result :sat
Minimization took 4839 ms.
[2024-05-22 16:00:21] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:00:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:22] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-22 16:00:22] [INFO ] [Real]Added 3582 Read/Feed constraints in 269 ms returned sat
[2024-05-22 16:00:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:00:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:00:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:00:23] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-22 16:00:23] [INFO ] [Nat]Added 3582 Read/Feed constraints in 310 ms returned sat
[2024-05-22 16:00:23] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 176 ms.
[2024-05-22 16:00:24] [INFO ] Added : 10 causal constraints over 2 iterations in 675 ms. Result :sat
Minimization took 4504 ms.
[2024-05-22 16:00:29] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:00:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:29] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2024-05-22 16:00:29] [INFO ] [Real]Added 3582 Read/Feed constraints in 255 ms returned sat
[2024-05-22 16:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:00:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:00:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:30] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2024-05-22 16:00:31] [INFO ] [Nat]Added 3582 Read/Feed constraints in 274 ms returned sat
[2024-05-22 16:00:31] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 184 ms.
[2024-05-22 16:00:31] [INFO ] Added : 8 causal constraints over 2 iterations in 655 ms. Result :sat
Minimization took 4847 ms.
[2024-05-22 16:00:36] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:00:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:37] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-22 16:00:37] [INFO ] [Real]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-22 16:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:00:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:00:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 16:00:38] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-22 16:00:38] [INFO ] [Nat]Added 3582 Read/Feed constraints in 388 ms returned sat
[2024-05-22 16:00:39] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 189 ms.
[2024-05-22 16:00:39] [INFO ] Added : 9 causal constraints over 2 iterations in 679 ms. Result :sat
Minimization took 4865 ms.
[2024-05-22 16:00:44] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:00:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:45] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2024-05-22 16:00:45] [INFO ] [Real]Added 3582 Read/Feed constraints in 269 ms returned sat
[2024-05-22 16:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:00:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:00:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:00:46] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2024-05-22 16:00:46] [INFO ] [Nat]Added 3582 Read/Feed constraints in 309 ms returned sat
[2024-05-22 16:00:47] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 190 ms.
[2024-05-22 16:00:47] [INFO ] Added : 9 causal constraints over 2 iterations in 682 ms. Result :sat
Minimization took 4873 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 87 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 79 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-22 16:00:52] [INFO ] Invariant cache hit.
[2024-05-22 16:00:53] [INFO ] Implicit Places using invariants in 966 ms returned []
[2024-05-22 16:00:53] [INFO ] Invariant cache hit.
[2024-05-22 16:00:54] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:01:13] [INFO ] Implicit Places using invariants and state equation in 19956 ms returned []
Implicit Place search using SMT with State Equation took 20930 ms to find 0 implicit places.
[2024-05-22 16:01:13] [INFO ] Redundant transitions in 224 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-22 16:01:13] [INFO ] Invariant cache hit.
[2024-05-22 16:01:13] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 32445ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53725 ms. Remains : 1090/1090 places, 3702/3702 transitions.
RANDOM walk for 40000 steps (283 resets) in 2330 ms. (17 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 169528 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 30
Probabilistic random walk after 169528 steps, saw 31474 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-22 16:01:50] [INFO ] Invariant cache hit.
[2024-05-22 16:01:50] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 5 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-22 16:01:50] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 7 ms to minimize.
[2024-05-22 16:01:51] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/50 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/50 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/52 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 0/52 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 3702/4790 variables, 1088/1140 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4790 variables, 3582/4722 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4790 variables, 0/4722 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/4792 variables, 2/4724 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4792/4792 variables, and 4724 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3582/3582 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 16:01:55] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 9/30 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/30 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 58/1086 variables, 29/59 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 0/59 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/1088 variables, 2/61 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-22 16:01:57] [INFO ] Deduced a trap composed of 42 places in 734 ms of which 7 ms to minimize.
[2024-05-22 16:01:58] [INFO ] Deduced a trap composed of 49 places in 696 ms of which 7 ms to minimize.
[2024-05-22 16:01:59] [INFO ] Deduced a trap composed of 37 places in 658 ms of which 6 ms to minimize.
[2024-05-22 16:01:59] [INFO ] Deduced a trap composed of 37 places in 662 ms of which 7 ms to minimize.
[2024-05-22 16:02:00] [INFO ] Deduced a trap composed of 39 places in 618 ms of which 7 ms to minimize.
SMT process timed out in 10292ms, After SMT, problems are : Problem set: 15 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 80 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1090/1090 places, 3702/3702 transitions.
RANDOM walk for 40000 steps (283 resets) in 879 ms. (45 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 161112 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 15
Probabilistic random walk after 161112 steps, saw 30506 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-22 16:02:04] [INFO ] Invariant cache hit.
[2024-05-22 16:02:04] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 58/1086 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/1088 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3702/4790 variables, 1088/1120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4790 variables, 3582/4702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4790 variables, 0/4702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 2/4792 variables, 2/4704 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4792 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/4792 variables, 0/4704 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4792/4792 variables, and 4704 constraints, problems are : Problem set: 0 solved, 15 unsolved in 7468 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1090/1090 constraints, ReadFeed: 3582/3582 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1028 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 16:02:11] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 58/1086 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1086 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/1088 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 16:02:13] [INFO ] Deduced a trap composed of 42 places in 668 ms of which 6 ms to minimize.
[2024-05-22 16:02:13] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1088 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 3702/4790 variables, 1088/1123 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4790 variables, 3582/4705 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4790 variables, 15/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4790 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 52552ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 15 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 108 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 71 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-22 16:02:56] [INFO ] Invariant cache hit.
[2024-05-22 16:02:57] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-05-22 16:02:57] [INFO ] Invariant cache hit.
[2024-05-22 16:02:58] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:03:18] [INFO ] Implicit Places using invariants and state equation in 20851 ms returned []
Implicit Place search using SMT with State Equation took 21828 ms to find 0 implicit places.
[2024-05-22 16:03:18] [INFO ] Redundant transitions in 126 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-22 16:03:18] [INFO ] Invariant cache hit.
[2024-05-22 16:03:18] [INFO ] State equation strengthened by 3582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 32398ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54479 ms. Remains : 1090/1090 places, 3702/3702 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
[2024-05-22 16:03:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 80 ms. (123 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:03:51] [INFO ] Invariant cache hit.
[2024-05-22 16:03:51] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:03:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 16:03:52] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-05-22 16:03:52] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:03:52] [INFO ] [Real]Added 3582 Read/Feed constraints in 259 ms returned sat
[2024-05-22 16:03:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:03:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:03:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:03:53] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2024-05-22 16:03:53] [INFO ] [Nat]Added 3582 Read/Feed constraints in 273 ms returned sat
[2024-05-22 16:03:53] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 241 ms.
[2024-05-22 16:03:54] [INFO ] Added : 5 causal constraints over 1 iterations in 607 ms. Result :sat
Minimization took 1027 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 246 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:03:55] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7153 resets) in 7940 ms. (125 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 935 ms. (1068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:04:04] [INFO ] Invariant cache hit.
[2024-05-22 16:04:04] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:04:04] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:04:05] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-22 16:04:05] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:04:05] [INFO ] [Real]Added 3604 Read/Feed constraints in 251 ms returned sat
[2024-05-22 16:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:04:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:04:05] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:04:06] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2024-05-22 16:04:06] [INFO ] [Nat]Added 3604 Read/Feed constraints in 255 ms returned sat
[2024-05-22 16:04:06] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 186 ms.
[2024-05-22 16:04:07] [INFO ] Added : 5 causal constraints over 1 iterations in 552 ms. Result :sat
Minimization took 4521 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 73 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 67 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:04:11] [INFO ] Invariant cache hit.
[2024-05-22 16:04:12] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-22 16:04:12] [INFO ] Invariant cache hit.
[2024-05-22 16:04:13] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:04:35] [INFO ] Implicit Places using invariants and state equation in 22704 ms returned []
Implicit Place search using SMT with State Equation took 23633 ms to find 0 implicit places.
[2024-05-22 16:04:35] [INFO ] Redundant transitions in 125 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:04:35] [INFO ] Invariant cache hit.
[2024-05-22 16:04:35] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32401ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56273 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (286 resets) in 438 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209086 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209086 steps, saw 35828 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-22 16:05:11] [INFO ] Invariant cache hit.
[2024-05-22 16:05:11] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:05:11] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:05:12] [INFO ] Deduced a trap composed of 43 places in 666 ms of which 7 ms to minimize.
[2024-05-22 16:05:13] [INFO ] Deduced a trap composed of 47 places in 662 ms of which 7 ms to minimize.
[2024-05-22 16:05:13] [INFO ] Deduced a trap composed of 43 places in 631 ms of which 7 ms to minimize.
[2024-05-22 16:05:14] [INFO ] Deduced a trap composed of 42 places in 672 ms of which 7 ms to minimize.
[2024-05-22 16:05:15] [INFO ] Deduced a trap composed of 45 places in 660 ms of which 6 ms to minimize.
[2024-05-22 16:05:15] [INFO ] Deduced a trap composed of 50 places in 643 ms of which 7 ms to minimize.
[2024-05-22 16:05:16] [INFO ] Deduced a trap composed of 41 places in 619 ms of which 6 ms to minimize.
[2024-05-22 16:05:16] [INFO ] Deduced a trap composed of 35 places in 563 ms of which 6 ms to minimize.
SMT process timed out in 5600ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (284 resets) in 487 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 221853 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 221853 steps, saw 37335 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-22 16:05:20] [INFO ] Invariant cache hit.
[2024-05-22 16:05:20] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:05:20] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:05:21] [INFO ] Deduced a trap composed of 43 places in 669 ms of which 7 ms to minimize.
[2024-05-22 16:05:21] [INFO ] Deduced a trap composed of 40 places in 610 ms of which 6 ms to minimize.
[2024-05-22 16:05:22] [INFO ] Deduced a trap composed of 70 places in 666 ms of which 6 ms to minimize.
[2024-05-22 16:05:23] [INFO ] Deduced a trap composed of 39 places in 576 ms of which 6 ms to minimize.
[2024-05-22 16:05:23] [INFO ] Deduced a trap composed of 44 places in 557 ms of which 6 ms to minimize.
[2024-05-22 16:05:24] [INFO ] Deduced a trap composed of 35 places in 562 ms of which 6 ms to minimize.
[2024-05-22 16:05:24] [INFO ] Deduced a trap composed of 47 places in 520 ms of which 5 ms to minimize.
[2024-05-22 16:05:25] [INFO ] Deduced a trap composed of 58 places in 517 ms of which 6 ms to minimize.
[2024-05-22 16:05:25] [INFO ] Deduced a trap composed of 35 places in 503 ms of which 6 ms to minimize.
[2024-05-22 16:05:26] [INFO ] Deduced a trap composed of 41 places in 508 ms of which 6 ms to minimize.
[2024-05-22 16:05:26] [INFO ] Deduced a trap composed of 44 places in 473 ms of which 6 ms to minimize.
[2024-05-22 16:05:27] [INFO ] Deduced a trap composed of 48 places in 488 ms of which 5 ms to minimize.
[2024-05-22 16:05:27] [INFO ] Deduced a trap composed of 48 places in 465 ms of which 6 ms to minimize.
[2024-05-22 16:05:28] [INFO ] Deduced a trap composed of 48 places in 476 ms of which 6 ms to minimize.
[2024-05-22 16:05:28] [INFO ] Deduced a trap composed of 48 places in 480 ms of which 6 ms to minimize.
[2024-05-22 16:05:29] [INFO ] Deduced a trap composed of 44 places in 464 ms of which 6 ms to minimize.
[2024-05-22 16:05:29] [INFO ] Deduced a trap composed of 35 places in 458 ms of which 5 ms to minimize.
[2024-05-22 16:05:30] [INFO ] Deduced a trap composed of 47 places in 439 ms of which 5 ms to minimize.
[2024-05-22 16:05:30] [INFO ] Deduced a trap composed of 47 places in 436 ms of which 5 ms to minimize.
[2024-05-22 16:05:31] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:05:31] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 4 ms to minimize.
[2024-05-22 16:05:32] [INFO ] Deduced a trap composed of 37 places in 431 ms of which 5 ms to minimize.
[2024-05-22 16:05:32] [INFO ] Deduced a trap composed of 37 places in 437 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3694/4774 variables, 1080/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3604/4740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13691 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:05:34] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:05:34] [INFO ] Deduced a trap composed of 44 places in 674 ms of which 7 ms to minimize.
[2024-05-22 16:05:35] [INFO ] Deduced a trap composed of 50 places in 667 ms of which 7 ms to minimize.
[2024-05-22 16:05:36] [INFO ] Deduced a trap composed of 37 places in 641 ms of which 7 ms to minimize.
[2024-05-22 16:05:36] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-22 16:05:36] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3694/4774 variables, 1080/1142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 3604/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4774 variables, 1/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4774 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4776 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4776 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4291 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints]
After SMT, in 18020ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:05:38] [INFO ] Invariant cache hit.
[2024-05-22 16:05:39] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-22 16:05:39] [INFO ] Invariant cache hit.
[2024-05-22 16:05:40] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:06:02] [INFO ] Implicit Places using invariants and state equation in 22878 ms returned []
Implicit Place search using SMT with State Equation took 23798 ms to find 0 implicit places.
[2024-05-22 16:06:02] [INFO ] Redundant transitions in 130 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:06:02] [INFO ] Invariant cache hit.
[2024-05-22 16:06:02] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32359ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56395 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 4 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 25 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:06:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 16:06:34] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:06:34] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:06:34] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:06:34] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 86 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-00 in 163642 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:06:34] [INFO ] Computed 32 invariants in 58 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 80 ms. (123 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:06:35] [INFO ] Invariant cache hit.
[2024-05-22 16:06:35] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:06:35] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:06:35] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-05-22 16:06:35] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:06:36] [INFO ] [Real]Added 3582 Read/Feed constraints in 256 ms returned sat
[2024-05-22 16:06:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:06:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-05-22 16:06:37] [INFO ] [Nat]Added 3582 Read/Feed constraints in 291 ms returned sat
[2024-05-22 16:06:37] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 182 ms.
[2024-05-22 16:06:38] [INFO ] Added : 6 causal constraints over 2 iterations in 666 ms. Result :sat
Minimization took 1021 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 269 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:06:39] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7142 resets) in 7893 ms. (126 steps per ms)
BEST_FIRST walk for 1000000 steps (200 resets) in 978 ms. (1021 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:06:48] [INFO ] Invariant cache hit.
[2024-05-22 16:06:48] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:06:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:06:49] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-22 16:06:49] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:06:49] [INFO ] [Real]Added 3604 Read/Feed constraints in 277 ms returned sat
[2024-05-22 16:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:06:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:06:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-22 16:06:50] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2024-05-22 16:06:50] [INFO ] [Nat]Added 3604 Read/Feed constraints in 295 ms returned sat
[2024-05-22 16:06:50] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 189 ms.
[2024-05-22 16:06:51] [INFO ] Added : 7 causal constraints over 2 iterations in 687 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 77 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:06:55] [INFO ] Invariant cache hit.
[2024-05-22 16:06:56] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-22 16:06:56] [INFO ] Invariant cache hit.
[2024-05-22 16:06:57] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:07:20] [INFO ] Implicit Places using invariants and state equation in 23264 ms returned []
Implicit Place search using SMT with State Equation took 24240 ms to find 0 implicit places.
[2024-05-22 16:07:20] [INFO ] Redundant transitions in 127 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:07:20] [INFO ] Invariant cache hit.
[2024-05-22 16:07:20] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32452ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56932 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 452 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 204949 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 204949 steps, saw 35313 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-22 16:07:56] [INFO ] Invariant cache hit.
[2024-05-22 16:07:56] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:07:56] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:07:57] [INFO ] Deduced a trap composed of 39 places in 676 ms of which 7 ms to minimize.
[2024-05-22 16:07:57] [INFO ] Deduced a trap composed of 40 places in 613 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3093 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:07:59] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:08:00] [INFO ] Deduced a trap composed of 37 places in 672 ms of which 7 ms to minimize.
[2024-05-22 16:08:00] [INFO ] Deduced a trap composed of 49 places in 637 ms of which 7 ms to minimize.
[2024-05-22 16:08:00] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3694/4774 variables, 1080/1119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4774/4776 variables, and 4723 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3423 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1080/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6557ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 74 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (283 resets) in 486 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226339 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 226339 steps, saw 37856 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-22 16:08:05] [INFO ] Invariant cache hit.
[2024-05-22 16:08:05] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:06] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:06] [INFO ] Deduced a trap composed of 38 places in 653 ms of which 7 ms to minimize.
[2024-05-22 16:08:06] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2354 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:08] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:09] [INFO ] Deduced a trap composed of 37 places in 651 ms of which 7 ms to minimize.
[2024-05-22 16:08:09] [INFO ] Deduced a trap composed of 49 places in 632 ms of which 7 ms to minimize.
[2024-05-22 16:08:10] [INFO ] Deduced a trap composed of 49 places in 629 ms of which 6 ms to minimize.
[2024-05-22 16:08:11] [INFO ] Deduced a trap composed of 36 places in 585 ms of which 7 ms to minimize.
[2024-05-22 16:08:11] [INFO ] Deduced a trap composed of 43 places in 593 ms of which 6 ms to minimize.
[2024-05-22 16:08:12] [INFO ] Deduced a trap composed of 36 places in 582 ms of which 6 ms to minimize.
[2024-05-22 16:08:12] [INFO ] Deduced a trap composed of 37 places in 591 ms of which 7 ms to minimize.
[2024-05-22 16:08:13] [INFO ] Deduced a trap composed of 36 places in 595 ms of which 7 ms to minimize.
[2024-05-22 16:08:14] [INFO ] Deduced a trap composed of 35 places in 585 ms of which 6 ms to minimize.
[2024-05-22 16:08:14] [INFO ] Deduced a trap composed of 38 places in 598 ms of which 7 ms to minimize.
[2024-05-22 16:08:15] [INFO ] Deduced a trap composed of 36 places in 583 ms of which 6 ms to minimize.
[2024-05-22 16:08:15] [INFO ] Deduced a trap composed of 36 places in 567 ms of which 7 ms to minimize.
[2024-05-22 16:08:16] [INFO ] Deduced a trap composed of 36 places in 568 ms of which 6 ms to minimize.
[2024-05-22 16:08:17] [INFO ] Deduced a trap composed of 36 places in 577 ms of which 5 ms to minimize.
[2024-05-22 16:08:17] [INFO ] Deduced a trap composed of 35 places in 566 ms of which 6 ms to minimize.
[2024-05-22 16:08:18] [INFO ] Deduced a trap composed of 40 places in 557 ms of which 9 ms to minimize.
[2024-05-22 16:08:18] [INFO ] Deduced a trap composed of 41 places in 555 ms of which 6 ms to minimize.
[2024-05-22 16:08:19] [INFO ] Deduced a trap composed of 43 places in 521 ms of which 6 ms to minimize.
[2024-05-22 16:08:19] [INFO ] Deduced a trap composed of 48 places in 518 ms of which 6 ms to minimize.
[2024-05-22 16:08:20] [INFO ] Deduced a trap composed of 38 places in 482 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:20] [INFO ] Deduced a trap composed of 46 places in 489 ms of which 6 ms to minimize.
[2024-05-22 16:08:21] [INFO ] Deduced a trap composed of 38 places in 483 ms of which 6 ms to minimize.
[2024-05-22 16:08:21] [INFO ] Deduced a trap composed of 43 places in 457 ms of which 6 ms to minimize.
[2024-05-22 16:08:22] [INFO ] Deduced a trap composed of 41 places in 469 ms of which 5 ms to minimize.
[2024-05-22 16:08:22] [INFO ] Deduced a trap composed of 44 places in 468 ms of which 6 ms to minimize.
[2024-05-22 16:08:23] [INFO ] Deduced a trap composed of 36 places in 420 ms of which 5 ms to minimize.
[2024-05-22 16:08:23] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 5 ms to minimize.
[2024-05-22 16:08:24] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 5 ms to minimize.
[2024-05-22 16:08:24] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 5 ms to minimize.
[2024-05-22 16:08:25] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 5 ms to minimize.
[2024-05-22 16:08:25] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 5 ms to minimize.
[2024-05-22 16:08:25] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 5 ms to minimize.
[2024-05-22 16:08:26] [INFO ] Deduced a trap composed of 44 places in 434 ms of which 5 ms to minimize.
[2024-05-22 16:08:26] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 5 ms to minimize.
[2024-05-22 16:08:27] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 5 ms to minimize.
[2024-05-22 16:08:27] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 5 ms to minimize.
[2024-05-22 16:08:28] [INFO ] Deduced a trap composed of 38 places in 408 ms of which 5 ms to minimize.
[2024-05-22 16:08:28] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 5 ms to minimize.
[2024-05-22 16:08:29] [INFO ] Deduced a trap composed of 40 places in 455 ms of which 5 ms to minimize.
[2024-05-22 16:08:29] [INFO ] Deduced a trap composed of 51 places in 452 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:29] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 5 ms to minimize.
[2024-05-22 16:08:30] [INFO ] Deduced a trap composed of 49 places in 430 ms of which 5 ms to minimize.
[2024-05-22 16:08:30] [INFO ] Deduced a trap composed of 37 places in 411 ms of which 5 ms to minimize.
[2024-05-22 16:08:31] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 4 ms to minimize.
[2024-05-22 16:08:31] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 4 ms to minimize.
[2024-05-22 16:08:31] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 4 ms to minimize.
[2024-05-22 16:08:32] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 4 ms to minimize.
[2024-05-22 16:08:32] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 4 ms to minimize.
[2024-05-22 16:08:32] [INFO ] Deduced a trap composed of 41 places in 335 ms of which 4 ms to minimize.
[2024-05-22 16:08:33] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 4 ms to minimize.
[2024-05-22 16:08:33] [INFO ] Deduced a trap composed of 42 places in 336 ms of which 4 ms to minimize.
[2024-05-22 16:08:33] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 4 ms to minimize.
[2024-05-22 16:08:34] [INFO ] Deduced a trap composed of 46 places in 320 ms of which 4 ms to minimize.
[2024-05-22 16:08:34] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 4 ms to minimize.
[2024-05-22 16:08:35] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 5 ms to minimize.
[2024-05-22 16:08:35] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 6 ms to minimize.
[2024-05-22 16:08:35] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 4 ms to minimize.
[2024-05-22 16:08:35] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 4 ms to minimize.
[2024-05-22 16:08:36] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 3 ms to minimize.
[2024-05-22 16:08:36] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:36] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 4 ms to minimize.
[2024-05-22 16:08:37] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 4 ms to minimize.
[2024-05-22 16:08:37] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 3 ms to minimize.
[2024-05-22 16:08:37] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 3 ms to minimize.
[2024-05-22 16:08:37] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-05-22 16:08:38] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:08:38] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:08:38] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-22 16:08:38] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-05-22 16:08:38] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:08:39] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:08:39] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:08:39] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 3 ms to minimize.
[2024-05-22 16:08:39] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:08:39] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-05-22 16:08:40] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-05-22 16:08:40] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:08:40] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-05-22 16:08:40] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:08:40] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:41] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:08:41] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:08:41] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:08:41] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:08:41] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-22 16:08:41] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-22 16:08:42] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:08:42] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:08:42] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-22 16:08:42] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:08:42] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:08:42] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:08:43] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-05-22 16:08:43] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-05-22 16:08:43] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-05-22 16:08:43] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-22 16:08:43] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-22 16:08:43] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-22 16:08:44] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2024-05-22 16:08:44] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:08:44] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:08:44] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:08:44] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:08:44] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-22 16:08:45] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:08:45] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-22 16:08:45] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:08:45] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2024-05-22 16:08:45] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4832 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40631 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 113/113 constraints]
After SMT, in 43035ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 72 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 72 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:08:49] [INFO ] Invariant cache hit.
[2024-05-22 16:08:49] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-22 16:08:49] [INFO ] Invariant cache hit.
[2024-05-22 16:08:50] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:09:14] [INFO ] Implicit Places using invariants and state equation in 24923 ms returned []
Implicit Place search using SMT with State Equation took 25887 ms to find 0 implicit places.
[2024-05-22 16:09:15] [INFO ] Redundant transitions in 136 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:09:15] [INFO ] Invariant cache hit.
[2024-05-22 16:09:15] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32467ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32498ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58606 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-01 in 192719 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:09:47] [INFO ] Computed 32 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (72 resets) in 81 ms. (121 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:09:47] [INFO ] Invariant cache hit.
[2024-05-22 16:09:47] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:09:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:09:48] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2024-05-22 16:09:48] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:09:48] [INFO ] [Real]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-22 16:09:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:09:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:09:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:09:49] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-22 16:09:50] [INFO ] [Nat]Added 3582 Read/Feed constraints in 287 ms returned sat
[2024-05-22 16:09:50] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 183 ms.
[2024-05-22 16:09:50] [INFO ] Added : 6 causal constraints over 2 iterations in 681 ms. Result :sat
Minimization took 992 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 260 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:09:52] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7151 resets) in 8226 ms. (121 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 975 ms. (1024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:10:01] [INFO ] Invariant cache hit.
[2024-05-22 16:10:01] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:10:01] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:10:02] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-05-22 16:10:02] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:10:02] [INFO ] [Real]Added 3604 Read/Feed constraints in 265 ms returned sat
[2024-05-22 16:10:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:10:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:10:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:10:03] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-05-22 16:10:03] [INFO ] [Nat]Added 3604 Read/Feed constraints in 283 ms returned sat
[2024-05-22 16:10:03] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 182 ms.
[2024-05-22 16:10:04] [INFO ] Added : 5 causal constraints over 1 iterations in 548 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 78 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:10:08] [INFO ] Invariant cache hit.
[2024-05-22 16:10:09] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-22 16:10:09] [INFO ] Invariant cache hit.
[2024-05-22 16:10:10] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:10:32] [INFO ] Implicit Places using invariants and state equation in 22662 ms returned []
Implicit Place search using SMT with State Equation took 23591 ms to find 0 implicit places.
[2024-05-22 16:10:32] [INFO ] Redundant transitions in 133 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:10:32] [INFO ] Invariant cache hit.
[2024-05-22 16:10:32] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32499ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56342 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (283 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 208638 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 208638 steps, saw 35765 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-22 16:11:08] [INFO ] Invariant cache hit.
[2024-05-22 16:11:08] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:08] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:11:09] [INFO ] Deduced a trap composed of 47 places in 664 ms of which 9 ms to minimize.
[2024-05-22 16:11:09] [INFO ] Deduced a trap composed of 43 places in 615 ms of which 6 ms to minimize.
[2024-05-22 16:11:10] [INFO ] Deduced a trap composed of 43 places in 645 ms of which 6 ms to minimize.
[2024-05-22 16:11:11] [INFO ] Deduced a trap composed of 43 places in 629 ms of which 6 ms to minimize.
[2024-05-22 16:11:11] [INFO ] Deduced a trap composed of 46 places in 600 ms of which 6 ms to minimize.
[2024-05-22 16:11:12] [INFO ] Deduced a trap composed of 41 places in 573 ms of which 6 ms to minimize.
[2024-05-22 16:11:13] [INFO ] Deduced a trap composed of 45 places in 550 ms of which 6 ms to minimize.
[2024-05-22 16:11:13] [INFO ] Deduced a trap composed of 47 places in 546 ms of which 6 ms to minimize.
SMT process timed out in 5300ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 79 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (282 resets) in 414 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226228 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 226228 steps, saw 37844 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-22 16:11:16] [INFO ] Invariant cache hit.
[2024-05-22 16:11:16] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:17] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:17] [INFO ] Deduced a trap composed of 38 places in 619 ms of which 7 ms to minimize.
[2024-05-22 16:11:17] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:19] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:20] [INFO ] Deduced a trap composed of 36 places in 667 ms of which 6 ms to minimize.
[2024-05-22 16:11:20] [INFO ] Deduced a trap composed of 72 places in 647 ms of which 7 ms to minimize.
[2024-05-22 16:11:21] [INFO ] Deduced a trap composed of 38 places in 571 ms of which 6 ms to minimize.
[2024-05-22 16:11:22] [INFO ] Deduced a trap composed of 38 places in 578 ms of which 6 ms to minimize.
[2024-05-22 16:11:22] [INFO ] Deduced a trap composed of 38 places in 495 ms of which 6 ms to minimize.
[2024-05-22 16:11:23] [INFO ] Deduced a trap composed of 38 places in 530 ms of which 6 ms to minimize.
[2024-05-22 16:11:23] [INFO ] Deduced a trap composed of 39 places in 531 ms of which 6 ms to minimize.
[2024-05-22 16:11:24] [INFO ] Deduced a trap composed of 36 places in 534 ms of which 6 ms to minimize.
[2024-05-22 16:11:24] [INFO ] Deduced a trap composed of 37 places in 481 ms of which 6 ms to minimize.
[2024-05-22 16:11:25] [INFO ] Deduced a trap composed of 39 places in 527 ms of which 6 ms to minimize.
[2024-05-22 16:11:25] [INFO ] Deduced a trap composed of 44 places in 550 ms of which 6 ms to minimize.
[2024-05-22 16:11:26] [INFO ] Deduced a trap composed of 48 places in 526 ms of which 6 ms to minimize.
[2024-05-22 16:11:26] [INFO ] Deduced a trap composed of 47 places in 521 ms of which 6 ms to minimize.
[2024-05-22 16:11:27] [INFO ] Deduced a trap composed of 41 places in 521 ms of which 5 ms to minimize.
[2024-05-22 16:11:27] [INFO ] Deduced a trap composed of 41 places in 488 ms of which 6 ms to minimize.
[2024-05-22 16:11:28] [INFO ] Deduced a trap composed of 54 places in 518 ms of which 6 ms to minimize.
[2024-05-22 16:11:28] [INFO ] Deduced a trap composed of 41 places in 509 ms of which 5 ms to minimize.
[2024-05-22 16:11:29] [INFO ] Deduced a trap composed of 49 places in 481 ms of which 6 ms to minimize.
[2024-05-22 16:11:29] [INFO ] Deduced a trap composed of 42 places in 482 ms of which 5 ms to minimize.
[2024-05-22 16:11:30] [INFO ] Deduced a trap composed of 38 places in 467 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:30] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 5 ms to minimize.
[2024-05-22 16:11:31] [INFO ] Deduced a trap composed of 45 places in 455 ms of which 6 ms to minimize.
[2024-05-22 16:11:31] [INFO ] Deduced a trap composed of 39 places in 424 ms of which 6 ms to minimize.
[2024-05-22 16:11:32] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 4 ms to minimize.
[2024-05-22 16:11:32] [INFO ] Deduced a trap composed of 42 places in 363 ms of which 5 ms to minimize.
[2024-05-22 16:11:33] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 4 ms to minimize.
[2024-05-22 16:11:33] [INFO ] Deduced a trap composed of 38 places in 361 ms of which 5 ms to minimize.
[2024-05-22 16:11:33] [INFO ] Deduced a trap composed of 37 places in 368 ms of which 4 ms to minimize.
[2024-05-22 16:11:34] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 5 ms to minimize.
[2024-05-22 16:11:34] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 4 ms to minimize.
[2024-05-22 16:11:34] [INFO ] Deduced a trap composed of 37 places in 353 ms of which 5 ms to minimize.
[2024-05-22 16:11:35] [INFO ] Deduced a trap composed of 35 places in 347 ms of which 4 ms to minimize.
[2024-05-22 16:11:35] [INFO ] Deduced a trap composed of 37 places in 371 ms of which 4 ms to minimize.
[2024-05-22 16:11:36] [INFO ] Deduced a trap composed of 37 places in 393 ms of which 4 ms to minimize.
[2024-05-22 16:11:36] [INFO ] Deduced a trap composed of 36 places in 368 ms of which 5 ms to minimize.
[2024-05-22 16:11:36] [INFO ] Deduced a trap composed of 37 places in 363 ms of which 5 ms to minimize.
[2024-05-22 16:11:37] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 4 ms to minimize.
[2024-05-22 16:11:37] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 4 ms to minimize.
[2024-05-22 16:11:37] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 4 ms to minimize.
[2024-05-22 16:11:38] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:38] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 4 ms to minimize.
[2024-05-22 16:11:39] [INFO ] Deduced a trap composed of 36 places in 365 ms of which 4 ms to minimize.
[2024-05-22 16:11:39] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 5 ms to minimize.
[2024-05-22 16:11:39] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 4 ms to minimize.
[2024-05-22 16:11:40] [INFO ] Deduced a trap composed of 39 places in 364 ms of which 5 ms to minimize.
[2024-05-22 16:11:40] [INFO ] Deduced a trap composed of 39 places in 371 ms of which 4 ms to minimize.
[2024-05-22 16:11:40] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 6 ms to minimize.
[2024-05-22 16:11:41] [INFO ] Deduced a trap composed of 40 places in 379 ms of which 4 ms to minimize.
[2024-05-22 16:11:41] [INFO ] Deduced a trap composed of 45 places in 341 ms of which 5 ms to minimize.
[2024-05-22 16:11:41] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 4 ms to minimize.
[2024-05-22 16:11:42] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 5 ms to minimize.
[2024-05-22 16:11:42] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 4 ms to minimize.
[2024-05-22 16:11:43] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 4 ms to minimize.
[2024-05-22 16:11:43] [INFO ] Deduced a trap composed of 40 places in 338 ms of which 4 ms to minimize.
[2024-05-22 16:11:43] [INFO ] Deduced a trap composed of 43 places in 329 ms of which 4 ms to minimize.
[2024-05-22 16:11:44] [INFO ] Deduced a trap composed of 43 places in 332 ms of which 4 ms to minimize.
[2024-05-22 16:11:44] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 4 ms to minimize.
[2024-05-22 16:11:44] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 4 ms to minimize.
[2024-05-22 16:11:45] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 4 ms to minimize.
[2024-05-22 16:11:45] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:45] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 3 ms to minimize.
[2024-05-22 16:11:45] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 4 ms to minimize.
[2024-05-22 16:11:46] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 4 ms to minimize.
[2024-05-22 16:11:46] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2024-05-22 16:11:46] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:11:46] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 3 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 3 ms to minimize.
[2024-05-22 16:11:48] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-05-22 16:11:48] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-22 16:11:48] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-05-22 16:11:48] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-05-22 16:11:49] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:11:49] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:11:49] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:11:49] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:11:49] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:49] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:11:50] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:11:50] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:11:50] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:11:50] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:11:50] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-22 16:11:51] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:53] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-05-22 16:11:53] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2024-05-22 16:11:53] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4826 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39034 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 107/107 constraints]
After SMT, in 41469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 209 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 69 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:11:58] [INFO ] Invariant cache hit.
[2024-05-22 16:11:59] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-05-22 16:11:59] [INFO ] Invariant cache hit.
[2024-05-22 16:12:00] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:12:21] [INFO ] Implicit Places using invariants and state equation in 22332 ms returned []
Implicit Place search using SMT with State Equation took 23267 ms to find 0 implicit places.
[2024-05-22 16:12:22] [INFO ] Redundant transitions in 128 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:12:22] [INFO ] Invariant cache hit.
[2024-05-22 16:12:22] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)timeout
(s253 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32280ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32311ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55788 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-02 in 186796 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:12:54] [INFO ] Computed 32 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 84 ms. (117 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:12:54] [INFO ] Invariant cache hit.
[2024-05-22 16:12:54] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:12:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:12:55] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2024-05-22 16:12:55] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:12:55] [INFO ] [Real]Added 3582 Read/Feed constraints in 279 ms returned sat
[2024-05-22 16:12:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:12:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:12:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 16:12:56] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-05-22 16:12:56] [INFO ] [Nat]Added 3582 Read/Feed constraints in 336 ms returned sat
[2024-05-22 16:12:57] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 179 ms.
[2024-05-22 16:12:57] [INFO ] Added : 8 causal constraints over 2 iterations in 685 ms. Result :sat
Minimization took 1000 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 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 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 257 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:12:58] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7141 resets) in 8089 ms. (123 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 1029 ms. (970 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:13:08] [INFO ] Invariant cache hit.
[2024-05-22 16:13:08] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:13:08] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:13:08] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-05-22 16:13:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:13:09] [INFO ] [Real]Added 3603 Read/Feed constraints in 280 ms returned sat
[2024-05-22 16:13:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:13:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:13:09] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:13:10] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-05-22 16:13:10] [INFO ] [Nat]Added 3603 Read/Feed constraints in 350 ms returned sat
[2024-05-22 16:13:10] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 180 ms.
[2024-05-22 16:13:11] [INFO ] Added : 10 causal constraints over 2 iterations in 674 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 75 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:13:15] [INFO ] Invariant cache hit.
[2024-05-22 16:13:16] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-22 16:13:16] [INFO ] Invariant cache hit.
[2024-05-22 16:13:17] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:13:39] [INFO ] Implicit Places using invariants and state equation in 22790 ms returned []
Implicit Place search using SMT with State Equation took 23731 ms to find 0 implicit places.
[2024-05-22 16:13:39] [INFO ] Redundant transitions in 132 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:13:39] [INFO ] Invariant cache hit.
[2024-05-22 16:13:39] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32491ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56475 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 438 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 208090 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 208090 steps, saw 35689 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-22 16:14:15] [INFO ] Invariant cache hit.
[2024-05-22 16:14:15] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:14:15] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:14:16] [INFO ] Deduced a trap composed of 52 places in 671 ms of which 7 ms to minimize.
[2024-05-22 16:14:17] [INFO ] Deduced a trap composed of 37 places in 631 ms of which 7 ms to minimize.
[2024-05-22 16:14:17] [INFO ] Deduced a trap composed of 40 places in 623 ms of which 7 ms to minimize.
[2024-05-22 16:14:18] [INFO ] Deduced a trap composed of 42 places in 611 ms of which 6 ms to minimize.
[2024-05-22 16:14:18] [INFO ] Deduced a trap composed of 42 places in 553 ms of which 6 ms to minimize.
[2024-05-22 16:14:19] [INFO ] Deduced a trap composed of 39 places in 563 ms of which 6 ms to minimize.
[2024-05-22 16:14:20] [INFO ] Deduced a trap composed of 37 places in 543 ms of which 6 ms to minimize.
[2024-05-22 16:14:20] [INFO ] Deduced a trap composed of 47 places in 500 ms of which 6 ms to minimize.
SMT process timed out in 5193ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 77 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (286 resets) in 743 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 227280 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 227280 steps, saw 37982 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-22 16:14:23] [INFO ] Invariant cache hit.
[2024-05-22 16:14:23] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:14:24] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:14:24] [INFO ] Deduced a trap composed of 38 places in 674 ms of which 7 ms to minimize.
[2024-05-22 16:14:25] [INFO ] Deduced a trap composed of 39 places in 687 ms of which 7 ms to minimize.
[2024-05-22 16:14:26] [INFO ] Deduced a trap composed of 38 places in 656 ms of which 6 ms to minimize.
[2024-05-22 16:14:27] [INFO ] Deduced a trap composed of 36 places in 658 ms of which 6 ms to minimize.
[2024-05-22 16:14:27] [INFO ] Deduced a trap composed of 47 places in 615 ms of which 7 ms to minimize.
[2024-05-22 16:14:28] [INFO ] Deduced a trap composed of 44 places in 616 ms of which 6 ms to minimize.
[2024-05-22 16:14:28] [INFO ] Deduced a trap composed of 40 places in 609 ms of which 7 ms to minimize.
[2024-05-22 16:14:29] [INFO ] Deduced a trap composed of 39 places in 621 ms of which 6 ms to minimize.
[2024-05-22 16:14:30] [INFO ] Deduced a trap composed of 41 places in 608 ms of which 6 ms to minimize.
[2024-05-22 16:14:30] [INFO ] Deduced a trap composed of 43 places in 607 ms of which 6 ms to minimize.
[2024-05-22 16:14:31] [INFO ] Deduced a trap composed of 39 places in 556 ms of which 6 ms to minimize.
[2024-05-22 16:14:31] [INFO ] Deduced a trap composed of 43 places in 529 ms of which 6 ms to minimize.
[2024-05-22 16:14:32] [INFO ] Deduced a trap composed of 43 places in 538 ms of which 6 ms to minimize.
[2024-05-22 16:14:33] [INFO ] Deduced a trap composed of 41 places in 518 ms of which 6 ms to minimize.
[2024-05-22 16:14:33] [INFO ] Deduced a trap composed of 42 places in 540 ms of which 6 ms to minimize.
[2024-05-22 16:14:34] [INFO ] Deduced a trap composed of 40 places in 533 ms of which 5 ms to minimize.
[2024-05-22 16:14:34] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 6 ms to minimize.
[2024-05-22 16:14:35] [INFO ] Deduced a trap composed of 37 places in 456 ms of which 6 ms to minimize.
[2024-05-22 16:14:35] [INFO ] Deduced a trap composed of 36 places in 465 ms of which 5 ms to minimize.
[2024-05-22 16:14:36] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:14:36] [INFO ] Deduced a trap composed of 46 places in 441 ms of which 5 ms to minimize.
[2024-05-22 16:14:36] [INFO ] Deduced a trap composed of 35 places in 384 ms of which 4 ms to minimize.
[2024-05-22 16:14:37] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 5 ms to minimize.
[2024-05-22 16:14:37] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 4 ms to minimize.
[2024-05-22 16:14:37] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 5 ms to minimize.
[2024-05-22 16:14:38] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 4 ms to minimize.
[2024-05-22 16:14:38] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 4 ms to minimize.
[2024-05-22 16:14:38] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 4 ms to minimize.
[2024-05-22 16:14:39] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 4 ms to minimize.
[2024-05-22 16:14:39] [INFO ] Deduced a trap composed of 43 places in 303 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17170 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:14:41] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:14:42] [INFO ] Deduced a trap composed of 48 places in 667 ms of which 6 ms to minimize.
[2024-05-22 16:14:42] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-22 16:14:42] [INFO ] Deduced a trap composed of 41 places in 615 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3743 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
After SMT, in 20964ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:14:45] [INFO ] Invariant cache hit.
[2024-05-22 16:14:46] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-22 16:14:46] [INFO ] Invariant cache hit.
[2024-05-22 16:14:46] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:15:08] [INFO ] Implicit Places using invariants and state equation in 22520 ms returned []
Implicit Place search using SMT with State Equation took 23496 ms to find 0 implicit places.
[2024-05-22 16:15:08] [INFO ] Redundant transitions in 127 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:15:08] [INFO ] Invariant cache hit.
[2024-05-22 16:15:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32354ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56091 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 9 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:15:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 16:15:41] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:15:41] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:15:41] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:15:41] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 53 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-03 in 166812 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:15:41] [INFO ] Computed 32 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 89 ms. (111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:15:41] [INFO ] Invariant cache hit.
[2024-05-22 16:15:41] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:15:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:15:42] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-22 16:15:42] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:15:42] [INFO ] [Real]Added 3582 Read/Feed constraints in 275 ms returned sat
[2024-05-22 16:15:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:15:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:15:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:15:43] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2024-05-22 16:15:43] [INFO ] [Nat]Added 3582 Read/Feed constraints in 330 ms returned sat
[2024-05-22 16:15:43] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 186 ms.
[2024-05-22 16:15:44] [INFO ] Added : 13 causal constraints over 3 iterations in 796 ms. Result :sat
Minimization took 989 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 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 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 265 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:15:45] [INFO ] Computed 32 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7147 resets) in 7949 ms. (125 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 941 ms. (1061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:15:54] [INFO ] Invariant cache hit.
[2024-05-22 16:15:54] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:15:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:15:55] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-22 16:15:55] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:15:55] [INFO ] [Real]Added 3603 Read/Feed constraints in 273 ms returned sat
[2024-05-22 16:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:15:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:15:56] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:15:56] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-22 16:15:57] [INFO ] [Nat]Added 3603 Read/Feed constraints in 287 ms returned sat
[2024-05-22 16:15:57] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 243 ms.
[2024-05-22 16:15:57] [INFO ] Added : 7 causal constraints over 2 iterations in 738 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 75 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:16:02] [INFO ] Invariant cache hit.
[2024-05-22 16:16:03] [INFO ] Implicit Places using invariants in 930 ms returned []
[2024-05-22 16:16:03] [INFO ] Invariant cache hit.
[2024-05-22 16:16:04] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:16:29] [INFO ] Implicit Places using invariants and state equation in 25872 ms returned []
Implicit Place search using SMT with State Equation took 26802 ms to find 0 implicit places.
[2024-05-22 16:16:29] [INFO ] Redundant transitions in 134 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:16:29] [INFO ] Invariant cache hit.
[2024-05-22 16:16:29] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32306ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59356 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 434 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 201781 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 201781 steps, saw 34926 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-22 16:17:04] [INFO ] Invariant cache hit.
[2024-05-22 16:17:05] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 52 places in 669 ms of which 6 ms to minimize.
[2024-05-22 16:17:06] [INFO ] Deduced a trap composed of 37 places in 626 ms of which 6 ms to minimize.
[2024-05-22 16:17:07] [INFO ] Deduced a trap composed of 40 places in 629 ms of which 7 ms to minimize.
[2024-05-22 16:17:07] [INFO ] Deduced a trap composed of 36 places in 599 ms of which 7 ms to minimize.
[2024-05-22 16:17:08] [INFO ] Deduced a trap composed of 35 places in 600 ms of which 6 ms to minimize.
[2024-05-22 16:17:09] [INFO ] Deduced a trap composed of 37 places in 569 ms of which 6 ms to minimize.
[2024-05-22 16:17:09] [INFO ] Deduced a trap composed of 37 places in 573 ms of which 6 ms to minimize.
[2024-05-22 16:17:10] [INFO ] Deduced a trap composed of 42 places in 538 ms of which 5 ms to minimize.
SMT process timed out in 5286ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 72 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (286 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 237338 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 237338 steps, saw 39165 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-22 16:17:13] [INFO ] Invariant cache hit.
[2024-05-22 16:17:13] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:13] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:14] [INFO ] Deduced a trap composed of 38 places in 644 ms of which 6 ms to minimize.
[2024-05-22 16:17:15] [INFO ] Deduced a trap composed of 39 places in 628 ms of which 6 ms to minimize.
[2024-05-22 16:17:15] [INFO ] Deduced a trap composed of 38 places in 633 ms of which 7 ms to minimize.
[2024-05-22 16:17:16] [INFO ] Deduced a trap composed of 36 places in 618 ms of which 6 ms to minimize.
[2024-05-22 16:17:17] [INFO ] Deduced a trap composed of 47 places in 565 ms of which 6 ms to minimize.
[2024-05-22 16:17:17] [INFO ] Deduced a trap composed of 44 places in 591 ms of which 6 ms to minimize.
[2024-05-22 16:17:18] [INFO ] Deduced a trap composed of 44 places in 581 ms of which 7 ms to minimize.
[2024-05-22 16:17:18] [INFO ] Deduced a trap composed of 44 places in 575 ms of which 6 ms to minimize.
[2024-05-22 16:17:19] [INFO ] Deduced a trap composed of 38 places in 580 ms of which 6 ms to minimize.
[2024-05-22 16:17:20] [INFO ] Deduced a trap composed of 40 places in 579 ms of which 6 ms to minimize.
[2024-05-22 16:17:20] [INFO ] Deduced a trap composed of 39 places in 551 ms of which 6 ms to minimize.
[2024-05-22 16:17:21] [INFO ] Deduced a trap composed of 47 places in 535 ms of which 5 ms to minimize.
[2024-05-22 16:17:21] [INFO ] Deduced a trap composed of 35 places in 514 ms of which 5 ms to minimize.
[2024-05-22 16:17:22] [INFO ] Deduced a trap composed of 48 places in 489 ms of which 5 ms to minimize.
[2024-05-22 16:17:22] [INFO ] Deduced a trap composed of 44 places in 505 ms of which 6 ms to minimize.
[2024-05-22 16:17:23] [INFO ] Deduced a trap composed of 43 places in 494 ms of which 6 ms to minimize.
[2024-05-22 16:17:23] [INFO ] Deduced a trap composed of 48 places in 483 ms of which 6 ms to minimize.
[2024-05-22 16:17:24] [INFO ] Deduced a trap composed of 47 places in 470 ms of which 5 ms to minimize.
[2024-05-22 16:17:24] [INFO ] Deduced a trap composed of 46 places in 489 ms of which 5 ms to minimize.
[2024-05-22 16:17:25] [INFO ] Deduced a trap composed of 47 places in 467 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:25] [INFO ] Deduced a trap composed of 46 places in 459 ms of which 5 ms to minimize.
[2024-05-22 16:17:26] [INFO ] Deduced a trap composed of 46 places in 462 ms of which 5 ms to minimize.
[2024-05-22 16:17:26] [INFO ] Deduced a trap composed of 45 places in 448 ms of which 5 ms to minimize.
[2024-05-22 16:17:27] [INFO ] Deduced a trap composed of 48 places in 434 ms of which 5 ms to minimize.
[2024-05-22 16:17:27] [INFO ] Deduced a trap composed of 48 places in 455 ms of which 5 ms to minimize.
[2024-05-22 16:17:28] [INFO ] Deduced a trap composed of 46 places in 410 ms of which 5 ms to minimize.
[2024-05-22 16:17:28] [INFO ] Deduced a trap composed of 45 places in 430 ms of which 5 ms to minimize.
[2024-05-22 16:17:28] [INFO ] Deduced a trap composed of 48 places in 437 ms of which 5 ms to minimize.
[2024-05-22 16:17:29] [INFO ] Deduced a trap composed of 45 places in 413 ms of which 5 ms to minimize.
[2024-05-22 16:17:29] [INFO ] Deduced a trap composed of 46 places in 400 ms of which 5 ms to minimize.
[2024-05-22 16:17:30] [INFO ] Deduced a trap composed of 50 places in 400 ms of which 5 ms to minimize.
[2024-05-22 16:17:30] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 5 ms to minimize.
[2024-05-22 16:17:31] [INFO ] Deduced a trap composed of 44 places in 389 ms of which 4 ms to minimize.
[2024-05-22 16:17:31] [INFO ] Deduced a trap composed of 47 places in 400 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19098 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:32] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:33] [INFO ] Deduced a trap composed of 64 places in 604 ms of which 6 ms to minimize.
[2024-05-22 16:17:33] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4757 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3399 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints]
After SMT, in 22535ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:17:36] [INFO ] Invariant cache hit.
[2024-05-22 16:17:37] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-22 16:17:37] [INFO ] Invariant cache hit.
[2024-05-22 16:17:37] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:18:03] [INFO ] Implicit Places using invariants and state equation in 26067 ms returned []
Implicit Place search using SMT with State Equation took 26950 ms to find 0 implicit places.
[2024-05-22 16:18:03] [INFO ] Redundant transitions in 130 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:18:03] [INFO ] Invariant cache hit.
[2024-05-22 16:18:03] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32466ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32498ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59659 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 2 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:18:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 16:18:35] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:18:35] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:18:35] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:18:35] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 56 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-04 in 174720 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:18:35] [INFO ] Computed 32 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (72 resets) in 87 ms. (113 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:18:36] [INFO ] Invariant cache hit.
[2024-05-22 16:18:36] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:18:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:18:36] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-22 16:18:36] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:18:37] [INFO ] [Real]Added 3582 Read/Feed constraints in 261 ms returned sat
[2024-05-22 16:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:18:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:18:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 16:18:38] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2024-05-22 16:18:38] [INFO ] [Nat]Added 3582 Read/Feed constraints in 293 ms returned sat
[2024-05-22 16:18:38] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 178 ms.
[2024-05-22 16:18:39] [INFO ] Added : 7 causal constraints over 2 iterations in 662 ms. Result :sat
Minimization took 977 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 247 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:18:40] [INFO ] Computed 32 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7148 resets) in 7877 ms. (126 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 987 ms. (1012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:18:49] [INFO ] Invariant cache hit.
[2024-05-22 16:18:49] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:18:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:18:49] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-05-22 16:18:50] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:18:50] [INFO ] [Real]Added 3604 Read/Feed constraints in 281 ms returned sat
[2024-05-22 16:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:18:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:18:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:18:51] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2024-05-22 16:18:51] [INFO ] [Nat]Added 3604 Read/Feed constraints in 317 ms returned sat
[2024-05-22 16:18:51] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 183 ms.
[2024-05-22 16:18:52] [INFO ] Added : 7 causal constraints over 2 iterations in 675 ms. Result :sat
Minimization took 4520 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 74 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:18:56] [INFO ] Invariant cache hit.
[2024-05-22 16:18:57] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-22 16:18:57] [INFO ] Invariant cache hit.
[2024-05-22 16:18:58] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:19:21] [INFO ] Implicit Places using invariants and state equation in 23663 ms returned []
Implicit Place search using SMT with State Equation took 24563 ms to find 0 implicit places.
[2024-05-22 16:19:21] [INFO ] Redundant transitions in 126 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:19:21] [INFO ] Invariant cache hit.
[2024-05-22 16:19:21] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32420ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57221 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 424 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 205002 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 205002 steps, saw 35317 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-22 16:19:57] [INFO ] Invariant cache hit.
[2024-05-22 16:19:57] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:19:57] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:19:58] [INFO ] Deduced a trap composed of 35 places in 675 ms of which 6 ms to minimize.
[2024-05-22 16:19:58] [INFO ] Deduced a trap composed of 42 places in 657 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2991 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:20:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:20:01] [INFO ] Deduced a trap composed of 37 places in 693 ms of which 7 ms to minimize.
[2024-05-22 16:20:01] [INFO ] Deduced a trap composed of 35 places in 592 ms of which 7 ms to minimize.
[2024-05-22 16:20:02] [INFO ] Deduced a trap composed of 37 places in 562 ms of which 6 ms to minimize.
[2024-05-22 16:20:03] [INFO ] Deduced a trap composed of 36 places in 542 ms of which 6 ms to minimize.
[2024-05-22 16:20:03] [INFO ] Deduced a trap composed of 36 places in 534 ms of which 6 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 49 places in 526 ms of which 6 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 36 places in 479 ms of which 6 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 5 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 37 places in 416 ms of which 5 ms to minimize.
SMT process timed out in 8314ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 67 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (284 resets) in 430 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 235473 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 235473 steps, saw 38952 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 16:20:08] [INFO ] Invariant cache hit.
[2024-05-22 16:20:08] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:08] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:09] [INFO ] Deduced a trap composed of 37 places in 645 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4720 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2246 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 37 places in 622 ms of which 6 ms to minimize.
[2024-05-22 16:20:12] [INFO ] Deduced a trap composed of 35 places in 618 ms of which 10 ms to minimize.
[2024-05-22 16:20:13] [INFO ] Deduced a trap composed of 37 places in 587 ms of which 7 ms to minimize.
[2024-05-22 16:20:13] [INFO ] Deduced a trap composed of 36 places in 587 ms of which 6 ms to minimize.
[2024-05-22 16:20:14] [INFO ] Deduced a trap composed of 36 places in 567 ms of which 6 ms to minimize.
[2024-05-22 16:20:14] [INFO ] Deduced a trap composed of 49 places in 548 ms of which 6 ms to minimize.
[2024-05-22 16:20:15] [INFO ] Deduced a trap composed of 44 places in 498 ms of which 5 ms to minimize.
[2024-05-22 16:20:15] [INFO ] Deduced a trap composed of 42 places in 523 ms of which 5 ms to minimize.
[2024-05-22 16:20:16] [INFO ] Deduced a trap composed of 52 places in 508 ms of which 5 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 43 places in 495 ms of which 6 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 44 places in 450 ms of which 5 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 37 places in 472 ms of which 5 ms to minimize.
[2024-05-22 16:20:18] [INFO ] Deduced a trap composed of 36 places in 458 ms of which 5 ms to minimize.
[2024-05-22 16:20:18] [INFO ] Deduced a trap composed of 39 places in 432 ms of which 5 ms to minimize.
[2024-05-22 16:20:19] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 5 ms to minimize.
[2024-05-22 16:20:19] [INFO ] Deduced a trap composed of 36 places in 392 ms of which 5 ms to minimize.
[2024-05-22 16:20:20] [INFO ] Deduced a trap composed of 38 places in 453 ms of which 5 ms to minimize.
[2024-05-22 16:20:20] [INFO ] Deduced a trap composed of 43 places in 433 ms of which 4 ms to minimize.
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 5 ms to minimize.
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 4 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 4 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 36 places in 285 ms of which 4 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 4 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 4 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 3 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 3 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 4 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 4 ms to minimize.
[2024-05-22 16:20:25] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 3 ms to minimize.
[2024-05-22 16:20:25] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 3 ms to minimize.
[2024-05-22 16:20:25] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 4 ms to minimize.
[2024-05-22 16:20:26] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 4 ms to minimize.
[2024-05-22 16:20:26] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 3 ms to minimize.
[2024-05-22 16:20:26] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 3 ms to minimize.
[2024-05-22 16:20:26] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 4 ms to minimize.
[2024-05-22 16:20:27] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:27] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 4 ms to minimize.
[2024-05-22 16:20:27] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 3 ms to minimize.
[2024-05-22 16:20:28] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-05-22 16:20:28] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 4 ms to minimize.
[2024-05-22 16:20:28] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 3 ms to minimize.
[2024-05-22 16:20:28] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:20:29] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:20:29] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 4 ms to minimize.
[2024-05-22 16:20:29] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-05-22 16:20:29] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-05-22 16:20:29] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-05-22 16:20:30] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-05-22 16:20:30] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:20:30] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 4 ms to minimize.
[2024-05-22 16:20:30] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:20:31] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:20:31] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-05-22 16:20:31] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:20:31] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2024-05-22 16:20:31] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:32] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
[2024-05-22 16:20:32] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:20:32] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-05-22 16:20:32] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2024-05-22 16:20:32] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:20:33] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:20:33] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:33] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:20:33] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:20:33] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-05-22 16:20:34] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:20:35] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:35] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 4 ms to minimize.
[2024-05-22 16:20:35] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:35] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 4 ms to minimize.
[2024-05-22 16:20:36] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 3 ms to minimize.
[2024-05-22 16:20:36] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 3 ms to minimize.
[2024-05-22 16:20:36] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:20:36] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 4 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:20:39] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-05-22 16:20:39] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 4 ms to minimize.
[2024-05-22 16:20:39] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:20:42] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:20:42] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 4 ms to minimize.
[2024-05-22 16:20:42] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:20:42] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:20:43] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:20:43] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 4 ms to minimize.
[2024-05-22 16:20:43] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-05-22 16:20:43] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-05-22 16:20:44] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:20:44] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2024-05-22 16:20:44] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-05-22 16:20:44] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:20:45] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 2 ms to minimize.
[2024-05-22 16:20:45] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:20:45] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-05-22 16:20:45] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 2 ms to minimize.
[2024-05-22 16:20:45] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 2 ms to minimize.
[2024-05-22 16:20:46] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2024-05-22 16:20:46] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 2 ms to minimize.
[2024-05-22 16:20:46] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:20:46] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-05-22 16:20:46] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-05-22 16:20:47] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-22 16:20:47] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-22 16:20:47] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1080 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3694/4774 variables, 1080/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 3604/4852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 1/4853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4774 variables, 0/4853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/4776 variables, 2/4855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4776 variables, 0/4855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/4776 variables, 0/4855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4855 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40197 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 136/136 constraints]
After SMT, in 42485ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:20:51] [INFO ] Invariant cache hit.
[2024-05-22 16:20:52] [INFO ] Implicit Places using invariants in 982 ms returned []
[2024-05-22 16:20:52] [INFO ] Invariant cache hit.
[2024-05-22 16:20:53] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:21:15] [INFO ] Implicit Places using invariants and state equation in 23120 ms returned []
Implicit Place search using SMT with State Equation took 24104 ms to find 0 implicit places.
[2024-05-22 16:21:15] [INFO ] Redundant transitions in 121 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:21:15] [INFO ] Invariant cache hit.
[2024-05-22 16:21:15] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32255ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56592 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-06 in 192072 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:21:48] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 83 ms. (119 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:21:48] [INFO ] Invariant cache hit.
[2024-05-22 16:21:48] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:21:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:21:48] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-22 16:21:48] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:21:49] [INFO ] [Real]Added 3582 Read/Feed constraints in 274 ms returned sat
[2024-05-22 16:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:21:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:21:49] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:21:50] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2024-05-22 16:21:50] [INFO ] [Nat]Added 3582 Read/Feed constraints in 258 ms returned sat
[2024-05-22 16:21:50] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-22 16:21:50] [INFO ] Added : 4 causal constraints over 1 iterations in 534 ms. Result :sat
Minimization took 960 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 247 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:21:52] [INFO ] Computed 32 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7139 resets) in 7644 ms. (130 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 907 ms. (1101 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:22:00] [INFO ] Invariant cache hit.
[2024-05-22 16:22:00] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:22:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:22:01] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2024-05-22 16:22:01] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:22:01] [INFO ] [Real]Added 3603 Read/Feed constraints in 261 ms returned sat
[2024-05-22 16:22:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:22:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:22:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:22:02] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-22 16:22:02] [INFO ] [Nat]Added 3603 Read/Feed constraints in 261 ms returned sat
[2024-05-22 16:22:03] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 217 ms.
[2024-05-22 16:22:03] [INFO ] Added : 4 causal constraints over 1 iterations in 569 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:22:08] [INFO ] Invariant cache hit.
[2024-05-22 16:22:09] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-22 16:22:09] [INFO ] Invariant cache hit.
[2024-05-22 16:22:09] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:22:28] [INFO ] Implicit Places using invariants and state equation in 19562 ms returned []
Implicit Place search using SMT with State Equation took 20475 ms to find 0 implicit places.
[2024-05-22 16:22:28] [INFO ] Redundant transitions in 123 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:22:28] [INFO ] Invariant cache hit.
[2024-05-22 16:22:28] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32284ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52997 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 212021 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 212021 steps, saw 36204 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-22 16:23:04] [INFO ] Invariant cache hit.
[2024-05-22 16:23:04] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:23:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:23:05] [INFO ] Deduced a trap composed of 51 places in 655 ms of which 6 ms to minimize.
[2024-05-22 16:23:05] [INFO ] Deduced a trap composed of 38 places in 568 ms of which 6 ms to minimize.
[2024-05-22 16:23:05] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:23:05] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-22 16:23:06] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:23:06] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 6/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4725 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2949 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:23:07] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:23:08] [INFO ] Deduced a trap composed of 40 places in 648 ms of which 7 ms to minimize.
[2024-05-22 16:23:08] [INFO ] Deduced a trap composed of 39 places in 614 ms of which 6 ms to minimize.
[2024-05-22 16:23:08] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4727 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4730 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3391 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 6377ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (285 resets) in 638 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 231140 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 231140 steps, saw 38441 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-22 16:23:14] [INFO ] Invariant cache hit.
[2024-05-22 16:23:14] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:23:14] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:23:15] [INFO ] Deduced a trap composed of 38 places in 652 ms of which 6 ms to minimize.
[2024-05-22 16:23:15] [INFO ] Deduced a trap composed of 39 places in 651 ms of which 7 ms to minimize.
[2024-05-22 16:23:16] [INFO ] Deduced a trap composed of 38 places in 665 ms of which 7 ms to minimize.
[2024-05-22 16:23:17] [INFO ] Deduced a trap composed of 36 places in 614 ms of which 6 ms to minimize.
[2024-05-22 16:23:17] [INFO ] Deduced a trap composed of 47 places in 595 ms of which 6 ms to minimize.
[2024-05-22 16:23:18] [INFO ] Deduced a trap composed of 44 places in 568 ms of which 6 ms to minimize.
[2024-05-22 16:23:18] [INFO ] Deduced a trap composed of 44 places in 583 ms of which 6 ms to minimize.
[2024-05-22 16:23:19] [INFO ] Deduced a trap composed of 44 places in 551 ms of which 6 ms to minimize.
[2024-05-22 16:23:20] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 6 ms to minimize.
[2024-05-22 16:23:20] [INFO ] Deduced a trap composed of 40 places in 552 ms of which 5 ms to minimize.
[2024-05-22 16:23:21] [INFO ] Deduced a trap composed of 39 places in 560 ms of which 6 ms to minimize.
[2024-05-22 16:23:21] [INFO ] Deduced a trap composed of 42 places in 480 ms of which 6 ms to minimize.
[2024-05-22 16:23:22] [INFO ] Deduced a trap composed of 42 places in 540 ms of which 6 ms to minimize.
[2024-05-22 16:23:22] [INFO ] Deduced a trap composed of 46 places in 552 ms of which 6 ms to minimize.
[2024-05-22 16:23:23] [INFO ] Deduced a trap composed of 41 places in 523 ms of which 6 ms to minimize.
[2024-05-22 16:23:23] [INFO ] Deduced a trap composed of 44 places in 508 ms of which 5 ms to minimize.
[2024-05-22 16:23:24] [INFO ] Deduced a trap composed of 42 places in 522 ms of which 6 ms to minimize.
[2024-05-22 16:23:24] [INFO ] Deduced a trap composed of 46 places in 512 ms of which 6 ms to minimize.
[2024-05-22 16:23:25] [INFO ] Deduced a trap composed of 45 places in 513 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12600 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:23:26] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:23:27] [INFO ] Deduced a trap composed of 40 places in 654 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3018 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 15656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:23:29] [INFO ] Invariant cache hit.
[2024-05-22 16:23:30] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-22 16:23:30] [INFO ] Invariant cache hit.
[2024-05-22 16:23:31] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:23:50] [INFO ] Implicit Places using invariants and state equation in 19461 ms returned []
Implicit Place search using SMT with State Equation took 20365 ms to find 0 implicit places.
[2024-05-22 16:23:50] [INFO ] Redundant transitions in 129 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:23:50] [INFO ] Invariant cache hit.
[2024-05-22 16:23:50] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
timeout
(s711 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32294ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52897 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 0 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 5 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:24:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 16:24:22] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:24:22] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:24:22] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:24:22] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 47 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-07 in 154808 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:24:22] [INFO ] Computed 32 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 84 ms. (117 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:24:22] [INFO ] Invariant cache hit.
[2024-05-22 16:24:23] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:24:23] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:24:23] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-05-22 16:24:23] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:24:24] [INFO ] [Real]Added 3582 Read/Feed constraints in 317 ms returned sat
[2024-05-22 16:24:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:24:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-22 16:24:24] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:24:25] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-05-22 16:24:25] [INFO ] [Nat]Added 3582 Read/Feed constraints in 386 ms returned sat
[2024-05-22 16:24:25] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 205 ms.
[2024-05-22 16:24:26] [INFO ] Added : 10 causal constraints over 2 iterations in 713 ms. Result :sat
Minimization took 643 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 1083 transition count 3695
Applied a total of 21 rules in 178 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:24:27] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7151 resets) in 7746 ms. (129 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 927 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:24:35] [INFO ] Invariant cache hit.
[2024-05-22 16:24:36] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:24:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:24:36] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-22 16:24:36] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:24:37] [INFO ] [Real]Added 3603 Read/Feed constraints in 307 ms returned sat
[2024-05-22 16:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:24:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:24:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:24:38] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2024-05-22 16:24:38] [INFO ] [Nat]Added 3603 Read/Feed constraints in 358 ms returned sat
[2024-05-22 16:24:38] [INFO ] Computed and/alt/rep : 2621/6956/2621 causal constraints (skipped 1044 transitions) in 213 ms.
[2024-05-22 16:24:39] [INFO ] Added : 11 causal constraints over 3 iterations in 877 ms. Result :sat
Minimization took 4736 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 73 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:24:44] [INFO ] Invariant cache hit.
[2024-05-22 16:24:45] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-05-22 16:24:45] [INFO ] Invariant cache hit.
[2024-05-22 16:24:46] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:25:05] [INFO ] Implicit Places using invariants and state equation in 19930 ms returned []
Implicit Place search using SMT with State Equation took 20868 ms to find 0 implicit places.
[2024-05-22 16:25:05] [INFO ] Redundant transitions in 123 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:25:05] [INFO ] Invariant cache hit.
[2024-05-22 16:25:05] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32340ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53446 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 432 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 211839 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 211839 steps, saw 36180 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-22 16:25:40] [INFO ] Invariant cache hit.
[2024-05-22 16:25:40] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:25:41] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:25:41] [INFO ] Deduced a trap composed of 52 places in 710 ms of which 6 ms to minimize.
[2024-05-22 16:25:42] [INFO ] Deduced a trap composed of 35 places in 665 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:25:44] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:25:45] [INFO ] Deduced a trap composed of 40 places in 699 ms of which 7 ms to minimize.
[2024-05-22 16:25:45] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4722 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4723 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4725 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2790 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6041ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 360 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234698 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234698 steps, saw 38872 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 16:25:50] [INFO ] Invariant cache hit.
[2024-05-22 16:25:50] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:25:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:25:51] [INFO ] Deduced a trap composed of 35 places in 630 ms of which 6 ms to minimize.
[2024-05-22 16:25:51] [INFO ] Deduced a trap composed of 35 places in 644 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2869 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:25:53] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:25:53] [INFO ] Deduced a trap composed of 40 places in 646 ms of which 6 ms to minimize.
[2024-05-22 16:25:54] [INFO ] Deduced a trap composed of 35 places in 642 ms of which 6 ms to minimize.
[2024-05-22 16:25:55] [INFO ] Deduced a trap composed of 41 places in 575 ms of which 6 ms to minimize.
[2024-05-22 16:25:55] [INFO ] Deduced a trap composed of 38 places in 542 ms of which 6 ms to minimize.
[2024-05-22 16:25:56] [INFO ] Deduced a trap composed of 39 places in 536 ms of which 6 ms to minimize.
[2024-05-22 16:25:56] [INFO ] Deduced a trap composed of 38 places in 572 ms of which 6 ms to minimize.
[2024-05-22 16:25:57] [INFO ] Deduced a trap composed of 39 places in 574 ms of which 6 ms to minimize.
[2024-05-22 16:25:58] [INFO ] Deduced a trap composed of 36 places in 583 ms of which 6 ms to minimize.
[2024-05-22 16:25:58] [INFO ] Deduced a trap composed of 56 places in 559 ms of which 6 ms to minimize.
[2024-05-22 16:25:59] [INFO ] Deduced a trap composed of 45 places in 557 ms of which 6 ms to minimize.
[2024-05-22 16:25:59] [INFO ] Deduced a trap composed of 42 places in 542 ms of which 5 ms to minimize.
[2024-05-22 16:26:00] [INFO ] Deduced a trap composed of 38 places in 505 ms of which 5 ms to minimize.
[2024-05-22 16:26:00] [INFO ] Deduced a trap composed of 52 places in 505 ms of which 6 ms to minimize.
[2024-05-22 16:26:01] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 5 ms to minimize.
[2024-05-22 16:26:01] [INFO ] Deduced a trap composed of 50 places in 541 ms of which 6 ms to minimize.
[2024-05-22 16:26:02] [INFO ] Deduced a trap composed of 36 places in 467 ms of which 5 ms to minimize.
[2024-05-22 16:26:02] [INFO ] Deduced a trap composed of 36 places in 478 ms of which 5 ms to minimize.
[2024-05-22 16:26:03] [INFO ] Deduced a trap composed of 36 places in 438 ms of which 5 ms to minimize.
[2024-05-22 16:26:03] [INFO ] Deduced a trap composed of 36 places in 416 ms of which 5 ms to minimize.
[2024-05-22 16:26:04] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:26:04] [INFO ] Deduced a trap composed of 37 places in 394 ms of which 4 ms to minimize.
[2024-05-22 16:26:05] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 4 ms to minimize.
[2024-05-22 16:26:05] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 4 ms to minimize.
[2024-05-22 16:26:05] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 4 ms to minimize.
[2024-05-22 16:26:05] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 3 ms to minimize.
[2024-05-22 16:26:06] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 4 ms to minimize.
[2024-05-22 16:26:06] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2024-05-22 16:26:06] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-05-22 16:26:07] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-05-22 16:26:07] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2024-05-22 16:26:07] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-05-22 16:26:07] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-05-22 16:26:07] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-05-22 16:26:08] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 2 ms to minimize.
[2024-05-22 16:26:08] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:26:08] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:26:08] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:26:08] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 2 ms to minimize.
[2024-05-22 16:26:09] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:26:09] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:26:09] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:26:09] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 3 ms to minimize.
[2024-05-22 16:26:09] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:26:10] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 2 ms to minimize.
[2024-05-22 16:26:10] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:26:10] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-22 16:26:10] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-22 16:26:10] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:26:10] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-22 16:26:11] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-22 16:26:11] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3695/4776 variables, 1081/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 3603/4771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4776 variables, 1/4772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 0/4772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/4778 variables, 2/4774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4778 variables, 0/4774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4778 variables, 0/4774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4774 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19828 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 22766ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:26:13] [INFO ] Invariant cache hit.
[2024-05-22 16:26:13] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-22 16:26:13] [INFO ] Invariant cache hit.
[2024-05-22 16:26:14] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:26:33] [INFO ] Implicit Places using invariants and state equation in 19467 ms returned []
Implicit Place search using SMT with State Equation took 20368 ms to find 0 implicit places.
[2024-05-22 16:26:33] [INFO ] Redundant transitions in 122 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:26:33] [INFO ] Invariant cache hit.
[2024-05-22 16:26:33] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32271ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52880 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3513 edges and 1083 vertex of which 958 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 920 transitions
Reduce isomorphic transitions removed 3564 transitions.
Graph (complete) has 314 edges and 127 vertex of which 35 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.0 ms
Discarding 92 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 35 transition count 40
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 92 place count 6 transition count 11
Iterating global reduction 1 with 29 rules applied. Total rules applied 121 place count 6 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 5 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 5 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 4 transition count 7
Applied a total of 126 rules in 6 ms. Remains 4 /1083 variables (removed 1079) and now considering 7/3695 (removed 3688) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 4 cols
[2024-05-22 16:27:05] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 16:27:05] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:27:05] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:27:05] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:27:05] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 58 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-08 in 163132 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:27:05] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (69 resets) in 80 ms. (123 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:27:06] [INFO ] Invariant cache hit.
[2024-05-22 16:27:06] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:27:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 16:27:06] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-22 16:27:06] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:27:07] [INFO ] [Real]Added 3582 Read/Feed constraints in 252 ms returned sat
[2024-05-22 16:27:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:27:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:27:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:27:07] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-22 16:27:08] [INFO ] [Nat]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-22 16:27:08] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-22 16:27:08] [INFO ] Added : 4 causal constraints over 1 iterations in 519 ms. Result :sat
Minimization took 952 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 298 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:27:10] [INFO ] Computed 32 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7150 resets) in 7637 ms. (130 steps per ms)
BEST_FIRST walk for 1000001 steps (201 resets) in 911 ms. (1096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:27:18] [INFO ] Invariant cache hit.
[2024-05-22 16:27:18] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-22 16:27:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-22 16:27:19] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2024-05-22 16:27:19] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:27:19] [INFO ] [Real]Added 3604 Read/Feed constraints in 297 ms returned sat
[2024-05-22 16:27:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:27:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:27:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:27:20] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-05-22 16:27:21] [INFO ] [Nat]Added 3604 Read/Feed constraints in 255 ms returned sat
[2024-05-22 16:27:21] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-22 16:27:21] [INFO ] Added : 4 causal constraints over 1 iterations in 520 ms. Result :sat
Minimization took 4577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 70 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:27:26] [INFO ] Invariant cache hit.
[2024-05-22 16:27:27] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-22 16:27:27] [INFO ] Invariant cache hit.
[2024-05-22 16:27:28] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:27:49] [INFO ] Implicit Places using invariants and state equation in 22017 ms returned []
Implicit Place search using SMT with State Equation took 22894 ms to find 0 implicit places.
[2024-05-22 16:27:49] [INFO ] Redundant transitions in 124 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:27:49] [INFO ] Invariant cache hit.
[2024-05-22 16:27:49] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32376ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55531 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (283 resets) in 591 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 215358 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 215358 steps, saw 36583 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-22 16:28:25] [INFO ] Invariant cache hit.
[2024-05-22 16:28:25] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:28:25] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:28:26] [INFO ] Deduced a trap composed of 35 places in 642 ms of which 6 ms to minimize.
[2024-05-22 16:28:26] [INFO ] Deduced a trap composed of 34 places in 602 ms of which 6 ms to minimize.
[2024-05-22 16:28:27] [INFO ] Deduced a trap composed of 52 places in 570 ms of which 6 ms to minimize.
[2024-05-22 16:28:27] [INFO ] Deduced a trap composed of 51 places in 523 ms of which 6 ms to minimize.
[2024-05-22 16:28:28] [INFO ] Deduced a trap composed of 42 places in 538 ms of which 6 ms to minimize.
[2024-05-22 16:28:28] [INFO ] Deduced a trap composed of 37 places in 529 ms of which 5 ms to minimize.
[2024-05-22 16:28:29] [INFO ] Deduced a trap composed of 37 places in 499 ms of which 5 ms to minimize.
[2024-05-22 16:28:29] [INFO ] Deduced a trap composed of 43 places in 529 ms of which 5 ms to minimize.
[2024-05-22 16:28:30] [INFO ] Deduced a trap composed of 35 places in 525 ms of which 6 ms to minimize.
SMT process timed out in 5477ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 70 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (287 resets) in 424 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234146 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234146 steps, saw 38805 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 16:28:33] [INFO ] Invariant cache hit.
[2024-05-22 16:28:33] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:28:33] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:28:34] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 6 ms to minimize.
[2024-05-22 16:28:35] [INFO ] Deduced a trap composed of 37 places in 629 ms of which 6 ms to minimize.
[2024-05-22 16:28:35] [INFO ] Deduced a trap composed of 34 places in 625 ms of which 6 ms to minimize.
[2024-05-22 16:28:36] [INFO ] Deduced a trap composed of 42 places in 613 ms of which 6 ms to minimize.
[2024-05-22 16:28:37] [INFO ] Deduced a trap composed of 40 places in 578 ms of which 6 ms to minimize.
[2024-05-22 16:28:37] [INFO ] Deduced a trap composed of 44 places in 510 ms of which 6 ms to minimize.
[2024-05-22 16:28:38] [INFO ] Deduced a trap composed of 41 places in 576 ms of which 6 ms to minimize.
[2024-05-22 16:28:38] [INFO ] Deduced a trap composed of 44 places in 558 ms of which 6 ms to minimize.
[2024-05-22 16:28:39] [INFO ] Deduced a trap composed of 46 places in 531 ms of which 6 ms to minimize.
[2024-05-22 16:28:40] [INFO ] Deduced a trap composed of 50 places in 548 ms of which 6 ms to minimize.
[2024-05-22 16:28:40] [INFO ] Deduced a trap composed of 48 places in 559 ms of which 6 ms to minimize.
[2024-05-22 16:28:41] [INFO ] Deduced a trap composed of 35 places in 523 ms of which 6 ms to minimize.
[2024-05-22 16:28:41] [INFO ] Deduced a trap composed of 35 places in 458 ms of which 5 ms to minimize.
[2024-05-22 16:28:42] [INFO ] Deduced a trap composed of 42 places in 485 ms of which 6 ms to minimize.
[2024-05-22 16:28:42] [INFO ] Deduced a trap composed of 40 places in 447 ms of which 5 ms to minimize.
[2024-05-22 16:28:43] [INFO ] Deduced a trap composed of 46 places in 421 ms of which 4 ms to minimize.
[2024-05-22 16:28:43] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 4 ms to minimize.
[2024-05-22 16:28:43] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 5 ms to minimize.
[2024-05-22 16:28:44] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 5 ms to minimize.
[2024-05-22 16:28:44] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:28:45] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 5 ms to minimize.
[2024-05-22 16:28:45] [INFO ] Deduced a trap composed of 45 places in 403 ms of which 5 ms to minimize.
[2024-05-22 16:28:45] [INFO ] Deduced a trap composed of 38 places in 371 ms of which 5 ms to minimize.
[2024-05-22 16:28:46] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 5 ms to minimize.
[2024-05-22 16:28:46] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 4 ms to minimize.
[2024-05-22 16:28:47] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 4 ms to minimize.
[2024-05-22 16:28:47] [INFO ] Deduced a trap composed of 41 places in 279 ms of which 3 ms to minimize.
[2024-05-22 16:28:47] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 3 ms to minimize.
[2024-05-22 16:28:47] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 4 ms to minimize.
[2024-05-22 16:28:48] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 4 ms to minimize.
[2024-05-22 16:28:48] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-05-22 16:28:48] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 3 ms to minimize.
[2024-05-22 16:28:49] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 4 ms to minimize.
[2024-05-22 16:28:49] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 3 ms to minimize.
[2024-05-22 16:28:49] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 3 ms to minimize.
[2024-05-22 16:28:49] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 3 ms to minimize.
[2024-05-22 16:28:50] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 3 ms to minimize.
[2024-05-22 16:28:50] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 3 ms to minimize.
[2024-05-22 16:28:50] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3694/4774 variables, 1080/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 3604/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 0/4756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4776 variables, 2/4758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4776 variables, 0/4758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18231 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:28:52] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 39/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:28:52] [INFO ] Deduced a trap composed of 45 places in 548 ms of which 6 ms to minimize.
[2024-05-22 16:28:53] [INFO ] Deduced a trap composed of 45 places in 577 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3694/4774 variables, 1080/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4774 variables, 3604/4759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4774 variables, 1/4760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4774 variables, 0/4760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4776 variables, 2/4762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 0/4762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4776 variables, 0/4762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4762 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3969 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 43/43 constraints]
After SMT, in 22236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:28:56] [INFO ] Invariant cache hit.
[2024-05-22 16:28:57] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-22 16:28:57] [INFO ] Invariant cache hit.
[2024-05-22 16:28:57] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:29:16] [INFO ] Implicit Places using invariants and state equation in 19709 ms returned []
Implicit Place search using SMT with State Equation took 20597 ms to find 0 implicit places.
[2024-05-22 16:29:16] [INFO ] Redundant transitions in 125 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:29:16] [INFO ] Invariant cache hit.
[2024-05-22 16:29:16] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32335ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53161 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 10 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:29:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 16:29:49] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:29:49] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:29:49] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:29:49] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 59 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-09 in 163427 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:29:49] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 83 ms. (119 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:29:49] [INFO ] Invariant cache hit.
[2024-05-22 16:29:49] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:29:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:29:50] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2024-05-22 16:29:50] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:29:50] [INFO ] [Real]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-22 16:29:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:29:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:29:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:29:51] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2024-05-22 16:29:51] [INFO ] [Nat]Added 3582 Read/Feed constraints in 408 ms returned sat
[2024-05-22 16:29:52] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 177 ms.
[2024-05-22 16:29:52] [INFO ] Added : 10 causal constraints over 2 iterations in 649 ms. Result :sat
Minimization took 968 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 244 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:29:53] [INFO ] Computed 32 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7158 resets) in 7624 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 944 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:30:02] [INFO ] Invariant cache hit.
[2024-05-22 16:30:02] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:30:02] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:30:03] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-22 16:30:03] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:30:03] [INFO ] [Real]Added 3604 Read/Feed constraints in 246 ms returned sat
[2024-05-22 16:30:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:30:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:30:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-22 16:30:04] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2024-05-22 16:30:04] [INFO ] [Nat]Added 3604 Read/Feed constraints in 341 ms returned sat
[2024-05-22 16:30:04] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-22 16:30:05] [INFO ] Added : 8 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 70 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:30:10] [INFO ] Invariant cache hit.
[2024-05-22 16:30:10] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-22 16:30:10] [INFO ] Invariant cache hit.
[2024-05-22 16:30:11] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:30:30] [INFO ] Implicit Places using invariants and state equation in 19335 ms returned []
Implicit Place search using SMT with State Equation took 20219 ms to find 0 implicit places.
[2024-05-22 16:30:30] [INFO ] Redundant transitions in 128 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:30:30] [INFO ] Invariant cache hit.
[2024-05-22 16:30:30] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32435ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52891 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (282 resets) in 612 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 211001 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 211001 steps, saw 36071 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-22 16:31:06] [INFO ] Invariant cache hit.
[2024-05-22 16:31:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:06] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:31:07] [INFO ] Deduced a trap composed of 52 places in 626 ms of which 7 ms to minimize.
[2024-05-22 16:31:07] [INFO ] Deduced a trap composed of 52 places in 643 ms of which 7 ms to minimize.
[2024-05-22 16:31:08] [INFO ] Deduced a trap composed of 38 places in 597 ms of which 6 ms to minimize.
[2024-05-22 16:31:09] [INFO ] Deduced a trap composed of 42 places in 613 ms of which 7 ms to minimize.
[2024-05-22 16:31:09] [INFO ] Deduced a trap composed of 56 places in 569 ms of which 6 ms to minimize.
[2024-05-22 16:31:10] [INFO ] Deduced a trap composed of 42 places in 564 ms of which 6 ms to minimize.
[2024-05-22 16:31:10] [INFO ] Deduced a trap composed of 47 places in 583 ms of which 6 ms to minimize.
[2024-05-22 16:31:11] [INFO ] Deduced a trap composed of 36 places in 547 ms of which 5 ms to minimize.
SMT process timed out in 5234ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 229113 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 229113 steps, saw 38189 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-22 16:31:14] [INFO ] Invariant cache hit.
[2024-05-22 16:31:14] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:14] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:15] [INFO ] Deduced a trap composed of 38 places in 684 ms of which 7 ms to minimize.
[2024-05-22 16:31:15] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:17] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:18] [INFO ] Deduced a trap composed of 38 places in 647 ms of which 6 ms to minimize.
[2024-05-22 16:31:18] [INFO ] Deduced a trap composed of 36 places in 624 ms of which 6 ms to minimize.
[2024-05-22 16:31:19] [INFO ] Deduced a trap composed of 53 places in 582 ms of which 6 ms to minimize.
[2024-05-22 16:31:19] [INFO ] Deduced a trap composed of 37 places in 533 ms of which 6 ms to minimize.
[2024-05-22 16:31:20] [INFO ] Deduced a trap composed of 38 places in 515 ms of which 6 ms to minimize.
[2024-05-22 16:31:20] [INFO ] Deduced a trap composed of 38 places in 507 ms of which 5 ms to minimize.
[2024-05-22 16:31:21] [INFO ] Deduced a trap composed of 37 places in 509 ms of which 5 ms to minimize.
[2024-05-22 16:31:21] [INFO ] Deduced a trap composed of 45 places in 500 ms of which 5 ms to minimize.
[2024-05-22 16:31:22] [INFO ] Deduced a trap composed of 42 places in 498 ms of which 5 ms to minimize.
[2024-05-22 16:31:22] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 5 ms to minimize.
[2024-05-22 16:31:23] [INFO ] Deduced a trap composed of 39 places in 451 ms of which 5 ms to minimize.
[2024-05-22 16:31:23] [INFO ] Deduced a trap composed of 37 places in 458 ms of which 5 ms to minimize.
[2024-05-22 16:31:24] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 5 ms to minimize.
[2024-05-22 16:31:24] [INFO ] Deduced a trap composed of 37 places in 411 ms of which 4 ms to minimize.
[2024-05-22 16:31:25] [INFO ] Deduced a trap composed of 39 places in 407 ms of which 4 ms to minimize.
[2024-05-22 16:31:25] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 5 ms to minimize.
[2024-05-22 16:31:26] [INFO ] Deduced a trap composed of 45 places in 377 ms of which 4 ms to minimize.
[2024-05-22 16:31:26] [INFO ] Deduced a trap composed of 41 places in 371 ms of which 4 ms to minimize.
[2024-05-22 16:31:26] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 4 ms to minimize.
[2024-05-22 16:31:27] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:27] [INFO ] Deduced a trap composed of 52 places in 354 ms of which 4 ms to minimize.
[2024-05-22 16:31:27] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 4 ms to minimize.
[2024-05-22 16:31:28] [INFO ] Deduced a trap composed of 40 places in 304 ms of which 3 ms to minimize.
[2024-05-22 16:31:28] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 3 ms to minimize.
[2024-05-22 16:31:28] [INFO ] Deduced a trap composed of 48 places in 288 ms of which 4 ms to minimize.
[2024-05-22 16:31:29] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 3 ms to minimize.
[2024-05-22 16:31:29] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 3 ms to minimize.
[2024-05-22 16:31:29] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 4 ms to minimize.
[2024-05-22 16:31:29] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 4 ms to minimize.
[2024-05-22 16:31:30] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 3 ms to minimize.
[2024-05-22 16:31:30] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 4 ms to minimize.
[2024-05-22 16:31:30] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 3 ms to minimize.
[2024-05-22 16:31:31] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 4 ms to minimize.
[2024-05-22 16:31:31] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
[2024-05-22 16:31:31] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2024-05-22 16:31:31] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-05-22 16:31:31] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:31:32] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-05-22 16:31:32] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 3 ms to minimize.
[2024-05-22 16:31:32] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:32] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 2 ms to minimize.
[2024-05-22 16:31:33] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:31:33] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 2 ms to minimize.
[2024-05-22 16:31:33] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 3 ms to minimize.
[2024-05-22 16:31:33] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:31:33] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:31:33] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-05-22 16:31:34] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:31:34] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-05-22 16:31:34] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-22 16:31:34] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:31:34] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-22 16:31:34] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:31:35] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:31:36] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-22 16:31:37] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:31:38] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-22 16:31:38] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:31:38] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-05-22 16:31:38] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:38] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-22 16:31:38] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-22 16:31:39] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:31:39] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-05-22 16:31:39] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-22 16:31:39] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 2 ms to minimize.
[2024-05-22 16:31:39] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:31:40] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:31:40] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:31:40] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2024-05-22 16:31:40] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2024-05-22 16:31:40] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 16:31:41] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:31:41] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-05-22 16:31:41] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:31:41] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:31:41] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-05-22 16:31:41] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-05-22 16:31:42] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:31:42] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:31:42] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2024-05-22 16:31:42] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-05-22 16:31:42] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-22 16:31:42] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 1 ms to minimize.
[2024-05-22 16:31:43] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-05-22 16:31:43] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-05-22 16:31:43] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:31:44] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-05-22 16:31:44] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-22 16:31:44] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-05-22 16:31:44] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 2 ms to minimize.
[2024-05-22 16:31:44] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-05-22 16:31:45] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-05-22 16:31:45] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31269 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 118/118 constraints]
After SMT, in 33747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 63 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:31:48] [INFO ] Invariant cache hit.
[2024-05-22 16:31:49] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-05-22 16:31:49] [INFO ] Invariant cache hit.
[2024-05-22 16:31:50] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:32:08] [INFO ] Implicit Places using invariants and state equation in 19236 ms returned []
Implicit Place search using SMT with State Equation took 20124 ms to find 0 implicit places.
[2024-05-22 16:32:08] [INFO ] Redundant transitions in 124 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:32:08] [INFO ] Invariant cache hit.
[2024-05-22 16:32:08] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32368ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52724 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:32:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 16:32:41] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:32:41] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:32:41] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:32:41] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 51 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-10 in 171930 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:32:41] [INFO ] Computed 32 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 82 ms. (120 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:32:41] [INFO ] Invariant cache hit.
[2024-05-22 16:32:41] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:32:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:32:42] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-22 16:32:42] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:32:42] [INFO ] [Real]Added 3582 Read/Feed constraints in 252 ms returned sat
[2024-05-22 16:32:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:32:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:32:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:32:43] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-22 16:32:43] [INFO ] [Nat]Added 3582 Read/Feed constraints in 297 ms returned sat
[2024-05-22 16:32:43] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 179 ms.
[2024-05-22 16:32:44] [INFO ] Added : 9 causal constraints over 2 iterations in 647 ms. Result :sat
Minimization took 963 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 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 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 247 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:32:45] [INFO ] Computed 32 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7144 resets) in 7676 ms. (130 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 933 ms. (1070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:32:54] [INFO ] Invariant cache hit.
[2024-05-22 16:32:54] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-22 16:32:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:32:54] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-22 16:32:55] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:32:55] [INFO ] [Real]Added 3603 Read/Feed constraints in 259 ms returned sat
[2024-05-22 16:32:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:32:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:32:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:32:56] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-22 16:32:56] [INFO ] [Nat]Added 3603 Read/Feed constraints in 263 ms returned sat
[2024-05-22 16:32:56] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 176 ms.
[2024-05-22 16:32:57] [INFO ] Added : 7 causal constraints over 2 iterations in 640 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:33:01] [INFO ] Invariant cache hit.
[2024-05-22 16:33:02] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-22 16:33:02] [INFO ] Invariant cache hit.
[2024-05-22 16:33:03] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:33:23] [INFO ] Implicit Places using invariants and state equation in 21098 ms returned []
Implicit Place search using SMT with State Equation took 21970 ms to find 0 implicit places.
[2024-05-22 16:33:23] [INFO ] Redundant transitions in 120 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:33:23] [INFO ] Invariant cache hit.
[2024-05-22 16:33:23] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32288ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54489 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (281 resets) in 817 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 215070 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 215070 steps, saw 36557 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-22 16:33:59] [INFO ] Invariant cache hit.
[2024-05-22 16:33:59] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:33:59] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:34:00] [INFO ] Deduced a trap composed of 52 places in 654 ms of which 7 ms to minimize.
[2024-05-22 16:34:01] [INFO ] Deduced a trap composed of 39 places in 659 ms of which 6 ms to minimize.
[2024-05-22 16:34:01] [INFO ] Deduced a trap composed of 40 places in 648 ms of which 6 ms to minimize.
[2024-05-22 16:34:02] [INFO ] Deduced a trap composed of 37 places in 586 ms of which 6 ms to minimize.
[2024-05-22 16:34:02] [INFO ] Deduced a trap composed of 44 places in 574 ms of which 6 ms to minimize.
[2024-05-22 16:34:03] [INFO ] Deduced a trap composed of 37 places in 628 ms of which 7 ms to minimize.
[2024-05-22 16:34:04] [INFO ] Deduced a trap composed of 35 places in 557 ms of which 6 ms to minimize.
[2024-05-22 16:34:04] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 5 ms to minimize.
SMT process timed out in 5373ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 236485 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 236485 steps, saw 39072 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 16:34:07] [INFO ] Invariant cache hit.
[2024-05-22 16:34:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:34:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:34:08] [INFO ] Deduced a trap composed of 38 places in 625 ms of which 6 ms to minimize.
[2024-05-22 16:34:09] [INFO ] Deduced a trap composed of 39 places in 615 ms of which 6 ms to minimize.
[2024-05-22 16:34:10] [INFO ] Deduced a trap composed of 38 places in 616 ms of which 7 ms to minimize.
[2024-05-22 16:34:10] [INFO ] Deduced a trap composed of 36 places in 591 ms of which 6 ms to minimize.
[2024-05-22 16:34:11] [INFO ] Deduced a trap composed of 47 places in 563 ms of which 6 ms to minimize.
[2024-05-22 16:34:12] [INFO ] Deduced a trap composed of 44 places in 630 ms of which 6 ms to minimize.
[2024-05-22 16:34:12] [INFO ] Deduced a trap composed of 44 places in 653 ms of which 7 ms to minimize.
[2024-05-22 16:34:13] [INFO ] Deduced a trap composed of 44 places in 644 ms of which 6 ms to minimize.
[2024-05-22 16:34:14] [INFO ] Deduced a trap composed of 38 places in 595 ms of which 7 ms to minimize.
[2024-05-22 16:34:14] [INFO ] Deduced a trap composed of 40 places in 639 ms of which 7 ms to minimize.
[2024-05-22 16:34:15] [INFO ] Deduced a trap composed of 39 places in 619 ms of which 6 ms to minimize.
[2024-05-22 16:34:15] [INFO ] Deduced a trap composed of 47 places in 590 ms of which 6 ms to minimize.
[2024-05-22 16:34:16] [INFO ] Deduced a trap composed of 35 places in 570 ms of which 6 ms to minimize.
[2024-05-22 16:34:17] [INFO ] Deduced a trap composed of 48 places in 552 ms of which 6 ms to minimize.
[2024-05-22 16:34:17] [INFO ] Deduced a trap composed of 44 places in 557 ms of which 6 ms to minimize.
[2024-05-22 16:34:18] [INFO ] Deduced a trap composed of 43 places in 571 ms of which 6 ms to minimize.
[2024-05-22 16:34:18] [INFO ] Deduced a trap composed of 45 places in 559 ms of which 5 ms to minimize.
[2024-05-22 16:34:19] [INFO ] Deduced a trap composed of 45 places in 545 ms of which 6 ms to minimize.
[2024-05-22 16:34:19] [INFO ] Deduced a trap composed of 48 places in 455 ms of which 5 ms to minimize.
[2024-05-22 16:34:20] [INFO ] Deduced a trap composed of 44 places in 469 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:34:20] [INFO ] Deduced a trap composed of 46 places in 467 ms of which 4 ms to minimize.
[2024-05-22 16:34:21] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 5 ms to minimize.
[2024-05-22 16:34:21] [INFO ] Deduced a trap composed of 47 places in 438 ms of which 5 ms to minimize.
[2024-05-22 16:34:22] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 5 ms to minimize.
[2024-05-22 16:34:22] [INFO ] Deduced a trap composed of 46 places in 411 ms of which 4 ms to minimize.
[2024-05-22 16:34:23] [INFO ] Deduced a trap composed of 45 places in 408 ms of which 4 ms to minimize.
[2024-05-22 16:34:23] [INFO ] Deduced a trap composed of 48 places in 418 ms of which 5 ms to minimize.
[2024-05-22 16:34:23] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 4 ms to minimize.
[2024-05-22 16:34:24] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 4 ms to minimize.
[2024-05-22 16:34:24] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 4 ms to minimize.
[2024-05-22 16:34:25] [INFO ] Deduced a trap composed of 43 places in 403 ms of which 5 ms to minimize.
[2024-05-22 16:34:25] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 4 ms to minimize.
[2024-05-22 16:34:25] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 4 ms to minimize.
[2024-05-22 16:34:26] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19602 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:34:27] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:34:28] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 4 ms to minimize.
[2024-05-22 16:34:28] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 4 ms to minimize.
[2024-05-22 16:34:28] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 4 ms to minimize.
[2024-05-22 16:34:29] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 4 ms to minimize.
[2024-05-22 16:34:29] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 4 ms to minimize.
[2024-05-22 16:34:29] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 4 ms to minimize.
[2024-05-22 16:34:30] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 4 ms to minimize.
[2024-05-22 16:34:30] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:34:30] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:34:30] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-05-22 16:34:30] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-22 16:34:31] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-05-22 16:34:31] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-05-22 16:34:31] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:34:31] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:34:31] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 4 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-22 16:34:32] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-22 16:34:33] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-22 16:34:33] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3695/4776 variables, 1081/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 3603/4779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 1/4780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4776 variables, 0/4780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/4778 variables, 2/4782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4778 variables, 0/4782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4778 variables, 0/4782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7426 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 63/63 constraints]
After SMT, in 27064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:34:35] [INFO ] Invariant cache hit.
[2024-05-22 16:34:36] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-22 16:34:36] [INFO ] Invariant cache hit.
[2024-05-22 16:34:36] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:34:56] [INFO ] Implicit Places using invariants and state equation in 20336 ms returned []
Implicit Place search using SMT with State Equation took 21218 ms to find 0 implicit places.
[2024-05-22 16:34:56] [INFO ] Redundant transitions in 119 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:34:56] [INFO ] Invariant cache hit.
[2024-05-22 16:34:56] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 1.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 1.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 1.0)
(s917 0.0)
(s918 1.0)
(s919 1.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 1.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 1.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 1.0)
(s1008 0.0)
(s1009 1.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32305ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53751 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 11 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:35:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 16:35:28] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:35:28] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:35:28] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:35:28] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 57 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-11 in 167688 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:35:29] [INFO ] Computed 32 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 81 ms. (121 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:35:29] [INFO ] Invariant cache hit.
[2024-05-22 16:35:29] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:35:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:35:29] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2024-05-22 16:35:29] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:35:30] [INFO ] [Real]Added 3582 Read/Feed constraints in 257 ms returned sat
[2024-05-22 16:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:35:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:35:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:35:30] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-05-22 16:35:31] [INFO ] [Nat]Added 3582 Read/Feed constraints in 297 ms returned sat
[2024-05-22 16:35:31] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-22 16:35:32] [INFO ] Added : 10 causal constraints over 2 iterations in 644 ms. Result :sat
Minimization took 963 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 238 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:35:33] [INFO ] Computed 32 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7159 resets) in 7507 ms. (133 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 921 ms. (1084 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:35:41] [INFO ] Invariant cache hit.
[2024-05-22 16:35:41] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:35:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:35:42] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-22 16:35:42] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:35:42] [INFO ] [Real]Added 3603 Read/Feed constraints in 252 ms returned sat
[2024-05-22 16:35:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:35:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:35:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:35:43] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2024-05-22 16:35:43] [INFO ] [Nat]Added 3603 Read/Feed constraints in 265 ms returned sat
[2024-05-22 16:35:44] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-22 16:35:44] [INFO ] Added : 7 causal constraints over 2 iterations in 627 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:35:49] [INFO ] Invariant cache hit.
[2024-05-22 16:35:49] [INFO ] Implicit Places using invariants in 869 ms returned []
[2024-05-22 16:35:49] [INFO ] Invariant cache hit.
[2024-05-22 16:35:50] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:36:08] [INFO ] Implicit Places using invariants and state equation in 18251 ms returned []
Implicit Place search using SMT with State Equation took 19121 ms to find 0 implicit places.
[2024-05-22 16:36:08] [INFO ] Redundant transitions in 132 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:36:08] [INFO ] Invariant cache hit.
[2024-05-22 16:36:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32286ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51650 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 1024 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 214860 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 214860 steps, saw 36524 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-22 16:36:44] [INFO ] Invariant cache hit.
[2024-05-22 16:36:44] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:36:44] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:36:45] [INFO ] Deduced a trap composed of 47 places in 646 ms of which 7 ms to minimize.
[2024-05-22 16:36:45] [INFO ] Deduced a trap composed of 41 places in 595 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2823 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:36:47] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:36:47] [INFO ] Deduced a trap composed of 41 places in 639 ms of which 7 ms to minimize.
[2024-05-22 16:36:48] [INFO ] Deduced a trap composed of 38 places in 590 ms of which 7 ms to minimize.
[2024-05-22 16:36:48] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4776/4778 variables, and 4723 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3323 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1081/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6185ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 72 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 448 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 233180 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 233180 steps, saw 38666 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-22 16:36:53] [INFO ] Invariant cache hit.
[2024-05-22 16:36:53] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:36:53] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:36:54] [INFO ] Deduced a trap composed of 59 places in 645 ms of which 7 ms to minimize.
[2024-05-22 16:36:55] [INFO ] Deduced a trap composed of 62 places in 649 ms of which 7 ms to minimize.
[2024-05-22 16:36:55] [INFO ] Deduced a trap composed of 43 places in 619 ms of which 6 ms to minimize.
[2024-05-22 16:36:56] [INFO ] Deduced a trap composed of 44 places in 628 ms of which 6 ms to minimize.
[2024-05-22 16:36:56] [INFO ] Deduced a trap composed of 43 places in 609 ms of which 6 ms to minimize.
[2024-05-22 16:36:57] [INFO ] Deduced a trap composed of 44 places in 617 ms of which 6 ms to minimize.
[2024-05-22 16:36:58] [INFO ] Deduced a trap composed of 44 places in 582 ms of which 6 ms to minimize.
[2024-05-22 16:36:58] [INFO ] Deduced a trap composed of 45 places in 565 ms of which 7 ms to minimize.
[2024-05-22 16:36:59] [INFO ] Deduced a trap composed of 42 places in 589 ms of which 6 ms to minimize.
[2024-05-22 16:37:00] [INFO ] Deduced a trap composed of 38 places in 580 ms of which 6 ms to minimize.
[2024-05-22 16:37:00] [INFO ] Deduced a trap composed of 39 places in 582 ms of which 7 ms to minimize.
[2024-05-22 16:37:01] [INFO ] Deduced a trap composed of 47 places in 553 ms of which 6 ms to minimize.
[2024-05-22 16:37:01] [INFO ] Deduced a trap composed of 43 places in 561 ms of which 6 ms to minimize.
[2024-05-22 16:37:02] [INFO ] Deduced a trap composed of 36 places in 542 ms of which 5 ms to minimize.
[2024-05-22 16:37:02] [INFO ] Deduced a trap composed of 43 places in 553 ms of which 6 ms to minimize.
[2024-05-22 16:37:03] [INFO ] Deduced a trap composed of 35 places in 522 ms of which 5 ms to minimize.
[2024-05-22 16:37:03] [INFO ] Deduced a trap composed of 43 places in 510 ms of which 6 ms to minimize.
[2024-05-22 16:37:04] [INFO ] Deduced a trap composed of 41 places in 512 ms of which 5 ms to minimize.
[2024-05-22 16:37:05] [INFO ] Deduced a trap composed of 41 places in 532 ms of which 5 ms to minimize.
[2024-05-22 16:37:05] [INFO ] Deduced a trap composed of 40 places in 492 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:06] [INFO ] Deduced a trap composed of 40 places in 509 ms of which 5 ms to minimize.
[2024-05-22 16:37:06] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 5 ms to minimize.
[2024-05-22 16:37:07] [INFO ] Deduced a trap composed of 52 places in 456 ms of which 5 ms to minimize.
[2024-05-22 16:37:07] [INFO ] Deduced a trap composed of 49 places in 450 ms of which 6 ms to minimize.
[2024-05-22 16:37:07] [INFO ] Deduced a trap composed of 48 places in 408 ms of which 5 ms to minimize.
[2024-05-22 16:37:08] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 5 ms to minimize.
[2024-05-22 16:37:08] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 5 ms to minimize.
[2024-05-22 16:37:09] [INFO ] Deduced a trap composed of 44 places in 409 ms of which 5 ms to minimize.
[2024-05-22 16:37:09] [INFO ] Deduced a trap composed of 45 places in 375 ms of which 5 ms to minimize.
[2024-05-22 16:37:09] [INFO ] Deduced a trap composed of 46 places in 369 ms of which 4 ms to minimize.
[2024-05-22 16:37:10] [INFO ] Deduced a trap composed of 48 places in 351 ms of which 4 ms to minimize.
[2024-05-22 16:37:10] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 4 ms to minimize.
[2024-05-22 16:37:11] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18830 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:13] [INFO ] Deduced a trap composed of 41 places in 637 ms of which 7 ms to minimize.
[2024-05-22 16:37:13] [INFO ] Deduced a trap composed of 41 places in 618 ms of which 6 ms to minimize.
[2024-05-22 16:37:14] [INFO ] Deduced a trap composed of 38 places in 595 ms of which 6 ms to minimize.
[2024-05-22 16:37:15] [INFO ] Deduced a trap composed of 43 places in 573 ms of which 6 ms to minimize.
[2024-05-22 16:37:15] [INFO ] Deduced a trap composed of 34 places in 516 ms of which 6 ms to minimize.
[2024-05-22 16:37:16] [INFO ] Deduced a trap composed of 40 places in 512 ms of which 5 ms to minimize.
[2024-05-22 16:37:16] [INFO ] Deduced a trap composed of 41 places in 497 ms of which 6 ms to minimize.
[2024-05-22 16:37:17] [INFO ] Deduced a trap composed of 42 places in 502 ms of which 5 ms to minimize.
[2024-05-22 16:37:17] [INFO ] Deduced a trap composed of 42 places in 489 ms of which 5 ms to minimize.
[2024-05-22 16:37:18] [INFO ] Deduced a trap composed of 42 places in 500 ms of which 5 ms to minimize.
[2024-05-22 16:37:18] [INFO ] Deduced a trap composed of 39 places in 468 ms of which 5 ms to minimize.
[2024-05-22 16:37:19] [INFO ] Deduced a trap composed of 39 places in 487 ms of which 5 ms to minimize.
[2024-05-22 16:37:19] [INFO ] Deduced a trap composed of 41 places in 486 ms of which 5 ms to minimize.
[2024-05-22 16:37:20] [INFO ] Deduced a trap composed of 38 places in 487 ms of which 5 ms to minimize.
[2024-05-22 16:37:20] [INFO ] Deduced a trap composed of 38 places in 481 ms of which 6 ms to minimize.
[2024-05-22 16:37:21] [INFO ] Deduced a trap composed of 37 places in 480 ms of which 5 ms to minimize.
[2024-05-22 16:37:21] [INFO ] Deduced a trap composed of 42 places in 498 ms of which 5 ms to minimize.
[2024-05-22 16:37:22] [INFO ] Deduced a trap composed of 41 places in 503 ms of which 5 ms to minimize.
[2024-05-22 16:37:22] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 5 ms to minimize.
[2024-05-22 16:37:23] [INFO ] Deduced a trap composed of 38 places in 500 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:23] [INFO ] Deduced a trap composed of 40 places in 485 ms of which 5 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 39 places in 521 ms of which 5 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 41 places in 500 ms of which 6 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 37 places in 504 ms of which 5 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 37 places in 494 ms of which 6 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 36 places in 474 ms of which 6 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 39 places in 467 ms of which 5 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 38 places in 503 ms of which 6 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 37 places in 488 ms of which 5 ms to minimize.
[2024-05-22 16:37:28] [INFO ] Deduced a trap composed of 41 places in 467 ms of which 5 ms to minimize.
[2024-05-22 16:37:28] [INFO ] Deduced a trap composed of 50 places in 449 ms of which 6 ms to minimize.
[2024-05-22 16:37:29] [INFO ] Deduced a trap composed of 45 places in 433 ms of which 5 ms to minimize.
[2024-05-22 16:37:29] [INFO ] Deduced a trap composed of 47 places in 463 ms of which 5 ms to minimize.
[2024-05-22 16:37:30] [INFO ] Deduced a trap composed of 43 places in 463 ms of which 6 ms to minimize.
[2024-05-22 16:37:30] [INFO ] Deduced a trap composed of 44 places in 491 ms of which 5 ms to minimize.
[2024-05-22 16:37:31] [INFO ] Deduced a trap composed of 46 places in 464 ms of which 5 ms to minimize.
[2024-05-22 16:37:31] [INFO ] Deduced a trap composed of 42 places in 460 ms of which 5 ms to minimize.
[2024-05-22 16:37:32] [INFO ] Deduced a trap composed of 42 places in 448 ms of which 5 ms to minimize.
[2024-05-22 16:37:32] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 5 ms to minimize.
[2024-05-22 16:37:33] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:33] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 5 ms to minimize.
[2024-05-22 16:37:34] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 4 ms to minimize.
[2024-05-22 16:37:34] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 4 ms to minimize.
[2024-05-22 16:37:34] [INFO ] Deduced a trap composed of 44 places in 396 ms of which 4 ms to minimize.
[2024-05-22 16:37:35] [INFO ] Deduced a trap composed of 44 places in 406 ms of which 5 ms to minimize.
[2024-05-22 16:37:35] [INFO ] Deduced a trap composed of 42 places in 370 ms of which 4 ms to minimize.
[2024-05-22 16:37:36] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 4 ms to minimize.
[2024-05-22 16:37:36] [INFO ] Deduced a trap composed of 45 places in 397 ms of which 5 ms to minimize.
[2024-05-22 16:37:36] [INFO ] Deduced a trap composed of 45 places in 404 ms of which 5 ms to minimize.
[2024-05-22 16:37:37] [INFO ] Deduced a trap composed of 45 places in 402 ms of which 5 ms to minimize.
[2024-05-22 16:37:37] [INFO ] Deduced a trap composed of 43 places in 411 ms of which 5 ms to minimize.
[2024-05-22 16:37:38] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 4 ms to minimize.
[2024-05-22 16:37:38] [INFO ] Deduced a trap composed of 40 places in 369 ms of which 4 ms to minimize.
[2024-05-22 16:37:38] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 4 ms to minimize.
[2024-05-22 16:37:39] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 4 ms to minimize.
[2024-05-22 16:37:39] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 3 ms to minimize.
[2024-05-22 16:37:39] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 3 ms to minimize.
[2024-05-22 16:37:40] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 4 ms to minimize.
[2024-05-22 16:37:40] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 4 ms to minimize.
[2024-05-22 16:37:40] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:41] [INFO ] Deduced a trap composed of 46 places in 320 ms of which 4 ms to minimize.
[2024-05-22 16:37:41] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 4 ms to minimize.
[2024-05-22 16:37:41] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 3 ms to minimize.
[2024-05-22 16:37:42] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 4 ms to minimize.
[2024-05-22 16:37:42] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 4 ms to minimize.
[2024-05-22 16:37:42] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 4 ms to minimize.
[2024-05-22 16:37:42] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 4 ms to minimize.
[2024-05-22 16:37:43] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 4 ms to minimize.
[2024-05-22 16:37:43] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 4 ms to minimize.
[2024-05-22 16:37:43] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 3 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 4 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:37:45] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2024-05-22 16:37:45] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 2 ms to minimize.
[2024-05-22 16:37:45] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-05-22 16:37:45] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1081 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1081 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3695/4776 variables, 1081/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4776 variables, 3603/4843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4776 variables, 1/4844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4776 variables, 0/4844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/4778 variables, 2/4846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4778 variables, 0/4846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4778 variables, 0/4846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4846 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37721 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 127/127 constraints]
After SMT, in 56589ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:37:50] [INFO ] Invariant cache hit.
[2024-05-22 16:37:51] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-22 16:37:51] [INFO ] Invariant cache hit.
[2024-05-22 16:37:51] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:38:08] [INFO ] Implicit Places using invariants and state equation in 17832 ms returned []
Implicit Place search using SMT with State Equation took 18725 ms to find 0 implicit places.
[2024-05-22 16:38:09] [INFO ] Redundant transitions in 123 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:38:09] [INFO ] Invariant cache hit.
[2024-05-22 16:38:09] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32368ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51322 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-12 in 192465 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:38:41] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 85 ms. (116 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-05-22 16:38:41] [INFO ] Invariant cache hit.
[2024-05-22 16:38:41] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:38:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:38:42] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-22 16:38:42] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:38:42] [INFO ] [Real]Added 3582 Read/Feed constraints in 247 ms returned sat
[2024-05-22 16:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:38:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:38:43] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-05-22 16:38:43] [INFO ] [Nat]Added 3582 Read/Feed constraints in 244 ms returned sat
[2024-05-22 16:38:43] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-22 16:38:44] [INFO ] Added : 2 causal constraints over 2 iterations in 632 ms. Result :sat
Minimization took 948 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 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 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 250 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:38:45] [INFO ] Computed 32 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (7136 resets) in 7765 ms. (128 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 901 ms. (1108 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:38:54] [INFO ] Invariant cache hit.
[2024-05-22 16:38:54] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:38:54] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:38:55] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-22 16:38:55] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:38:55] [INFO ] [Real]Added 3603 Read/Feed constraints in 255 ms returned sat
[2024-05-22 16:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:55] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:38:55] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:38:56] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2024-05-22 16:38:56] [INFO ] [Nat]Added 3603 Read/Feed constraints in 289 ms returned sat
[2024-05-22 16:38:56] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 176 ms.
[2024-05-22 16:38:57] [INFO ] Added : 8 causal constraints over 2 iterations in 638 ms. Result :sat
Minimization took 4526 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:39:01] [INFO ] Invariant cache hit.
[2024-05-22 16:39:02] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-22 16:39:02] [INFO ] Invariant cache hit.
[2024-05-22 16:39:03] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:39:20] [INFO ] Implicit Places using invariants and state equation in 17638 ms returned []
Implicit Place search using SMT with State Equation took 18524 ms to find 0 implicit places.
[2024-05-22 16:39:20] [INFO ] Redundant transitions in 122 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:39:20] [INFO ] Invariant cache hit.
[2024-05-22 16:39:20] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32533ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51287 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-22 16:39:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7154 resets) in 7778 ms. (128 steps per ms)
BEST_FIRST walk for 1000001 steps (207 resets) in 925 ms. (1079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:40:01] [INFO ] Invariant cache hit.
[2024-05-22 16:40:01] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:40:01] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:40:02] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-22 16:40:02] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:40:02] [INFO ] [Real]Added 3603 Read/Feed constraints in 252 ms returned sat
[2024-05-22 16:40:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:40:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:40:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:40:03] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-22 16:40:03] [INFO ] [Nat]Added 3603 Read/Feed constraints in 285 ms returned sat
[2024-05-22 16:40:04] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-22 16:40:04] [INFO ] Added : 8 causal constraints over 2 iterations in 636 ms. Result :sat
Minimization took 4524 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 63 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 63 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:40:09] [INFO ] Invariant cache hit.
[2024-05-22 16:40:10] [INFO ] Implicit Places using invariants in 893 ms returned []
[2024-05-22 16:40:10] [INFO ] Invariant cache hit.
[2024-05-22 16:40:11] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:40:29] [INFO ] Implicit Places using invariants and state equation in 19252 ms returned []
Implicit Place search using SMT with State Equation took 20148 ms to find 0 implicit places.
[2024-05-22 16:40:29] [INFO ] Redundant transitions in 122 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:40:29] [INFO ] Invariant cache hit.
[2024-05-22 16:40:29] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32361ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52738 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (285 resets) in 1323 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 216028 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 216028 steps, saw 36643 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-22 16:41:05] [INFO ] Invariant cache hit.
[2024-05-22 16:41:05] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:41:05] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:41:06] [INFO ] Deduced a trap composed of 52 places in 649 ms of which 6 ms to minimize.
[2024-05-22 16:41:07] [INFO ] Deduced a trap composed of 37 places in 592 ms of which 6 ms to minimize.
[2024-05-22 16:41:07] [INFO ] Deduced a trap composed of 40 places in 608 ms of which 6 ms to minimize.
[2024-05-22 16:41:08] [INFO ] Deduced a trap composed of 36 places in 576 ms of which 6 ms to minimize.
[2024-05-22 16:41:08] [INFO ] Deduced a trap composed of 35 places in 587 ms of which 6 ms to minimize.
[2024-05-22 16:41:09] [INFO ] Deduced a trap composed of 37 places in 537 ms of which 6 ms to minimize.
[2024-05-22 16:41:09] [INFO ] Deduced a trap composed of 37 places in 532 ms of which 6 ms to minimize.
[2024-05-22 16:41:10] [INFO ] Deduced a trap composed of 42 places in 504 ms of which 5 ms to minimize.
SMT process timed out in 5063ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 405 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 233878 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 233878 steps, saw 38771 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-22 16:41:13] [INFO ] Invariant cache hit.
[2024-05-22 16:41:13] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:41:13] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:41:14] [INFO ] Deduced a trap composed of 38 places in 640 ms of which 6 ms to minimize.
[2024-05-22 16:41:15] [INFO ] Deduced a trap composed of 39 places in 620 ms of which 6 ms to minimize.
[2024-05-22 16:41:15] [INFO ] Deduced a trap composed of 38 places in 576 ms of which 6 ms to minimize.
[2024-05-22 16:41:16] [INFO ] Deduced a trap composed of 36 places in 591 ms of which 6 ms to minimize.
[2024-05-22 16:41:17] [INFO ] Deduced a trap composed of 47 places in 579 ms of which 6 ms to minimize.
[2024-05-22 16:41:17] [INFO ] Deduced a trap composed of 44 places in 563 ms of which 6 ms to minimize.
[2024-05-22 16:41:18] [INFO ] Deduced a trap composed of 40 places in 558 ms of which 6 ms to minimize.
[2024-05-22 16:41:18] [INFO ] Deduced a trap composed of 39 places in 529 ms of which 6 ms to minimize.
[2024-05-22 16:41:19] [INFO ] Deduced a trap composed of 41 places in 548 ms of which 6 ms to minimize.
[2024-05-22 16:41:19] [INFO ] Deduced a trap composed of 43 places in 565 ms of which 6 ms to minimize.
[2024-05-22 16:41:20] [INFO ] Deduced a trap composed of 39 places in 524 ms of which 5 ms to minimize.
[2024-05-22 16:41:21] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 5 ms to minimize.
[2024-05-22 16:41:21] [INFO ] Deduced a trap composed of 43 places in 494 ms of which 5 ms to minimize.
[2024-05-22 16:41:22] [INFO ] Deduced a trap composed of 41 places in 477 ms of which 5 ms to minimize.
[2024-05-22 16:41:22] [INFO ] Deduced a trap composed of 42 places in 488 ms of which 5 ms to minimize.
[2024-05-22 16:41:23] [INFO ] Deduced a trap composed of 40 places in 494 ms of which 5 ms to minimize.
[2024-05-22 16:41:23] [INFO ] Deduced a trap composed of 35 places in 461 ms of which 5 ms to minimize.
[2024-05-22 16:41:23] [INFO ] Deduced a trap composed of 37 places in 419 ms of which 5 ms to minimize.
[2024-05-22 16:41:24] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 5 ms to minimize.
[2024-05-22 16:41:24] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:41:25] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 5 ms to minimize.
[2024-05-22 16:41:25] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 5 ms to minimize.
[2024-05-22 16:41:25] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 4 ms to minimize.
[2024-05-22 16:41:26] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 4 ms to minimize.
[2024-05-22 16:41:26] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 4 ms to minimize.
[2024-05-22 16:41:26] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 3 ms to minimize.
[2024-05-22 16:41:27] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 4 ms to minimize.
[2024-05-22 16:41:27] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 4 ms to minimize.
[2024-05-22 16:41:27] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 4 ms to minimize.
[2024-05-22 16:41:28] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3695/4776 variables, 1081/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 3603/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15508 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:41:29] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:41:30] [INFO ] Deduced a trap composed of 38 places in 624 ms of which 6 ms to minimize.
[2024-05-22 16:41:30] [INFO ] Deduced a trap composed of 37 places in 639 ms of which 6 ms to minimize.
[2024-05-22 16:41:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 16:41:30] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints]
After SMT, in 19056ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 66 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:41:32] [INFO ] Invariant cache hit.
[2024-05-22 16:41:33] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-05-22 16:41:33] [INFO ] Invariant cache hit.
[2024-05-22 16:41:34] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:41:52] [INFO ] Implicit Places using invariants and state equation in 18479 ms returned []
Implicit Place search using SMT with State Equation took 19358 ms to find 0 implicit places.
[2024-05-22 16:41:52] [INFO ] Redundant transitions in 128 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:41:52] [INFO ] Invariant cache hit.
[2024-05-22 16:41:52] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32398ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51993 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 1 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:42:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 16:42:24] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:42:24] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:42:24] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:42:24] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 50 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-13 in 223539 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:42:25] [INFO ] Computed 32 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 81 ms. (121 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:42:25] [INFO ] Invariant cache hit.
[2024-05-22 16:42:25] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:42:25] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:42:25] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-22 16:42:25] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:42:26] [INFO ] [Real]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-22 16:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:42:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:42:26] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:42:26] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-22 16:42:27] [INFO ] [Nat]Added 3582 Read/Feed constraints in 367 ms returned sat
[2024-05-22 16:42:27] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-22 16:42:28] [INFO ] Added : 9 causal constraints over 2 iterations in 634 ms. Result :sat
Minimization took 947 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1083 transition count 3695
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 1083 transition count 3694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 1082 transition count 3694
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1082 transition count 3694
Applied a total of 24 rules in 238 ms. Remains 1082 /1090 variables (removed 8) and now considering 3694/3702 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-22 16:42:29] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7130 resets) in 7550 ms. (132 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 894 ms. (1117 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:42:37] [INFO ] Invariant cache hit.
[2024-05-22 16:42:37] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:42:37] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:42:38] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-22 16:42:38] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:42:38] [INFO ] [Real]Added 3604 Read/Feed constraints in 248 ms returned sat
[2024-05-22 16:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:42:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:42:39] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:42:39] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2024-05-22 16:42:39] [INFO ] [Nat]Added 3604 Read/Feed constraints in 362 ms returned sat
[2024-05-22 16:42:40] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 213 ms.
[2024-05-22 16:42:40] [INFO ] Added : 13 causal constraints over 3 iterations in 811 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 72 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:42:45] [INFO ] Invariant cache hit.
[2024-05-22 16:42:46] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-22 16:42:46] [INFO ] Invariant cache hit.
[2024-05-22 16:42:47] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:43:05] [INFO ] Implicit Places using invariants and state equation in 19212 ms returned []
Implicit Place search using SMT with State Equation took 20070 ms to find 0 implicit places.
[2024-05-22 16:43:05] [INFO ] Redundant transitions in 127 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:43:05] [INFO ] Invariant cache hit.
[2024-05-22 16:43:05] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32364ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52667 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (288 resets) in 960 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 212586 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 212586 steps, saw 36267 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-22 16:43:41] [INFO ] Invariant cache hit.
[2024-05-22 16:43:41] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:43:41] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:43:42] [INFO ] Deduced a trap composed of 37 places in 620 ms of which 7 ms to minimize.
[2024-05-22 16:43:43] [INFO ] Deduced a trap composed of 38 places in 587 ms of which 6 ms to minimize.
[2024-05-22 16:43:43] [INFO ] Deduced a trap composed of 38 places in 581 ms of which 6 ms to minimize.
[2024-05-22 16:43:44] [INFO ] Deduced a trap composed of 46 places in 577 ms of which 6 ms to minimize.
[2024-05-22 16:43:44] [INFO ] Deduced a trap composed of 45 places in 588 ms of which 6 ms to minimize.
[2024-05-22 16:43:45] [INFO ] Deduced a trap composed of 49 places in 574 ms of which 6 ms to minimize.
[2024-05-22 16:43:46] [INFO ] Deduced a trap composed of 70 places in 581 ms of which 6 ms to minimize.
[2024-05-22 16:43:46] [INFO ] Deduced a trap composed of 52 places in 555 ms of which 6 ms to minimize.
SMT process timed out in 5149ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 68 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234935 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234935 steps, saw 38895 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-22 16:43:49] [INFO ] Invariant cache hit.
[2024-05-22 16:43:49] [INFO ] State equation strengthened by 3604 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:43:50] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1078 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1080 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:43:50] [INFO ] Deduced a trap composed of 38 places in 594 ms of which 6 ms to minimize.
[2024-05-22 16:43:51] [INFO ] Deduced a trap composed of 37 places in 595 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3694/4774 variables, 1080/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4774 variables, 3604/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4776 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4776 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2629 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:43:52] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1078 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1080 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:43:53] [INFO ] Deduced a trap composed of 41 places in 641 ms of which 7 ms to minimize.
[2024-05-22 16:43:54] [INFO ] Deduced a trap composed of 43 places in 613 ms of which 7 ms to minimize.
[2024-05-22 16:43:54] [INFO ] Deduced a trap composed of 40 places in 645 ms of which 6 ms to minimize.
[2024-05-22 16:43:55] [INFO ] Deduced a trap composed of 46 places in 609 ms of which 6 ms to minimize.
[2024-05-22 16:43:55] [INFO ] Deduced a trap composed of 38 places in 605 ms of which 6 ms to minimize.
[2024-05-22 16:43:56] [INFO ] Deduced a trap composed of 52 places in 610 ms of which 6 ms to minimize.
[2024-05-22 16:43:57] [INFO ] Deduced a trap composed of 43 places in 576 ms of which 6 ms to minimize.
[2024-05-22 16:43:57] [INFO ] Deduced a trap composed of 45 places in 579 ms of which 6 ms to minimize.
[2024-05-22 16:43:58] [INFO ] Deduced a trap composed of 43 places in 586 ms of which 6 ms to minimize.
[2024-05-22 16:43:58] [INFO ] Deduced a trap composed of 44 places in 572 ms of which 5 ms to minimize.
[2024-05-22 16:43:59] [INFO ] Deduced a trap composed of 42 places in 561 ms of which 6 ms to minimize.
[2024-05-22 16:44:00] [INFO ] Deduced a trap composed of 43 places in 567 ms of which 6 ms to minimize.
[2024-05-22 16:44:00] [INFO ] Deduced a trap composed of 46 places in 568 ms of which 6 ms to minimize.
[2024-05-22 16:44:01] [INFO ] Deduced a trap composed of 45 places in 566 ms of which 6 ms to minimize.
[2024-05-22 16:44:01] [INFO ] Deduced a trap composed of 44 places in 566 ms of which 6 ms to minimize.
[2024-05-22 16:44:02] [INFO ] Deduced a trap composed of 42 places in 561 ms of which 5 ms to minimize.
[2024-05-22 16:44:02] [INFO ] Deduced a trap composed of 42 places in 499 ms of which 5 ms to minimize.
[2024-05-22 16:44:03] [INFO ] Deduced a trap composed of 39 places in 557 ms of which 6 ms to minimize.
[2024-05-22 16:44:04] [INFO ] Deduced a trap composed of 48 places in 536 ms of which 6 ms to minimize.
[2024-05-22 16:44:04] [INFO ] Deduced a trap composed of 46 places in 510 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:05] [INFO ] Deduced a trap composed of 46 places in 535 ms of which 6 ms to minimize.
[2024-05-22 16:44:05] [INFO ] Deduced a trap composed of 45 places in 497 ms of which 5 ms to minimize.
[2024-05-22 16:44:06] [INFO ] Deduced a trap composed of 45 places in 474 ms of which 5 ms to minimize.
[2024-05-22 16:44:06] [INFO ] Deduced a trap composed of 42 places in 457 ms of which 5 ms to minimize.
[2024-05-22 16:44:07] [INFO ] Deduced a trap composed of 47 places in 478 ms of which 6 ms to minimize.
[2024-05-22 16:44:07] [INFO ] Deduced a trap composed of 46 places in 454 ms of which 5 ms to minimize.
[2024-05-22 16:44:08] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 4 ms to minimize.
[2024-05-22 16:44:08] [INFO ] Deduced a trap composed of 46 places in 462 ms of which 5 ms to minimize.
[2024-05-22 16:44:09] [INFO ] Deduced a trap composed of 47 places in 453 ms of which 5 ms to minimize.
[2024-05-22 16:44:09] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 5 ms to minimize.
[2024-05-22 16:44:09] [INFO ] Deduced a trap composed of 41 places in 426 ms of which 5 ms to minimize.
[2024-05-22 16:44:10] [INFO ] Deduced a trap composed of 40 places in 449 ms of which 5 ms to minimize.
[2024-05-22 16:44:10] [INFO ] Deduced a trap composed of 45 places in 439 ms of which 4 ms to minimize.
[2024-05-22 16:44:11] [INFO ] Deduced a trap composed of 45 places in 457 ms of which 5 ms to minimize.
[2024-05-22 16:44:11] [INFO ] Deduced a trap composed of 45 places in 415 ms of which 5 ms to minimize.
[2024-05-22 16:44:12] [INFO ] Deduced a trap composed of 45 places in 455 ms of which 5 ms to minimize.
[2024-05-22 16:44:12] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 5 ms to minimize.
[2024-05-22 16:44:13] [INFO ] Deduced a trap composed of 44 places in 405 ms of which 4 ms to minimize.
[2024-05-22 16:44:13] [INFO ] Deduced a trap composed of 39 places in 370 ms of which 5 ms to minimize.
[2024-05-22 16:44:13] [INFO ] Deduced a trap composed of 41 places in 324 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:14] [INFO ] Deduced a trap composed of 56 places in 317 ms of which 4 ms to minimize.
[2024-05-22 16:44:14] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 4 ms to minimize.
[2024-05-22 16:44:14] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 4 ms to minimize.
[2024-05-22 16:44:15] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 4 ms to minimize.
[2024-05-22 16:44:15] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 4 ms to minimize.
[2024-05-22 16:44:15] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 4 ms to minimize.
[2024-05-22 16:44:16] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 4 ms to minimize.
[2024-05-22 16:44:16] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 4 ms to minimize.
[2024-05-22 16:44:16] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
[2024-05-22 16:44:16] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 4 ms to minimize.
[2024-05-22 16:44:17] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 4 ms to minimize.
[2024-05-22 16:44:17] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 4 ms to minimize.
[2024-05-22 16:44:17] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
[2024-05-22 16:44:17] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 3 ms to minimize.
[2024-05-22 16:44:18] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:44:18] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 3 ms to minimize.
[2024-05-22 16:44:18] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-05-22 16:44:18] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2024-05-22 16:44:19] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 3 ms to minimize.
[2024-05-22 16:44:19] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:19] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 3 ms to minimize.
[2024-05-22 16:44:19] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 3 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 3 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 3 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3694/4774 variables, 1080/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4774 variables, 3604/4806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 1/4807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/4776 variables, 2/4809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4776 variables, 0/4809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4776 variables, 0/4809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4809 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32966 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1082/1082 constraints, ReadFeed: 3604/3604 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 90/90 constraints]
After SMT, in 35630ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 64 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1082/1082 places, 3694/3694 transitions.
Applied a total of 0 rules in 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-22 16:44:25] [INFO ] Invariant cache hit.
[2024-05-22 16:44:26] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-22 16:44:26] [INFO ] Invariant cache hit.
[2024-05-22 16:44:27] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-22 16:44:44] [INFO ] Implicit Places using invariants and state equation in 18090 ms returned []
Implicit Place search using SMT with State Equation took 18976 ms to find 0 implicit places.
[2024-05-22 16:44:44] [INFO ] Redundant transitions in 127 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-22 16:44:44] [INFO ] Invariant cache hit.
[2024-05-22 16:44:44] [INFO ] State equation strengthened by 3604 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 32331ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51537 ms. Remains : 1082/1082 places, 3694/3694 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3511 edges and 1082 vertex of which 958 / 1082 are part of one of the 2 SCC in 1 ms
Free SCC test removed 956 places
Drop transitions (Empty/Sink Transition effects.) removed 2643 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3565 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 7 ms. Remains 4 /1082 variables (removed 1078) and now considering 5/3694 (removed 3689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:45:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 16:45:17] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:45:17] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:45:17] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:45:17] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 51 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-14 in 172169 ms.
Starting property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-22 16:45:17] [INFO ] Computed 32 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 82 ms. (120 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-05-22 16:45:17] [INFO ] Invariant cache hit.
[2024-05-22 16:45:17] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:45:17] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-22 16:45:17] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-22 16:45:18] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-22 16:45:18] [INFO ] [Real]Added 3582 Read/Feed constraints in 260 ms returned sat
[2024-05-22 16:45:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:45:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:45:18] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:45:19] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-22 16:45:19] [INFO ] [Nat]Added 3582 Read/Feed constraints in 243 ms returned sat
[2024-05-22 16:45:19] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-22 16:45:19] [INFO ] Added : 1 causal constraints over 1 iterations in 515 ms. Result :sat
Minimization took 943 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 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 1084 transition count 3696
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1084 transition count 3695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 1083 transition count 3695
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 1083 transition count 3695
Applied a total of 23 rules in 327 ms. Remains 1083 /1090 variables (removed 7) and now considering 3695/3702 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-22 16:45:21] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (7150 resets) in 7569 ms. (132 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 908 ms. (1100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:45:29] [INFO ] Invariant cache hit.
[2024-05-22 16:45:29] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-22 16:45:29] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-22 16:45:30] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2024-05-22 16:45:30] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:45:30] [INFO ] [Real]Added 3603 Read/Feed constraints in 273 ms returned sat
[2024-05-22 16:45:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:45:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-22 16:45:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:45:31] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-22 16:45:31] [INFO ] [Nat]Added 3603 Read/Feed constraints in 292 ms returned sat
[2024-05-22 16:45:32] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-22 16:45:32] [INFO ] Added : 8 causal constraints over 2 iterations in 655 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:45:37] [INFO ] Invariant cache hit.
[2024-05-22 16:45:38] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-22 16:45:38] [INFO ] Invariant cache hit.
[2024-05-22 16:45:38] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:45:58] [INFO ] Implicit Places using invariants and state equation in 19921 ms returned []
Implicit Place search using SMT with State Equation took 20785 ms to find 0 implicit places.
[2024-05-22 16:45:58] [INFO ] Redundant transitions in 120 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:45:58] [INFO ] Invariant cache hit.
[2024-05-22 16:45:58] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32382ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53394 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-22 16:46:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7144 resets) in 7626 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 976 ms. (1023 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-22 16:46:39] [INFO ] Invariant cache hit.
[2024-05-22 16:46:39] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-22 16:46:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 16:46:39] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2024-05-22 16:46:40] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:46:40] [INFO ] [Real]Added 3603 Read/Feed constraints in 277 ms returned sat
[2024-05-22 16:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:46:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-22 16:46:40] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-22 16:46:41] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-22 16:46:41] [INFO ] [Nat]Added 3603 Read/Feed constraints in 296 ms returned sat
[2024-05-22 16:46:41] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-22 16:46:42] [INFO ] Added : 8 causal constraints over 2 iterations in 645 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[30]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:46:46] [INFO ] Invariant cache hit.
[2024-05-22 16:46:47] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-22 16:46:47] [INFO ] Invariant cache hit.
[2024-05-22 16:46:48] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:47:07] [INFO ] Implicit Places using invariants and state equation in 20172 ms returned []
Implicit Place search using SMT with State Equation took 21052 ms to find 0 implicit places.
[2024-05-22 16:47:07] [INFO ] Redundant transitions in 121 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:47:08] [INFO ] Invariant cache hit.
[2024-05-22 16:47:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
(s1076 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 1.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 1.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 1.0)
(s918 0.0)
(s919 1.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 1.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 1.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32304ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53591 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (286 resets) in 919 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 216362 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 216362 steps, saw 36985 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-22 16:47:43] [INFO ] Invariant cache hit.
[2024-05-22 16:47:43] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:47:43] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:47:44] [INFO ] Deduced a trap composed of 52 places in 647 ms of which 7 ms to minimize.
[2024-05-22 16:47:45] [INFO ] Deduced a trap composed of 37 places in 592 ms of which 6 ms to minimize.
[2024-05-22 16:47:45] [INFO ] Deduced a trap composed of 40 places in 598 ms of which 6 ms to minimize.
[2024-05-22 16:47:46] [INFO ] Deduced a trap composed of 42 places in 563 ms of which 6 ms to minimize.
[2024-05-22 16:47:47] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 6 ms to minimize.
[2024-05-22 16:47:47] [INFO ] Deduced a trap composed of 39 places in 527 ms of which 6 ms to minimize.
[2024-05-22 16:47:48] [INFO ] Deduced a trap composed of 37 places in 504 ms of which 6 ms to minimize.
[2024-05-22 16:47:48] [INFO ] Deduced a trap composed of 47 places in 500 ms of which 6 ms to minimize.
[2024-05-22 16:47:49] [INFO ] Deduced a trap composed of 37 places in 479 ms of which 6 ms to minimize.
SMT process timed out in 5438ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 68 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 697 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 238770 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 238770 steps, saw 39626 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-22 16:47:52] [INFO ] Invariant cache hit.
[2024-05-22 16:47:52] [INFO ] State equation strengthened by 3603 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:47:52] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:47:53] [INFO ] Deduced a trap composed of 35 places in 564 ms of which 6 ms to minimize.
[2024-05-22 16:47:53] [INFO ] Deduced a trap composed of 34 places in 541 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3603/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2611 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:47:55] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:47:55] [INFO ] Deduced a trap composed of 60 places in 612 ms of which 6 ms to minimize.
[2024-05-22 16:47:56] [INFO ] Deduced a trap composed of 37 places in 570 ms of which 6 ms to minimize.
[2024-05-22 16:47:56] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4776 variables, 1081/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 3603/4723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4776 variables, 1/4724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4776 variables, 0/4724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4778 variables, 2/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4778 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4778 variables, 0/4726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4726 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3853 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3603/3603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 6499ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3695/3695 transitions.
Applied a total of 0 rules in 63 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-22 16:47:59] [INFO ] Invariant cache hit.
[2024-05-22 16:47:59] [INFO ] Implicit Places using invariants in 869 ms returned []
[2024-05-22 16:47:59] [INFO ] Invariant cache hit.
[2024-05-22 16:48:00] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-22 16:48:18] [INFO ] Implicit Places using invariants and state equation in 18948 ms returned []
Implicit Place search using SMT with State Equation took 19818 ms to find 0 implicit places.
[2024-05-22 16:48:19] [INFO ] Redundant transitions in 130 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-22 16:48:19] [INFO ] Invariant cache hit.
[2024-05-22 16:48:19] [INFO ] State equation strengthened by 3603 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32287ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52342 ms. Remains : 1083/1083 places, 3695/3695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3512 edges and 1083 vertex of which 959 / 1083 are part of one of the 2 SCC in 0 ms
Free SCC test removed 957 places
Drop transitions (Empty/Sink Transition effects.) removed 2644 transitions
Ensure Unique test removed 922 transitions
Reduce isomorphic transitions removed 3566 transitions.
Graph (complete) has 311 edges and 126 vertex of which 35 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.0 ms
Discarding 91 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 35 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 34 transition count 38
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 6 transition count 10
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 4 transition count 5
Applied a total of 127 rules in 6 ms. Remains 4 /1083 variables (removed 1079) and now considering 5/3695 (removed 3690) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 16:48:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 16:48:51] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:48:51] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:48:51] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:48:51] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 55 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[30]
Ending property specific reduction for CANInsertWithFailure-PT-030-UpperBounds-15 in 214263 ms.
[2024-05-22 16:48:51] [INFO ] Flatten gal took : 205 ms
[2024-05-22 16:48:51] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-22 16:48:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1090 places, 3702 transitions and 14836 arcs took 16 ms.
Total runtime 3298329 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-030
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1090
TRANSITIONS: 3702
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.063s, Sys 0.015s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 5570
MODEL NAME: /home/mcc/execution/413/model
1090 places, 3702 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r069-tall-171620503800117"
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 ;