About the Execution of ITS-Tools for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15258.096 | 3600000.00 | 5556608.00 | 7751.00 | ? ? ? ? ? 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.r070-tall-171620505200117.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 itstools
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 r070-tall-171620505200117
=====================================================================
--------------------
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 1716243114213
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-20 22:11:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:11:55] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2024-05-20 22:11:55] [INFO ] Transformed 2164 places.
[2024-05-20 22:11:55] [INFO ] Transformed 5580 transitions.
[2024-05-20 22:11:55] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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-20 22:11:56] [INFO ] Computed 33 invariants in 244 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 102 ms. (97 steps per ms)
FORMULA CANInsertWithFailure-PT-030-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 161 ms. (926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1] Max Struct:[30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
[2024-05-20 22:11:56] [INFO ] Invariant cache hit.
[2024-05-20 22:11:56] [INFO ] [Real]Absence check using 31 positive place invariants in 43 ms returned sat
[2024-05-20 22:11:57] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-20 22:11:58] [INFO ] [Real]Absence check using state equation in 1345 ms returned sat
[2024-05-20 22:11:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 22:11:58] [INFO ] [Real]Added 1770 Read/Feed constraints in 165 ms returned sat
[2024-05-20 22:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:11:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2024-05-20 22:11:59] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:00] [INFO ] [Nat]Absence check using state equation in 1299 ms returned sat
[2024-05-20 22:12:01] [INFO ] [Nat]Added 1770 Read/Feed constraints in 574 ms returned sat
[2024-05-20 22:12:01] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 307 ms.
[2024-05-20 22:12:02] [INFO ] Added : 10 causal constraints over 2 iterations in 1104 ms. Result :sat
Minimization took 1488 ms.
[2024-05-20 22:12:04] [INFO ] [Real]Absence check using 31 positive place invariants in 36 ms returned sat
[2024-05-20 22:12:04] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-20 22:12:05] [INFO ] [Real]Absence check using state equation in 1288 ms returned sat
[2024-05-20 22:12:05] [INFO ] [Real]Added 1770 Read/Feed constraints in 151 ms returned sat
[2024-05-20 22:12:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2024-05-20 22:12:06] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:07] [INFO ] [Nat]Absence check using state equation in 1295 ms returned sat
[2024-05-20 22:12:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:08] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1090 ms returned unknown
[2024-05-20 22:12:08] [INFO ] [Real]Absence check using 31 positive place invariants in 35 ms returned sat
[2024-05-20 22:12:08] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-20 22:12:10] [INFO ] [Real]Absence check using state equation in 1502 ms returned sat
[2024-05-20 22:12:10] [INFO ] [Real]Added 1770 Read/Feed constraints in 207 ms returned sat
[2024-05-20 22:12:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2024-05-20 22:12:10] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:12] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2024-05-20 22:12:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:13] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1086 ms returned unknown
[2024-05-20 22:12:13] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:12:13] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:15] [INFO ] [Real]Absence check using state equation in 1389 ms returned sat
[2024-05-20 22:12:15] [INFO ] [Real]Added 1770 Read/Feed constraints in 161 ms returned sat
[2024-05-20 22:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:12:15] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:17] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2024-05-20 22:12:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:18] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1100 ms returned unknown
[2024-05-20 22:12:18] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-20 22:12:18] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:19] [INFO ] [Real]Absence check using state equation in 1493 ms returned sat
[2024-05-20 22:12:20] [INFO ] [Real]Added 1770 Read/Feed constraints in 401 ms returned sat
[2024-05-20 22:12:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-20 22:12:20] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-20 22:12:22] [INFO ] [Nat]Absence check using state equation in 1514 ms returned sat
[2024-05-20 22:12:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:23] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1090 ms returned unknown
[2024-05-20 22:12:23] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:12:23] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:25] [INFO ] [Real]Absence check using state equation in 1494 ms returned sat
[2024-05-20 22:12:25] [INFO ] [Real]Added 1770 Read/Feed constraints in 208 ms returned sat
[2024-05-20 22:12:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:12:25] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 22:12:27] [INFO ] [Nat]Absence check using state equation in 1489 ms returned sat
[2024-05-20 22:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:28] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1080 ms returned unknown
[2024-05-20 22:12:28] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:12:28] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:30] [INFO ] [Real]Absence check using state equation in 1444 ms returned sat
[2024-05-20 22:12:30] [INFO ] [Real]Added 1770 Read/Feed constraints in 155 ms returned sat
[2024-05-20 22:12:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-20 22:12:30] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:32] [INFO ] [Nat]Absence check using state equation in 1482 ms returned sat
[2024-05-20 22:12:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:33] [INFO ] [Nat]Added 1770 Read/Feed constraints in 763 ms returned sat
[2024-05-20 22:12:33] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 237 ms.
[2024-05-20 22:12:34] [INFO ] Added : 11 causal constraints over 3 iterations in 1100 ms. Result :sat
Minimization took 1279 ms.
[2024-05-20 22:12:35] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:12:35] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:37] [INFO ] [Real]Absence check using state equation in 1519 ms returned sat
[2024-05-20 22:12:37] [INFO ] [Real]Added 1770 Read/Feed constraints in 193 ms returned sat
[2024-05-20 22:12:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:12:37] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:39] [INFO ] [Nat]Absence check using state equation in 1481 ms returned sat
[2024-05-20 22:12:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:40] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1083 ms returned unknown
[2024-05-20 22:12:40] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-20 22:12:40] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:42] [INFO ] [Real]Absence check using state equation in 1486 ms returned sat
[2024-05-20 22:12:42] [INFO ] [Real]Added 1770 Read/Feed constraints in 215 ms returned sat
[2024-05-20 22:12:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:12:42] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:44] [INFO ] [Nat]Absence check using state equation in 1450 ms returned sat
[2024-05-20 22:12:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:45] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1082 ms returned unknown
[2024-05-20 22:12:45] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:12:45] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:47] [INFO ] [Real]Absence check using state equation in 1758 ms returned sat
[2024-05-20 22:12:47] [INFO ] [Real]Added 1770 Read/Feed constraints in 187 ms returned sat
[2024-05-20 22:12:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-20 22:12:48] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:12:49] [INFO ] [Nat]Absence check using state equation in 1747 ms returned sat
[2024-05-20 22:12:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:12:50] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1086 ms returned unknown
[2024-05-20 22:12:51] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-20 22:12:51] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:52] [INFO ] [Real]Absence check using state equation in 1423 ms returned sat
[2024-05-20 22:12:52] [INFO ] [Real]Added 1770 Read/Feed constraints in 148 ms returned sat
[2024-05-20 22:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:12:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:12:53] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:54] [INFO ] [Nat]Absence check using state equation in 1442 ms returned sat
[2024-05-20 22:12:55] [INFO ] [Nat]Added 1770 Read/Feed constraints in 521 ms returned sat
[2024-05-20 22:12:55] [INFO ] Computed and/alt/rep : 5460/8970/5460 causal constraints (skipped 90 transitions) in 280 ms.
[2024-05-20 22:12:56] [INFO ] Added : 11 causal constraints over 3 iterations in 1145 ms. Result :sat
Minimization took 1524 ms.
[2024-05-20 22:12:58] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:12:58] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:12:59] [INFO ] [Real]Absence check using state equation in 1569 ms returned sat
[2024-05-20 22:13:00] [INFO ] [Real]Added 1770 Read/Feed constraints in 375 ms returned sat
[2024-05-20 22:13:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2024-05-20 22:13:00] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:13:02] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2024-05-20 22:13:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:13:03] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1094 ms returned unknown
[2024-05-20 22:13:03] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:13:03] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-20 22:13:05] [INFO ] [Real]Absence check using state equation in 1570 ms returned sat
[2024-05-20 22:13:05] [INFO ] [Real]Added 1770 Read/Feed constraints in 458 ms returned sat
[2024-05-20 22:13:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-20 22:13:06] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 22:13:07] [INFO ] [Nat]Absence check using state equation in 1555 ms returned sat
[2024-05-20 22:13:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:13:08] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1082 ms returned unknown
[2024-05-20 22:13:09] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:13:09] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:13:10] [INFO ] [Real]Absence check using state equation in 1772 ms returned sat
[2024-05-20 22:13:11] [INFO ] [Real]Added 1770 Read/Feed constraints in 290 ms returned sat
[2024-05-20 22:13:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2024-05-20 22:13:11] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:13:13] [INFO ] [Nat]Absence check using state equation in 1820 ms returned sat
[2024-05-20 22:13:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:13:14] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1084 ms returned unknown
[2024-05-20 22:13:14] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:13:14] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-20 22:13:16] [INFO ] [Real]Absence check using state equation in 1734 ms returned sat
[2024-05-20 22:13:16] [INFO ] [Real]Added 1770 Read/Feed constraints in 295 ms returned sat
[2024-05-20 22:13:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-20 22:13:17] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:13:18] [INFO ] [Nat]Absence check using state equation in 1710 ms returned sat
[2024-05-20 22:13:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-20 22:13:20] [INFO ] [Nat]Added 1770 Read/Feed constraints in 1085 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 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:[0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 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.9 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 3 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 1123 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 1137 ms. Remains : 1090/2164 places, 3702/5580 transitions.
// Phase 1: matrix 3702 rows 1090 cols
[2024-05-20 22:13:21] [INFO ] Computed 32 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 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 (7130 resets) in 8080 ms. (123 steps per ms)
BEST_FIRST walk for 15000015 steps (3060 resets) in 14178 ms. (1057 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-20 22:13:43] [INFO ] Invariant cache hit.
[2024-05-20 22:13:43] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:13:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-20 22:13:44] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-05-20 22:13:44] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:13:44] [INFO ] [Real]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-20 22:13:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:13:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 22:13:45] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-20 22:13:45] [INFO ] [Nat]Added 3582 Read/Feed constraints in 292 ms returned sat
[2024-05-20 22:13:46] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 187 ms.
[2024-05-20 22:13:46] [INFO ] Added : 5 causal constraints over 1 iterations in 555 ms. Result :sat
Minimization took 4516 ms.
[2024-05-20 22:13:51] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:13:51] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:13:51] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-20 22:13:52] [INFO ] [Real]Added 3582 Read/Feed constraints in 238 ms returned sat
[2024-05-20 22:13:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:13:52] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:13:52] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2024-05-20 22:13:53] [INFO ] [Nat]Added 3582 Read/Feed constraints in 300 ms returned sat
[2024-05-20 22:13:53] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 188 ms.
[2024-05-20 22:13:53] [INFO ] Added : 6 causal constraints over 2 iterations in 677 ms. Result :sat
Minimization took 4501 ms.
[2024-05-20 22:13:58] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:13:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:13:59] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2024-05-20 22:13:59] [INFO ] [Real]Added 3582 Read/Feed constraints in 273 ms returned sat
[2024-05-20 22:13:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:13:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:13:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:00] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2024-05-20 22:14:00] [INFO ] [Nat]Added 3582 Read/Feed constraints in 298 ms returned sat
[2024-05-20 22:14:01] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 191 ms.
[2024-05-20 22:14:01] [INFO ] Added : 6 causal constraints over 2 iterations in 700 ms. Result :sat
Minimization took 4893 ms.
[2024-05-20 22:14:06] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:14:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:07] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-05-20 22:14:07] [INFO ] [Real]Added 3582 Read/Feed constraints in 255 ms returned sat
[2024-05-20 22:14:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:08] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-20 22:14:08] [INFO ] [Nat]Added 3582 Read/Feed constraints in 315 ms returned sat
[2024-05-20 22:14:08] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 204 ms.
[2024-05-20 22:14:09] [INFO ] Added : 8 causal constraints over 2 iterations in 693 ms. Result :sat
Minimization took 4515 ms.
[2024-05-20 22:14:14] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:14] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:14] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-20 22:14:14] [INFO ] [Real]Added 3582 Read/Feed constraints in 249 ms returned sat
[2024-05-20 22:14:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:15] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:15] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:14:16] [INFO ] [Nat]Added 3582 Read/Feed constraints in 300 ms returned sat
[2024-05-20 22:14:16] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-20 22:14:16] [INFO ] Added : 13 causal constraints over 3 iterations in 755 ms. Result :sat
Minimization took 4503 ms.
[2024-05-20 22:14:21] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:22] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2024-05-20 22:14:22] [INFO ] [Real]Added 3582 Read/Feed constraints in 248 ms returned sat
[2024-05-20 22:14:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:22] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:23] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-20 22:14:23] [INFO ] [Nat]Added 3582 Read/Feed constraints in 277 ms returned sat
[2024-05-20 22:14:23] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-20 22:14:24] [INFO ] Added : 7 causal constraints over 2 iterations in 630 ms. Result :sat
Minimization took 4506 ms.
[2024-05-20 22:14:28] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:28] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:29] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-20 22:14:29] [INFO ] [Real]Added 3582 Read/Feed constraints in 277 ms returned sat
[2024-05-20 22:14:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:30] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2024-05-20 22:14:30] [INFO ] [Nat]Added 3582 Read/Feed constraints in 246 ms returned sat
[2024-05-20 22:14:31] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-20 22:14:31] [INFO ] Added : 4 causal constraints over 1 iterations in 522 ms. Result :sat
Minimization took 4515 ms.
[2024-05-20 22:14:36] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:36] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2024-05-20 22:14:36] [INFO ] [Real]Added 3582 Read/Feed constraints in 254 ms returned sat
[2024-05-20 22:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:14:37] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-05-20 22:14:38] [INFO ] [Nat]Added 3582 Read/Feed constraints in 335 ms returned sat
[2024-05-20 22:14:38] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-20 22:14:38] [INFO ] Added : 10 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 4516 ms.
[2024-05-20 22:14:43] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:44] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2024-05-20 22:14:44] [INFO ] [Real]Added 3582 Read/Feed constraints in 252 ms returned sat
[2024-05-20 22:14:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:14:45] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:14:45] [INFO ] [Nat]Added 3582 Read/Feed constraints in 273 ms returned sat
[2024-05-20 22:14:45] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 175 ms.
[2024-05-20 22:14:46] [INFO ] Added : 4 causal constraints over 1 iterations in 517 ms. Result :sat
Minimization took 4501 ms.
[2024-05-20 22:14:50] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:51] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2024-05-20 22:14:51] [INFO ] [Real]Added 3582 Read/Feed constraints in 259 ms returned sat
[2024-05-20 22:14:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:14:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:52] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2024-05-20 22:14:52] [INFO ] [Nat]Added 3582 Read/Feed constraints in 390 ms returned sat
[2024-05-20 22:14:53] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-20 22:14:53] [INFO ] Added : 10 causal constraints over 2 iterations in 649 ms. Result :sat
Minimization took 4501 ms.
[2024-05-20 22:14:58] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:14:58] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:14:58] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:14:59] [INFO ] [Real]Added 3582 Read/Feed constraints in 245 ms returned sat
[2024-05-20 22:14:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:14:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:14:59] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:14:59] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2024-05-20 22:15:00] [INFO ] [Nat]Added 3582 Read/Feed constraints in 288 ms returned sat
[2024-05-20 22:15:00] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-20 22:15:00] [INFO ] Added : 9 causal constraints over 2 iterations in 646 ms. Result :sat
Minimization took 4500 ms.
[2024-05-20 22:15:05] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:15:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:15:06] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-20 22:15:06] [INFO ] [Real]Added 3582 Read/Feed constraints in 266 ms returned sat
[2024-05-20 22:15:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:15:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:15:06] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:15:07] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-20 22:15:07] [INFO ] [Nat]Added 3582 Read/Feed constraints in 301 ms returned sat
[2024-05-20 22:15:07] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:15:08] [INFO ] Added : 10 causal constraints over 2 iterations in 630 ms. Result :sat
Minimization took 4500 ms.
[2024-05-20 22:15:12] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:15:12] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:15:13] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2024-05-20 22:15:13] [INFO ] [Real]Added 3582 Read/Feed constraints in 242 ms returned sat
[2024-05-20 22:15:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:15:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:15:13] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:15:14] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-20 22:15:14] [INFO ] [Nat]Added 3582 Read/Feed constraints in 265 ms returned sat
[2024-05-20 22:15:15] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:15:15] [INFO ] Added : 8 causal constraints over 2 iterations in 630 ms. Result :sat
Minimization took 4502 ms.
[2024-05-20 22:15:20] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:15:20] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:15:20] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-20 22:15:21] [INFO ] [Real]Added 3582 Read/Feed constraints in 280 ms returned sat
[2024-05-20 22:15:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:15:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-20 22:15:21] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:15:21] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-20 22:15:22] [INFO ] [Nat]Added 3582 Read/Feed constraints in 364 ms returned sat
[2024-05-20 22:15:22] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:15:22] [INFO ] Added : 9 causal constraints over 2 iterations in 639 ms. Result :sat
Minimization took 4505 ms.
[2024-05-20 22:15:27] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:15:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:15:28] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-20 22:15:28] [INFO ] [Real]Added 3582 Read/Feed constraints in 280 ms returned sat
[2024-05-20 22:15:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:15:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:15:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:15:29] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2024-05-20 22:15:29] [INFO ] [Nat]Added 3582 Read/Feed constraints in 296 ms returned sat
[2024-05-20 22:15:29] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 198 ms.
[2024-05-20 22:15:30] [INFO ] Added : 9 causal constraints over 2 iterations in 685 ms. Result :sat
Minimization took 4501 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 81 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 70 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-20 22:15:35] [INFO ] Invariant cache hit.
[2024-05-20 22:15:36] [INFO ] Implicit Places using invariants in 950 ms returned []
[2024-05-20 22:15:36] [INFO ] Invariant cache hit.
[2024-05-20 22:15:36] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:15:54] [INFO ] Implicit Places using invariants and state equation in 18523 ms returned []
Implicit Place search using SMT with State Equation took 19481 ms to find 0 implicit places.
[2024-05-20 22:15:54] [INFO ] Redundant transitions in 192 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-20 22:15:54] [INFO ] Invariant cache hit.
[2024-05-20 22:15:54] [INFO ] State equation strengthened by 3582 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/1089 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 32615ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52464 ms. Remains : 1090/1090 places, 3702/3702 transitions.
[2024-05-20 22:16:27] [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 (7135 resets) in 8343 ms. (119 steps per ms)
BEST_FIRST walk for 15000013 steps (3052 resets) in 14369 ms. (1043 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-20 22:16:50] [INFO ] Invariant cache hit.
[2024-05-20 22:16:50] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:16:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-20 22:16:50] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-20 22:16:51] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:16:51] [INFO ] [Real]Added 3582 Read/Feed constraints in 270 ms returned sat
[2024-05-20 22:16:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:16:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:16:51] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:16:52] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2024-05-20 22:16:52] [INFO ] [Nat]Added 3582 Read/Feed constraints in 263 ms returned sat
[2024-05-20 22:16:52] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-20 22:16:53] [INFO ] Added : 5 causal constraints over 1 iterations in 531 ms. Result :sat
Minimization took 4505 ms.
[2024-05-20 22:16:57] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:16:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:16:58] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-20 22:16:58] [INFO ] [Real]Added 3582 Read/Feed constraints in 242 ms returned sat
[2024-05-20 22:16:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:16:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:16:58] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:16:59] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-20 22:16:59] [INFO ] [Nat]Added 3582 Read/Feed constraints in 270 ms returned sat
[2024-05-20 22:16:59] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-20 22:17:00] [INFO ] Added : 6 causal constraints over 2 iterations in 643 ms. Result :sat
Minimization took 4512 ms.
[2024-05-20 22:17:05] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:05] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:05] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-20 22:17:05] [INFO ] [Real]Added 3582 Read/Feed constraints in 244 ms returned sat
[2024-05-20 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:17:06] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:06] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-20 22:17:07] [INFO ] [Nat]Added 3582 Read/Feed constraints in 284 ms returned sat
[2024-05-20 22:17:07] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-20 22:17:07] [INFO ] Added : 6 causal constraints over 2 iterations in 650 ms. Result :sat
Minimization took 4532 ms.
[2024-05-20 22:17:12] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:12] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:12] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-20 22:17:13] [INFO ] [Real]Added 3582 Read/Feed constraints in 248 ms returned sat
[2024-05-20 22:17:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:17:13] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:14] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2024-05-20 22:17:14] [INFO ] [Nat]Added 3582 Read/Feed constraints in 302 ms returned sat
[2024-05-20 22:17:14] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-20 22:17:15] [INFO ] Added : 8 causal constraints over 2 iterations in 647 ms. Result :sat
Minimization took 4530 ms.
[2024-05-20 22:17:19] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:19] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:17:20] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2024-05-20 22:17:20] [INFO ] [Real]Added 3582 Read/Feed constraints in 248 ms returned sat
[2024-05-20 22:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:21] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2024-05-20 22:17:21] [INFO ] [Nat]Added 3582 Read/Feed constraints in 299 ms returned sat
[2024-05-20 22:17:21] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-20 22:17:22] [INFO ] Added : 13 causal constraints over 3 iterations in 745 ms. Result :sat
Minimization took 4501 ms.
[2024-05-20 22:17:27] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-20 22:17:27] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:17:27] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-20 22:17:28] [INFO ] [Real]Added 3582 Read/Feed constraints in 238 ms returned sat
[2024-05-20 22:17:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:17:28] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:28] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2024-05-20 22:17:29] [INFO ] [Nat]Added 3582 Read/Feed constraints in 274 ms returned sat
[2024-05-20 22:17:29] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-20 22:17:29] [INFO ] Added : 7 causal constraints over 2 iterations in 640 ms. Result :sat
Minimization took 4510 ms.
[2024-05-20 22:17:34] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:17:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:17:35] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2024-05-20 22:17:35] [INFO ] [Real]Added 3582 Read/Feed constraints in 254 ms returned sat
[2024-05-20 22:17:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:17:35] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:36] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-20 22:17:36] [INFO ] [Nat]Added 3582 Read/Feed constraints in 255 ms returned sat
[2024-05-20 22:17:36] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:17:37] [INFO ] Added : 4 causal constraints over 1 iterations in 522 ms. Result :sat
Minimization took 4519 ms.
[2024-05-20 22:17:41] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:17:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:17:42] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-20 22:17:42] [INFO ] [Real]Added 3582 Read/Feed constraints in 264 ms returned sat
[2024-05-20 22:17:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:17:42] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:17:43] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-20 22:17:43] [INFO ] [Nat]Added 3582 Read/Feed constraints in 323 ms returned sat
[2024-05-20 22:17:44] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:17:44] [INFO ] Added : 10 causal constraints over 2 iterations in 628 ms. Result :sat
Minimization took 4506 ms.
[2024-05-20 22:17:49] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:49] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:49] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-05-20 22:17:50] [INFO ] [Real]Added 3582 Read/Feed constraints in 256 ms returned sat
[2024-05-20 22:17:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:17:50] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2024-05-20 22:17:51] [INFO ] [Nat]Added 3582 Read/Feed constraints in 282 ms returned sat
[2024-05-20 22:17:51] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:17:51] [INFO ] Added : 4 causal constraints over 1 iterations in 510 ms. Result :sat
Minimization took 4515 ms.
[2024-05-20 22:17:56] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:17:56] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:17:57] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-20 22:17:57] [INFO ] [Real]Added 3582 Read/Feed constraints in 293 ms returned sat
[2024-05-20 22:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:17:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:17:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:17:58] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-20 22:17:58] [INFO ] [Nat]Added 3582 Read/Feed constraints in 414 ms returned sat
[2024-05-20 22:17:58] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:17:59] [INFO ] Added : 10 causal constraints over 2 iterations in 641 ms. Result :sat
Minimization took 4512 ms.
[2024-05-20 22:18:04] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:18:04] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 22:18:04] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2024-05-20 22:18:05] [INFO ] [Real]Added 3582 Read/Feed constraints in 286 ms returned sat
[2024-05-20 22:18:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:18:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:18:05] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:18:05] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2024-05-20 22:18:06] [INFO ] [Nat]Added 3582 Read/Feed constraints in 304 ms returned sat
[2024-05-20 22:18:06] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-20 22:18:06] [INFO ] Added : 9 causal constraints over 2 iterations in 626 ms. Result :sat
Minimization took 4510 ms.
[2024-05-20 22:18:11] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:18:11] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:18:12] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:18:12] [INFO ] [Real]Added 3582 Read/Feed constraints in 257 ms returned sat
[2024-05-20 22:18:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:18:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:18:12] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:18:13] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-20 22:18:13] [INFO ] [Nat]Added 3582 Read/Feed constraints in 305 ms returned sat
[2024-05-20 22:18:13] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-20 22:18:14] [INFO ] Added : 10 causal constraints over 2 iterations in 635 ms. Result :sat
Minimization took 4517 ms.
[2024-05-20 22:18:18] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:18:18] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:18:19] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-20 22:18:19] [INFO ] [Real]Added 3582 Read/Feed constraints in 245 ms returned sat
[2024-05-20 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:18:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:18:19] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:18:20] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2024-05-20 22:18:20] [INFO ] [Nat]Added 3582 Read/Feed constraints in 266 ms returned sat
[2024-05-20 22:18:21] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-20 22:18:21] [INFO ] Added : 8 causal constraints over 2 iterations in 634 ms. Result :sat
Minimization took 4526 ms.
[2024-05-20 22:18:26] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:18:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:18:26] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-20 22:18:27] [INFO ] [Real]Added 3582 Read/Feed constraints in 280 ms returned sat
[2024-05-20 22:18:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:18:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-20 22:18:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:18:27] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-20 22:18:28] [INFO ] [Nat]Added 3582 Read/Feed constraints in 362 ms returned sat
[2024-05-20 22:18:28] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-20 22:18:28] [INFO ] Added : 9 causal constraints over 2 iterations in 634 ms. Result :sat
Minimization took 4514 ms.
[2024-05-20 22:18:33] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:18:33] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:18:34] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-05-20 22:18:34] [INFO ] [Real]Added 3582 Read/Feed constraints in 259 ms returned sat
[2024-05-20 22:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:18:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:18:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:18:35] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:18:35] [INFO ] [Nat]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-20 22:18:35] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 166 ms.
[2024-05-20 22:18:36] [INFO ] Added : 9 causal constraints over 2 iterations in 656 ms. Result :sat
Minimization took 4536 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 81 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 3702/3702 transitions.
Applied a total of 0 rules in 63 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-20 22:18:41] [INFO ] Invariant cache hit.
[2024-05-20 22:18:41] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-20 22:18:41] [INFO ] Invariant cache hit.
[2024-05-20 22:18:42] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:19:01] [INFO ] Implicit Places using invariants and state equation in 19154 ms returned []
Implicit Place search using SMT with State Equation took 20086 ms to find 0 implicit places.
[2024-05-20 22:19:01] [INFO ] Redundant transitions in 224 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-20 22:19:01] [INFO ] Invariant cache hit.
[2024-05-20 22:19:01] [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 32198ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52617 ms. Remains : 1090/1090 places, 3702/3702 transitions.
RANDOM walk for 40000 steps (284 resets) in 2094 ms. (19 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 10 ms. (364 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 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 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 13 ms. (286 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 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
[2024-05-20 22:19:34] [INFO ] Flatten gal took : 251 ms
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 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 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 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 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 14 ms. (266 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 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 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 11 ms. (333 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 12 ms. (308 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 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
[2024-05-20 22:19:34] [INFO ] Flatten gal took : 158 ms
[2024-05-20 22:19:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1080240974713214349.gal : 63 ms
[2024-05-20 22:19:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16881492041884169526.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1080240974713214349.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16881492041884169526.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16881492041884169526.prop.
Interrupted probabilistic random walk after 164241 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 30
Probabilistic random walk after 164241 steps, saw 30848 distinct states, run finished after 3004 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-20 22:19:37] [INFO ] Invariant cache hit.
[2024-05-20 22:19:37] [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-20 22:19:37] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 5 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-20 22:19:37] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:19:37] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:19:37] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 22:19:37] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 2 places in 41 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
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (INCLUDED_ONLY) 0/4790 variables, 3582/4722 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :1171 after 1328
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :1328 after 1552
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :1552 after 1717
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :1717 after 1733
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :1733 after 1774
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :1774 after 1876
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 5029 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-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-20 22:19:43] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:19:43] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :1876 after 2128
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-20 22:19:44] [INFO ] Deduced a trap composed of 42 places in 613 ms of which 8 ms to minimize.
[2024-05-20 22:19:45] [INFO ] Deduced a trap composed of 49 places in 631 ms of which 6 ms to minimize.
SDD proceeding with computation,30 properties remain. new max is 4096
SDD size :2128 after 2508
[2024-05-20 22:19:45] [INFO ] Deduced a trap composed of 37 places in 580 ms of which 6 ms to minimize.
[2024-05-20 22:19:46] [INFO ] Deduced a trap composed of 37 places in 621 ms of which 7 ms to minimize.
[2024-05-20 22:19:47] [INFO ] Deduced a trap composed of 39 places in 513 ms of which 6 ms to minimize.
[2024-05-20 22:19:47] [INFO ] Deduced a trap composed of 56 places in 536 ms of which 8 ms to minimize.
SMT process timed out in 10281ms, 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 73 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 73 ms. Remains : 1090/1090 places, 3702/3702 transitions.
RANDOM walk for 40000 steps (284 resets) in 835 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 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 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 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 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 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 13 ms. (286 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 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 163158 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 15
Probabilistic random walk after 163158 steps, saw 30737 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-20 22:19:51] [INFO ] Invariant cache hit.
[2024-05-20 22:19:51] [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
SDD proceeding with computation,30 properties remain. new max is 8192
SDD size :2508 after 3060
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 7245 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-20 22:19:58] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 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-20 22:20:00] [INFO ] Deduced a trap composed of 42 places in 656 ms of which 6 ms to minimize.
[2024-05-20 22:20:00] [INFO ] Deduced a trap composed of 34 places in 54 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
Detected timeout of ITS tools.
[2024-05-20 22:20:24] [INFO ] Flatten gal took : 91 ms
[2024-05-20 22:20:24] [INFO ] Applying decomposition
[2024-05-20 22:20:24] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16759480314358240651.txt' '-o' '/tmp/graph16759480314358240651.bin' '-w' '/tmp/graph16759480314358240651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16759480314358240651.bin' '-l' '-1' '-v' '-w' '/tmp/graph16759480314358240651.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:20:25] [INFO ] Decomposing Gal with order
[2024-05-20 22:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:20:25] [INFO ] Removed a total of 2805 redundant transitions.
[2024-05-20 22:20:25] [INFO ] Flatten gal took : 570 ms
[2024-05-20 22:20:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 3049 labels/synchronizations in 190 ms.
[2024-05-20 22:20:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6594679445799757795.gal : 34 ms
[2024-05-20 22:20:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14346108096871683.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6594679445799757795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14346108096871683.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/ReachabilityCardinality14346108096871683.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 1927
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :1927 after 1927
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1927 after 1967
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1967 after 1980
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :1980 after 2430
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :2430 after 317505
At refinement iteration 12 (INCLUDED_ONLY) 0/4790 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 0)
(t3 1)
(t4 0)
(t5 1)
(t6 0)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 1)
(t14 0)
(t15 0)
(t16 0)
(t17 1)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 1)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 1)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 1)
(t46 0)
(t47 0)
(t48 0)
(t49 1)
(t50 0)
(t51 1)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 2)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 3)
(t96 0)
(t97 0)
(t98 0)
(t99 2)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 1)
(t127 3)
(t128 0)
(t129 1)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 6)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 1)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 1)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 1)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 3)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 6)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 1)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 2)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 1)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 1)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 1)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 1)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 5)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 3)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 1)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 1)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 1)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 1)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 1)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 6)
(t745 0)
(t746 1)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 3)
(t761 0)
(t762 1)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 7)
(t773 4)
(t774 1)
(t775 0)
(t776 0)
(t777 3)
(t778 0)
(t779 1)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 1)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 1)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 7)
(t839 0)
(t840 0)
(t841 0)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 3)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 1)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 0)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 0)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 1)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 1)
(t939 0)
(t940 0)
(t941 0)
(t942 0)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 0)
(t962 0)
(t963 0)
(t964 0)
(t965 0)
(t966 0)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 0)
(t979 1)
(t980 0)
(t981 0)
(t982 0)
(t983 0)
(t984 0)
(t985 0)
(t986 0)
(t987 0)
(t988 0)
(t989 0)
(t990 0)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 0)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 1)
(t1001 4)
(t1002 1)
(t1003 6)
(t1004 1)
(t1005 0)
(t1006 1)
(t1007 0)
(t1008 1)
(t1009 0)
(t1010 1)
(t1011 2)
(t1012 0)
(t1013 0)
(t1014 1)
(t1015 5)
(t1016 1)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 1)
(t1021 1)
(t1022 1)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 1)
(t1027 0)
(t1028 1)
(t1029 7)
(t1030 0)
(t1031 0)
(t1032 1)
(t1033 0)
(t1034 1)
(t1035 0)
(t1036 1)
(t1037 0)
(t1038 1)
(t1039 0)
(t1040 1)
(t1041 0)
(t1042 1)
(t1043 6)
(t1044 1)
(t1045 0)
(t1046 1)
(t1047 7)
(t1048 1)
(t1049 2)
(t1050 1)
(t1051 0)
(t1052 1)
(t1053 0)
(t1054 1)
(t1055 0)
(t1056 1)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 0)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 0)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 0)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 1)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 0)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 0)
(t1138 0)
(t1139 0)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)
(t1146 0)
(t1147 0)
(t1148 0)
(t1149 0)
(t1150 0)
(t1151 0)
(t1152 0)
(t1153 0)
(t1154 4)
(t1155 0)
(t1156 0)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 0)
(t1167 0)
(t1168 0)
(t1169 0)
(t1170 0)
(t1171 0)
(t1172 0)
(t1173 0)
(t1174 1)
(t1175 0)
(t1176 2)
(t1177 1)
(t1178 0)
(t1179 0)
(t1180 0)
(t1181 0)
(t1182 1)
(t1183 0)
(t1184 0)
(t1185 0)
(t1186 0)
(t1187 0)
(t1188 0)
(t1189 0)
(t1190 0)
(t1191 0)
(t1192 1)
(t1193 0)
(t1194 0)
(t1195 0)
(t1196 0)
(t1197 0)
(t1198 0)
(t1199 0)
(t1200 0)
(t1201 0)
(t1202 0)
(t1203 0)
(t1204 0)
(t1205 0)
(t1206 0)
(t1207 0)
(t1208 0)
(t1209 1)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 0)
(t1219 0)
(t1220 1)
(t1221 0)
(t1222 0)
(t1223 0)
(t1224 0)
(t1225 0)
(t1226 0)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 0)
(t1231 0)
(t1232 0)
(t1233 0)
(t1234 0)
(t1235 0)
(t1236 0)
(t1237 0)
(t1238 0)
(t1239 0)
(t1240 0)
(t1241 0)
(t1242 0)
(t1243 0)
(t1244 0)
(t1245 0)
(t1246 0)
(t1247 0)
(t1248 0)
(t1249 0)
(t1250 0)
(t1251 0)
(t1252 0)
(t1253 0)
(t1254 0)
(t1255 0)
(t1256 0)
(t1257 0)
(t1258 0)
(t1259 0)
(t1260 0)
(t1261 0)
(t1262 0)
(t1263 0)
(t1264 0)
(t1265 0)
(t1266 0)
(t1267 0)
(t1268 0)
(t1269 0)
(t1270 0)
(t1271 0)
(t1272 0)
(t1273 0)
(t1274 0)
(t1275 0)
(t1276 0)
(t1277 0)
(t1278 0)
(t1279 0)
(t1280 0)
(t1281 0)
(t1282 0)
(t1283 0)
(t1284 0)
(t1285 0)
(t1286 0)
(t1287 0)
(t1288 0)
(t1289 0)
(t1290 0)
(t1291 0)
(t1292 0)
(t1293 0)
(t1294 0)
(t1295 0)
(t1296 0)
(t1297 0)
(t1298 0)
(t1299 0)
(t1300 0)
(t1301 0)
(t1302 0)
(t1303 0)
(t1304 0)
(t1305 0)
(t1306 0)
(t1307 0)
(t1308 0)
(t1309 0)
(t1310 0)
(t1311 0)
(t1312 0)
(t1313 0)
(t1314 0)
(t1315 0)
(t1316 0)
(t1317 0)
(t1318 0)
(t1319 0)
(t1320 0)
(t1321 0)
(t1322 0)
(t1323 0)
(t1324 0)
(t1325 0)
(t1326 0)
(t1327 0)
(t1328 0)
(t1329 0)
(t1330 0)
(t1331 0)
(t1332 0)
(t1333 0)
(t1334 0)
(t1335 0)
(t1336 0)
(t1337 0)
(t1338 0)
(t1339 0)
(t1340 0)
(t1341 0)
(t1342 0)
(t1343 0)
(t1344 0)
(t1345 0)
(t1346 0)
(t1347 0)
(t1348 0)
(t1349 0)
(t1350 0)
(t1351 0)
(t1352 0)
(t1353 0)
(t1354 0)
(t1355 0)
(t1356 0)
(t1357 0)
(t1358 0)
(t1359 0)
(t1360 0)
(t1361 0)
(t1362 0)
(t1363 0)
(t1364 0)
(t1365 0)
(t1366 0)
(t1367 0)
(t1368 0)
(t1369 0)
(t1370 0)
(t1371 0)
(t1372 0)
(t1373 0)
(t1374 0)
(t1375 0)
(t1376 0)
(t1377 0)
(t1378 0)
(t1379 0)
(t1380 0)
(t1381 0)
(t1382 0)
(t1383 0)
(t1384 0)
(t1385 0)
(t1386 0)
(t1387 0)
(t1388 0)
(t1389 0)
(t1390 0)
(t1391 0)
(t1392 0)
(t1393 0)
(t1394 0)
(t1395 0)
(t1396 0)
(t1397 0)
(t1398 0)
(t1399 0)
(t1400 0)
(t1401 0)
(t1402 0)
(t1403 0)
(t1404 0)
(t1405 0)
(t1406 0)
(t1407 0)
(t1408 0)
(t1409 0)
(t1410 0)
(t1411 0)
(t1412 0)
(t1413 0)
(t1414 0)
(t1415 0)
(t1416 0)
(t1417 0)
(t1418 0)
(t1419 0)
(t1420 0)
(t1421 0)
(t1422 1)
(t1423 0)
(t1424 1)
(t1425 0)
(t1426 0)
(t1427 0)
(t1428 0)
(t1429 0)
(t1430 0)
(t1431 0)
(t1432 0)
(t1433 0)
(t1434 0)
(t1435 0)
(t1436 0)
(t1437 0)
(t1438 0)
(t1439 0)
(t1440 0)
(t1441 0)
(t1442 0)
(t1443 0)
(t1444 0)
(t1445 0)
(t1446 0)
(t1447 0)
(t1448 0)
(t1449 0)
(t1450 0)
(t1451 0)
(t1452 0)
(t1453 0)
(t1454 0)
(t1455 0)
(t1456 0)
(t1457 0)
(t1458 0)
(t1459 0)
(t1460 0)
(t1461 0)
(t1462 0)
(t1463 0)
(t1464 0)
(t1465 0)
(t1466 0)
(t1467 0)
(t1468 0)
(t1469 0)
(t1470 0)
(t1471 0)
(t1472 0)
(t1473 0)
(t1474 0)
(t1475 0)
(t1476 0)
(t1477 0)
(t1478 0)
(t1479 0)
(t1480 0)
(t1481 0)
(t1482 0)
(t1483 0)
(t1484 0)
(t1485 0)
(t1486 0)
(t1487 0)
(t1488 0)
(t1489 0)
(t1490 0)
(t1491 0)
(t1492 0)
(t1493 0)
(t1494 0)
(t1495 0)
(t1496 0)
(t1497 0)
(t1498 0)
(t1499 0)
(t1500 0)
(t1501 0)
(t1502 0)
(t1503 0)
(t1504 0)
(t1505 0)
(t1506 0)
(t1507 0)
(t1508 0)
(t1509 0)
(t1510 0)
(t1511 0)
(t1512 0)
(t1513 0)
(t1514 0)
(t1515 0)
(t1516 0)
(t1517 0)
(t1518 0)
(t1519 0)
(t1520 0)
(t1521 0)
(t1522 0)
(t1523 0)
(t1524 0)
(t1525 0)
(t1526 0)
(t1527 0)
(t1528 5)
(t1529 0)
(t1530 0)
(t1531 0)
(t1532 0)
(t1533 0)
(t1534 0)
(t1535 0)
(t1536 0)
(t1537 0)
(t1538 0)
(t1539 0)
(t1540 0)
(t1541 0)
(t1542 0)
(t1543 0)
(t1544 0)
(t1545 0)
(t1546 0)
(t1547 0)
(t1548 0)
(t1549 0)
(t1550 0)
(t1551 0)
(t1552 0)
(t1553 0)
(t1554 0)
(t1555 0)
(t1556 0)
(t1557 0)
(t1558 0)
(t1559 0)
(t1560 0)
(t1561 0)
(t1562 0)
(t1563 0)
(t1564 0)
(t1565 0)
(t1566 0)
(t1567 0)
(t1568 0)
(t1569 0)
(t1570 0)
(t1571 0)
(t1572 0)
(t1573 0)
(t1574 0)
(t1575 0)
(t1576 0)
(t1577 0)
(t1578 0)
(t1579 0)
(t1580 0)
(t1581 0)
(t1582 0)
(t1583 0)
(t1584 0)
(t1585 0)
(t1586 0)
(t1587 0)
(t1588 0)
(t1589 0)
(t1590 0)
(t1591 0)
(t1592 0)
(t1593 0)
(t1594 0)
(t1595 0)
(t1596 0)
(t1597 0)
(t1598 0)
(t1599 0)
(t1600 0)
(t1601 0)
(t1602 0)
(t1603 0)
(t1604 0)
(t1605 0)
(t1606 0)
(t1607 0)
(t1608 0)
(t1609 0)
(t1610 0)
(t1611 0)
(t1612 0)
(t1613 0)
(t1614 0)
(t1615 0)
(t1616 0)
(t1617 0)
(t1618 0)
(t1619 0)
(t1620 0)
(t1621 0)
(t1622 0)
(t1623 0)
(t1624 0)
(t1625 0)
(t1626 0)
(t1627 0)
(t1628 0)
(t1629 0)
(t1630 0)
(t1631 0)
(t1632 0)
(t1633 0)
(t1634 0)
(t1635 0)
(t1636 0)
(t1637 0)
(t1638 0)
(t1639 0)
(t1640 0)
(t1641 0)
(t1642 0)
(t1643 0)
(t1644 0)
(t1645 0)
(t1646 0)
(t1647 0)
(t1648 0)
(t1649 0)
(t1650 0)
(t1651 0)
(t1652 0)
(t1653 0)
(t1654 0)
(t1655 0)
(t1656 0)
(t1657 0)
(t1658 0)
(t1659 0)
(t1660 0)
(t1661 0)
(t1662 0)
(t1663 0)
(t1664 0)
(t1665 0)
(t1666 0)
(t1667 0)
(t1668 0)
(t1669 0)
(t1670 0)
(t1671 0)
(t1672 0)
(t1673 0)
(t1674 0)
(t1675 0)
(t1676 0)
(t1677 0)
(t1678 0)
(t1679 0)
(t1680 0)
(t1681 0)
(t1682 0)
(t1683 0)
(t1684 0)
(t1685 0)
(t1686 0)
(t1687 0)
(t1688 0)
(t1689 0)
(t1690 0)
(t1691 0)
(t1692 0)
(t1693 0)
(t1694 0)
(t1695 0)
(t1696 0)
(t1697 0)
(t1698 0)
(t1699 0)
(t1700 0)
(t1701 0)
(t1702 0)
(t1703 0)
(t1704 0)
(t1705 0)
(t1706 0)
(t1707 0)
(t1708 0)
(t1709 0)
(t1710 0)
(t1711 0)
(t1712 0)
(t1713 0)
(t1714 1)
(t1715 0)
(t1716 0)
(t1717 0)
(t1718 0)
(t1719 0)
(t1720 0)
(t1721 0)
(t1722 0)
(t1723 0)
(t1724 0)
(t1725 0)
(t1726 0)
(t1727 0)
(t1728 0)
(t1729 0)
(t1730 0)
(t1731 0)
(t1732 0)
(t1733 0)
(t1734 0)
(t1735 0)
(t1736 0)
(t1737 0)
(t1738 0)
(t1739 0)
(t1740 0)
(t1741 0)
(t1742 0)
(t1743 0)
(t1744 0)
(t1745 0)
(t1746 0)
(t1747 0)
(t1748 0)
(t1749 0)
(t1750 0)
(t1751 0)
(t1752 0)
(t1753 0)
(t1754 0)
(t1755 0)
(t1756 0)
(t1757 0)
(t1758 0)
(t1759 0)
(t1760 0)
(t1761 0)
(t1762 0)
(t1763 0)
(t1764 0)
(t1765 0)
(t1766 0)
(t1767 0)
(t1768 0)
(t1769 0)
(t1770 0)
(t1771 0)
(t1772 0)
(t1773 0)
(t1774 0)
(t1775 0)
(t1776 0)
(t1777 0)
(t1778 0)
(t1779 0)
(t1780 0)
(t1781 0)
(t1782 0)
(t1783 0)
(t1784 0)
(t1785 0)
(t1786 0)
(t1787 0)
(t1788 0)
(t1789 0)
(t1790 0)
(t1791 0)
(t1792 0)
(t1793 0)
(t1794 0)
(t1795 0)
(t1796 0)
(t1797 0)
(t1798 0)
(t1799 0)
(t1800 0)
(t1801 0)
(t1802 0)
(t1803 0)
(t1804 0)
(t1805 0)
(t1806 0)
(t1807 0)
(t1808 0)
(t1809 0)
(t1810 0)
(t1811 0)
(t1812 0)
(t1813 0)
(t1814 0)
(t1815 0)
(t1816 0)
(t1817 0)
(t1818 0)
(t1819 0)
(t1820 0)
(t1821 0)
(t1822 0)
(t1823 0)
(t1824 0)
(t1825 0)
(t1826 0)
(t1827 0)
(t1828 0)
(t1829 0)
(t1830 0)
(t1831 0)
(t1832 0)
(t1833 0)
(t1834 0)
(t1835 0)
(t1836 0)
(t1837 0)
(t1838 0)
(t1839 0)
(t1840 0)
(t1841 0)
(t1842 0)
(t1843 0)
(t1844 0)
(t1845 0)
(t1846 0)
(t1847 0)
(t1848 0)
(t1849 0)
(t1850 0)
(t1851 0)
(t1852 0)
(t1853 0)
(t1854 0)
(t1855 0)
(t1856 0)
(t1857 0)
(t1858 0)
(t1859 0)
(t1860 0)
(t1861 0)
(t1862 0)
(t1863 0)
(t1864 0)
(t1865 0)
(t1866 0)
(t1867 0)
(t1868 0)
(t1869 0)
(t1870 0)
(t1871 0)
(t1872 0)
(t1873 0)
(t1874 0)
(t1875 0)
(t1876 0)
(t1877 0)
(t1878 0)
(t1879 0)
(t1880 0)
(t1881 0)
(t1882 0)
(t1883 0)
(t1884 0)
(t1885 0)
(t1886 0)
(t1887 0)
(t1888 0)
(t1889 0)
(t1890 0)
(t1891 0)
(t1892 0)
(t1893 0)
(t1894 0)
(t1895 0)
(t1896 6)
(t1897 0)
(t1898 0)
(t1899 0)
(t1900 0)
(t1901 0)
(t1902 0)
(t1903 0)
(t1904 0)
(t1905 0)
(t1906 0)
(t1907 0)
(t1908 0)
(t1909 0)
(t1910 0)
(t1911 0)
(t1912 0)
(t1913 0)
(t1914 0)
(t1915 0)
(t1916 1)
(t1917 0)
(t1918 0)
(t1919 0)
(t1920 0)
(t1921 0)
(t1922 0)
(t1923 0)
(t1924 0)
(t1925 0)
(t1926 0)
(t1927 0)
(t1928 0)
(t1929 0)
(t1930 0)
(t1931 0)
(t1932 0)
(t1933 0)
(t1934 0)
(t1935 0)
(t1936 0)
(t1937 0)
(t1938 0)
(t1939 0)
(t1940 0)
(t1941 0)
(t1942 0)
(t1943 0)
(t1944 0)
(t1945 0)
(t1946 0)
(t1947 0)
(t1948 0)
(t1949 0)
(t1950 0)
(t1951 0)
(t1952 0)
(t1953 0)
(t1954 0)
(t1955 0)
(t1956 0)
(t1957 0)
(t1958 0)
(t1959 0)
(t1960 0)
(t1961 0)
(t1962 0)
(t1963 0)
(t1964 0)
(t1965 0)
(t1966 0)
(t1967 0)
(t1968 0)
(t1969 0)
(t1970 0)
(t1971 0)
(t1972 0)
(t1973 0)
(t1974 0)
(t1975 0)
(t1976 0)
(t1977 0)
(t1978 0)
(t1979 0)
(t1980 0)
(t1981 0)
(t1982 0)
(t1983 0)
(t1984 0)
(t1985 0)
(t1986 0)
(t1987 0)
(t1988 0)
(t1989 0)
(t1990 0)
(t1991 0)
(t1992 0)
(t1993 0)
(t1994 0)
(t1995 0)
(t1996 0)
(t1997 0)
(t1998 0)
(t1999 0)
(t2000 0)
(t2001 0)
(t2002 0)
(t2003 0)
(t2004 0)
(t2005 0)
(t2006 0)
(t2007 0)
(t2008 0)
(t2009 0)
(t2010 0)
(t2011 0)
(t2012 0)
(t2013 0)
(t2014 0)
(t2015 0)
(t2016 0)
(t2017 0)
(t2018 0)
(t2019 0)
(t2020 0)
(t2021 0)
(t2022 0)
(t2023 0)
(t2024 0)
(t2025 0)
(t2026 0)
(t2027 0)
(t2028 0)
(t2029 0)
(t2030 0)
(t2031 0)
(t2032 0)
(t2033 0)
(t2034 0)
(t2035 0)
(t2036 0)
(t2037 0)
(t2038 0)
(t2039 0)
(t2040 0)
(t2041 0)
(t2042 0)
(t2043 0)
(t2044 0)
(t2045 0)
(t2046 0)
(t2047 0)
(t2048 0)
(t2049 0)
(t2050 0)
(t2051 0)
(t2052 0)
(t2053 0)
(t2054 0)
(t2055 0)
(t2056 0)
(t2057 0)
(t2058 0)
(t2059 0)
(t2060 0)
(t2061 0)
(t2062 0)
(t2063 0)
(t2064 0)
(t2065 0)
(t2066 0)
(t2067 0)
(t2068 0)
(t2069 0)
(t2070 0)
(t2071 0)
(t2072 0)
(t2073 0)
(t2074 0)
(t2075 0)
(t2076 0)
(t2077 0)
(t2078 0)
(t2079 0)
(t2080 0)
(t2081 0)
(t2082 0)
(t2083 0)
(t2084 0)
(t2085 0)
(t2086 0)
(t2087 0)
(t2088 0)
(t2089 0)
(t2090 0)
(t2091 0)
(t2092 0)
(t2093 0)
(t2094 0)
(t2095 0)
(t2096 0)
(t2097 0)
(t2098 0)
(t2099 0)
(t2100 0)
(t2101 0)
(t2102 0)
(t2103 0)
(t2104 0)
(t2105 0)
(t2106 0)
(t2107 0)
(t2108 0)
(t2109 0)
(t2110 0)
(t2111 0)
(t2112 0)
(t2113 0)
(t2114 0)
(t2115 0)
(t2116 0)
(t2117 0)
(t2118 0)
(t2119 0)
(t2120 0)
(t2121 0)
(t2122 0)
(t2123 0)
(t2124 0)
(t2125 0)
(t2126 0)
(t2127 0)
(t2128 0)
(t2129 0)
(t2130 0)
(t2131 0)
(t2132 0)
(t2133 0)
(t2134 0)
(t2135 0)
(t2136 0)
(t2137 0)
(t2138 0)
(t2139 0)
(t2140 0)
(t2141 0)
(t2142 0)
(t2143 0)
(t2144 0)
(t2145 0)
(t2146 0)
(t2147 0)
(t2148 0)
(t2149 0)
(t2150 0)
(t2151 0)
(t2152 0)
(t2153 0)
(t2154 0)
(t2155 0)
(t2156 0)
(t2157 0)
(t2158 0)
(t2159 0)
(t2160 0)
(t2161 0)
(t2162 0)
(t2163 0)
(t2164 0)
(t2165 0)
(t2166 0)
(t2167 0)
(t2168 0)
(t2169 0)
(t2170 0)
(t2171 0)
(t2172 0)
(t2173 0)
(t2174 0)
(t2175 0)
(t2176 0)
(t2177 0)
(t2178 0)
(t2179 0)
(t2180 0)
(t2181 0)
(t2182 0)
(t2183 0)
(t2184 0)
(t2185 0)
(t2186 0)
(t2187 0)
(t2188 0)
(t2189 0)
(t2190 0)
(t2191 0)
(t2192 0)
(t2193 0)
(t2194 0)
(t2195 0)
(t2196 0)
(t2197 0)
(t2198 0)
(t2199 0)
(t2200 0)
(t2201 0)
(t2202 0)
(t2203 0)
(t2204 0)
(t2205 0)
(t2206 0)
(t2207 0)
(t2208 0)
(t2209 0)
(t2210 0)
(t2211 0)
(t2212 0)
(t2213 0)
(t2214 0)
(t2215 0)
(t2216 0)
(t2217 0)
(t2218 0)
(t2219 0)
(t2220 0)
(t2221 0)
(t2222 0)
(t2223 0)
(t2224 0)
(t2225 0)
(t2226 0)
(t2227 0)
(t2228 0)
(t2229 0)
(t2230 0)
(t2231 0)
(t2232 0)
(t2233 0)
(t2234 0)
(t2235 0)
(t2236 0)
(t2237 0)
(t2238 0)
(t2239 0)
(t2240 0)
(t2241 0)
(t2242 0)
(t2243 0)
(t2244 0)
(t2245 0)
(t2246 0)
(t2247 0)
(t2248 0)
(t2249 0)
(t2250 0)
(t2251 0)
(t2252 0)
(t2253 0)
(t2254 0)
(t2255 0)
(t2256 0)
(t2257 0)
(t2258 0)
(t2259 0)
(t2260 0)
(t2261 0)
(t2262 0)
(t2263 0)
(t2264 0)
(t2265 0)
(t2266 0)
(t2267 0)
(t2268 0)
(t2269 0)
(t2270 0)
(t2271 0)
(t2272 0)
(t2273 0)
(t2274 0)
(t2275 0)
(t2276 0)
(t2277 0)
(t2278 0)
(t2279 0)
(t2280 0)
(t2281 0)
(t2282 0)
(t2283 0)
(t2284 0)
(t2285 0)
(t2286 0)
(t2287 0)
(t2288 1)
(t2289 0)
(t2290 0)
(t2291 0)
(t2292 0)
(t2293 0)
(t2294 0)
(t2295 0)
(t2296 0)
(t2297 0)
(t2298 0)
(t2299 0)
(t2300 0)
(t2301 0)
(t2302 0)
(t2303 0)
(t2304 0)
(t2305 1)
(t2306 0)
(t2307 0)
(t2308 0)
(t2309 0)
(t2310 0)
(t2311 0)
(t2312 0)
(t2313 0)
(t2314 0)
(t2315 0)
(t2316 0)
(t2317 0)
(t2318 0)
(t2319 0)
(t2320 0)
(t2321 0)
(t2322 0)
(t2323 0)
(t2324 0)
(t2325 0)
(t2326 1)
(t2327 0)
(t2328 0)
(t2329 0)
(t2330 0)
(t2331 0)
(t2332 0)
(t2333 0)
(t2334 0)
(t2335 0)
(t2336 0)
(t2337 0)
(t2338 0)
(t2339 0)
(t2340 0)
(t2341 0)
(t2342 0)
(t2343 0)
(t2344 0)
(t2345 0)
(t2346 0)
(t2347 0)
(t2348 0)
(t2349 0)
(t2350 0)
(t2351 0)
(t2352 0)
(t2353 0)
(t2354 0)
(t2355 0)
(t2356 0)
(t2357 0)
(t2358 0)
(t2359 0)
(t2360 0)
(t2361 0)
(t2362 0)
(t2363 0)
(t2364 0)
(t2365 0)
(t2366 0)
(t2367 0)
(t2368 0)
(t2369 0)
(t2370 0)
(t2371 0)
(t2372 0)
(t2373 0)
(t2374 0)
(t2375 0)
(t2376 0)
(t2377 0)
(t2378 0)
(t2379 0)
(t2380 0)
(t2381 0)
(t2382 0)
(t2383 0)
(t2384 0)
(t2385 0)
(t2386 0)
(t2387 0)
(t2388 0)
(t2389 0)
(t2390 0)
(t2391 0)
(t2392 0)
(t2393 0)
(t2394 0)
(t2395 0)
(t2396 0)
(t2397 0)
(t2398 0)
(t2399 0)
(t2400 0)
(t2401 0)
(t2402 0)
(t2403 0)
(t2404 3)
(t2405 1)
(t2406 0)
(t2407 0)
(t2408 0)
(t2409 0)
(t2410 0)
(t2411 0)
(t2412 0)
(t2413 0)
(t2414 0)
(t2415 0)
(t2416 0)
(t2417 0)
(t2418 0)
(t2419 0)
(t2420 0)
(t2421 0)
(t2422 0)
(t2423 0)
(t2424 0)
(t2425 0)
(t2426 0)
(t2427 0)
(t2428 1)
(t2429 0)
(t2430 1)
(t2431 0)
(t2432 0)
(t2433 0)
(t2434 1)
(t2435 0)
(t2436 0)
(t2437 0)
(t2438 0)
(t2439 0)
(t2440 1)
(t2441 0)
(t2442 0)
(t2443 0)
(t2444 0)
(t2445 0)
(t2446 0)
(t2447 0)
(t2448 0)
(t2449 0)
(t2450 0)
(t2451 0)
(t2452 1)
(t2453 0)
(t2454 0)
(t2455 0)
(t2456 0)
(t2457 0)
(t2458 0)
(t2459 0)
(t2460 0)
(t2461 0)
(t2462 0)
(t2463 0)
(t2464 0)
(t2465 0)
(t2466 0)
(t2467 0)
(t2468 0)
(t2469 0)
(t2470 0)
(t2471 0)
(t2472 0)
(t2473 0)
(t2474 0)
(t2475 0)
(t2476 0)
(t2477 0)
(t2478 1)
(t2479 0)
(t2480 0)
(t2481 0)
(t2482 0)
(t2483 0)
(t2484 0)
(t2485 0)
(t2486 0)
(t2487 0)
(t2488 0)
(t2489 0)
(t2490 0)
(t2491 0)
(t2492 0)
(t2493 0)
(t2494 0)
(t2495 0)
(t2496 0)
(t2497 0)
(t2498 0)
(t2499 0)
(t2500 0)
(t2501 0)
(t2502 0)
(t2503 0)
(t2504 0)
(t2505 0)
(t2506 0)
(t2507 0)
(t2508 0)
(t2509 0)
(t2510 0)
(t2511 0)
(t2512 0)
(t2513 0)
(t2514 0)
(t2515 0)
(t2516 0)
(t2517 0)
(t2518 0)
(t2519 0)
(t2520 0)
(t2521 0)
(t2522 0)
(t2523 0)
(t2524 0)
(t2525 0)
(t2526 0)
(t2527 0)
(t2528 0)
(t2529 0)
(t2530 0)
(t2531 0)
(t2532 0)
(t2533 0)
(t2534 0)
(t2535 0)
(t2536 0)
(t2537 0)
(t2538 0)
(t2539 0)
(t2540 0)
(t2541 0)
(t2542 0)
(t2543 0)
(t2544 0)
(t2545 0)
(t2546 0)
(t2547 0)
(t2548 0)
(t2549 0)
(t2550 0)
(t2551 0)
(t2552 0)
(t2553 0)
(t2554 0)
(t2555 0)
(t2556 0)
(t2557 0)
(t2558 0)
(t2559 0)
(t2560 0)
(t2561 0)
(t2562 0)
(t2563 0)
(t2564 0)
(t2565 0)
(t2566 0)
(t2567 0)
(t2568 0)
(t2569 0)
(t2570 0)
(t2571 0)
(t2572 0)
(t2573 0)
(t2574 0)
(t2575 0)
(t2576 0)
(t2577 0)
(t2578 0)
(t2579 0)
(t2580 0)
(t2581 0)
(t2582 0)
(t2583 0)
(t2584 0)
(t2585 0)
(t2586 0)
(t2587 0)
(t2588 0)
(t2589 0)
(t2590 0)
(t2591 0)
(t2592 0)
(t2593 0)
(t2594 0)
(t2595 0)
(t2596 0)
(t2597 0)
(t2598 0)
(t2599 0)
(t2600 0)
(t2601 0)
(t2602 0)
(t2603 0)
(t2604 0)
(t2605 0)
(t2606 0)
(t2607 0)
(t2608 0)
(t2609 0)
(t2610 0)
(t2611 0)
(t2612 0)
(t2613 0)
(t2614 0)
(t2615 0)
(t2616 0)
(t2617 0)
(t2618 0)
(t2619 0)
(t2620 0)
(t2621 0)
(t2622 0)
(t2623 0)
(t2624 0)
(t2625 0)
(t2626 0)
(t2627 0)
(t2628 0)
(t2629 0)
(t2630 0)
(t2631 0)
(t2632 0)
(t2633 0)
(t2634 0)
(t2635 0)
(t2636 0)
(t2637 0)
(t2638 0)
(t2639 0)
(t2640 0)
(t2641 0)
(t2642 0)
(t2643 0)
(t2644 0)
(t2645 0)
(t2646 0)
(t2647 0)
(t2648 0)
(t2649 0)
(t2650 0)
(t2651 0)
(t2652 0)
(t2653 0)
(t2654 0)
(t2655 0)
(t2656 0)
(t2657 0)
(t2658 0)
(t2659 0)
(t2660 0)
(t2661 0)
(t2662 0)
(t2663 0)
(t2664 0)
(t2665 0)
(t2666 0)
(t2667 0)
(t2668 0)
(t2669 0)
(t2670 0)
(t2671 0)
(t2672 0)
(t2673 0)
(t2674 0)
(t2675 0)
(t2676 0)
(t2677 0)
(t2678 0)
(t2679 0)
(t2680 0)
(t2681 0)
(t2682 0)
(t2683 0)
(t2684 0)
(t2685 0)
(t2686 0)
(t2687 0)
(t2688 0)
(t2689 0)
(t2690 0)
(t2691 0)
(t2692 0)
(t2693 0)
(t2694 0)
(t2695 0)
(t2696 0)
(t2697 0)
(t2698 0)
(t2699 0)
(t2700 0)
(t2701 0)
(t2702 0)
(t2703 0)
(t2704 0)
(t2705 0)
(t2706 0)
(t2707 0)
(t2708 0)
(t2709 0)
(t2710 0)
(t2711 0)
(t2712 0)
(t2713 0)
(t2714 0)
(t2715 0)
(t2716 0)
(t2717 0)
(t2718 0)
(t2719 0)
(t2720 0)
(t2721 0)
(t2722 0)
(t2723 0)
(t2724 0)
(t2725 0)
(t2726 0)
(t2727 0)
(t2728 0)
(t2729 0)
(t2730 0)
(t2731 0)
(t2732 0)
(t2733 0)
(t2734 0)
(t2735 0)
(t2736 0)
(t2737 0)
(t2738 0)
(t2739 0)
(t2740 0)
(t2741 0)
(t2742 0)
(t2743 0)
(t2744 0)
(t2745 0)
(t2746 0)
(t2747 0)
(t2748 0)
(t2749 0)
(t2750 0)
(t2751 0)
(t2752 0)
(t2753 0)
(t2754 0)
(t2755 0)
(t2756 0)
(t2757 0)
(t2758 0)
(t2759 0)
(t2760 0)
(t2761 0)
(t2762 0)
(t2763 0)
(t2764 0)
(t2765 0)
(t2766 0)
(t2767 0)
(t2768 0)
(t2769 0)
(t2770 0)
(t2771 0)
(t2772 0)
(t2773 0)
(t2774 0)
(t2775 0)
(t2776 0)
(t2777 0)
(t2778 0)
(t2779 0)
(t2780 0)
(t2781 0)
(t2782 0)
(t2783 0)
(t2784 0)
(t2785 0)
(t2786 0)
(t2787 0)
(t2788 0)
(t2789 0)
(t2790 0)
(t2791 0)
(t2792 0)
(t2793 0)
(t2794 0)
(t2795 0)
(t2796 0)
(t2797 0)
(t2798 0)
(t2799 0)
(t2800 0)
(t2801 0)
(t2802 0)
(t2803 0)
(t2804 0)
(t2805 0)
(t2806 0)
(t2807 0)
(t2808 0)
(t2809 0)
(t2810 0)
(t2811 0)
(t2812 0)
(t2813 0)
(t2814 0)
(t2815 0)
(t2816 0)
(t2817 0)
(t2818 0)
(t2819 0)
(t2820 0)
(t2821 0)
(t2822 0)
(t2823 0)
(t2824 0)
(t2825 0)
(t2826 0)
(t2827 0)
(t2828 0)
(t2829 0)
(t2830 0)
(t2831 0)
(t2832 0)
(t2833 0)
(t2834 0)
(t2835 0)
(t2836 0)
(t2837 0)
(t2838 0)
(t2839 0)
(t2840 0)
(t2841 0)
(t2842 0)
(t2843 0)
(t2844 0)
(t2845 0)
(t2846 0)
(t2847 0)
(t2848 0)
(t2849 0)
(t2850 0)
(t2851 0)
(t2852 0)
(t2853 0)
(t2854 0)
(t2855 0)
(t2856 0)
(t2857 0)
(t2858 0)
(t2859 0)
(t2860 0)
(t2861 0)
(t2862 0)
(t2863 0)
(t2864 0)
(t2865 0)
(t2866 0)
(t2867 0)
(t2868 0)
(t2869 0)
(t2870 0)
(t2871 0)
(t2872 0)
(t2873 0)
(t2874 0)
(t2875 0)
(t2876 0)
(t2877 0)
(t2878 0)
(t2879 0)
(t2880 0)
(t2881 0)
(t2882 0)
(t2883 0)
(t2884 0)
(t2885 0)
(t2886 0)
(t2887 0)
(t2888 0)
(t2889 0)
(t2890 0)
(t2891 0)
(t2892 0)
(t2893 0)
(t2894 0)
(t2895 0)
(t2896 0)
(t2897 0)
(t2898 0)
(t2899 0)
(t2900 0)
(t2901 1)
(t2902 0)
(t2903 0)
(t2904 0)
(t2905 0)
(t2906 0)
(t2907 0)
(t2908 0)
(t2909 0)
(t2910 0)
(t2911 0)
(t2912 0)
(t2913 0)
(t2914 0)
(t2915 0)
(t2916 0)
(t2917 0)
(t2918 0)
(t2919 0)
(t2920 0)
(t2921 0)
(t2922 0)
(t2923 0)
(t2924 0)
(t2925 0)
(t2926 0)
(t2927 0)
(t2928 0)
(t2929 0)
(t2930 0)
(t2931 0)
(t2932 0)
(t2933 0)
(t2934 0)
(t2935 0)
(t2936 0)
(t2937 0)
(t2938 0)
(t2939 0)
(t2940 0)
(t2941 0)
(t2942 0)
(t2943 0)
(t2944 0)
(t2945 0)
(t2946 0)
(t2947 0)
(t2948 0)
(t2949 0)
(t2950 0)
(t2951 0)
(t2952 0)
(t2953 0)
(t2954 0)
(t2955 0)
(t2956 0)
(t2957 0)
(t2958 0)
(t2959 0)
(t2960 0)
(t2961 0)
(t2962 0)
(t2963 0)
(t2964 0)
(t2965 0)
(t2966 0)
(t2967 0)
(t2968 0)
(t2969 0)
(t2970 0)
(t2971 0)
(t2972 0)
(t2973 0)
(t2974 0)
(t2975 0)
(t2976 0)
(t2977 0)
(t2978 0)
(t2979 0)
(t2980 0)
(t2981 0)
(t2982 0)
(t2983 0)
(t2984 0)
(t2985 0)
(t2986 0)
(t2987 0)
(t2988 0)
(t2989 0)
(t2990 0)
(t2991 0)
(t2992 0)
(t2993 0)
(t2994 0)
(t2995 0)
(t2996 0)
(t2997 0)
(t2998 0)
(t2999 0)
(t3000 0)
(t3001 0)
(t3002 0)
(t3003 0)
(t3004 0)
(t3005 0)
(t3006 0)
(t3007 0)
(t3008 0)
(t3009 0)
(t3010 0)
(t3011 0)
(t3012 0)
(t3013 0)
(t3014 0)
(t3015 0)
(t3016 0)
(t3017 0)
(t3018 0)
(t3019 0)
(t3020 0)
(t3021 0)
(t3022 0)
(t3023 0)
(t3024 0)
(t3025 0)
(t3026 0)
(t3027 0)
(t3028 0)
(t3029 0)
(t3030 0)
(t3031 0)
(t3032 0)
(t3033 0)
(t3034 0)
(t3035 0)
(t3036 0)
(t3037 0)
(t3038 0)
(t3039 0)
(t3040 0)
(t3041 0)
(t3042 0)
(t3043 0)
(t3044 0)
(t3045 0)
(t3046 0)
(t3047 0)
(t3048 0)
(t3049 0)
(t3050 0)
(t3051 0)
(t3052 0)
(t3053 0)
(t3054 0)
(t3055 0)
(t3056 0)
(t3057 0)
(t3058 0)
(t3059 0)
(t3060 0)
(t3061 0)
(t3062 0)
(t3063 0)
(t3064 0)
(t3065 0)
(t3066 0)
(t3067 0)
(t3068 0)
(t3069 0)
(t3070 0)
(t3071 0)
(t3072 0)
(t3073 0)
(t3074 0)
(t3075 0)
(t3076 0)
(t3077 0)
(t3078 0)
(t3079 0)
(t3080 0)
(t3081 0)
(t3082 0)
(t3083 0)
(t3084 0)
(t3085 0)
(t3086 0)
(t3087 0)
(t3088 0)
(t3089 0)
(t3090 0)
(t3091 0)
(t3092 0)
(t3093 0)
(t3094 0)
(t3095 0)
(t3096 0)
(t3097 0)
(t3098 0)
(t3099 0)
(t3100 0)
(t3101 0)
(t3102 0)
(t3103 0)
(t3104 0)
(t3105 0)
(t3106 0)
(t3107 0)
(t3108 0)
(t3109 0)
(t3110 0)
(t3111 0)
(t3112 0)
(t3113 0)
(t3114 0)
(t3115 0)
(t3116 0)
(t3117 0)
(t3118 0)
(t3119 0)
(t3120 0)
(t3121 0)
(t3122 0)
(t3123 0)
(t3124 0)
(t3125 0)
(t3126 0)
(t3127 0)
(t3128 0)
(t3129 0)
(t3130 0)
(t3131 0)
(t3132 0)
(t3133 0)
(t3134 0)
(t3135 0)
(t3136 0)
(t3137 0)
(t3138 0)
(t3139 0)
(t3140 0)
(t3141 0)
(t3142 0)
(t3143 0)
(t3144 0)
(t3145 0)
(t3146 0)
(t3147 0)
(t3148 0)
(t3149 0)
(t3150 0)
(t3151 0)
(t3152 0)
(t3153 0)
(t3154 0)
(t3155 0)
(t3156 0)
(t3157 0)
(t3158 0)
(t3159 0)
(t3160 0)
(t3161 0)
(t3162 0)
(t3163 0)
(t3164 0)
(t3165 0)
(t3166 0)
(t3167 0)
(t3168 0)
(t3169 0)
(t3170 0)
(t3171 0)
(t3172 0)
(t3173 0)
(t3174 0)
(t3175 0)
(t3176 0)
(t3177 0)
(t3178 0)
(t3179 0)
(t3180 0)
(t3181 0)
(t3182 0)
(t3183 0)
(t3184 0)
(t3185 0)
(t3186 0)
(t3187 0)
(t3188 0)
(t3189 0)
(t3190 0)
(t3191 0)
(t3192 0)
(t3193 0)
(t3194 0)
(t3195 0)
(t3196 0)
(t3197 0)
(t3198 0)
(t3199 0)
(t3200 0)
(t3201 0)
(t3202 0)
(t3203 0)
(t3204 0)
(t3205 0)
(t3206 0)
(t3207 0)
(t3208 0)
(t3209 0)
(t3210 0)
(t3211 0)
(t3212 0)
(t3213 0)
(t3214 0)
(t3215 0)
(t3216 0)
(t3217 0)
(t3218 0)
(t3219 0)
(t3220 0)
(t3221 0)
(t3222 0)
(t3223 0)
(t3224 0)
(t3225 0)
(t3226 0)
(t3227 0)
(t3228 0)
(t3229 0)
(t3230 0)
(t3231 0)
(t3232 0)
(t3233 0)
(t3234 0)
(t3235 0)
(t3236 0)
(t3237 0)
(t3238 0)
(t3239 0)
(t3240 0)
(t3241 0)
(t3242 0)
(t3243 0)
(t3244 0)
(t3245 0)
(t3246 0)
(t3247 0)
(t3248 0)
(t3249 0)
(t3250 0)
(t3251 0)
(t3252 0)
(t3253 0)
(t3254 0)
(t3255 0)
(t3256 0)
(t3257 0)
(t3258 0)
(t3259 0)
(t3260 0)
(t3261 0)
(t3262 0)
(t3263 0)
(t3264 0)
(t3265 0)
(t3266 0)
(t3267 0)
(t3268 0)
(t3269 0)
(t3270 0)
(t3271 0)
(t3272 0)
(t3273 0)
(t3274 0)
(t3275 0)
(t3276 0)
(t3277 0)
(t3278 0)
(t3279 0)
(t3280 0)
(t3281 0)
(t3282 0)
(t3283 0)
(t3284 0)
(t3285 0)
(t3286 0)
(t3287 0)
(t3288 0)
(t3289 0)
(t3290 0)
(t3291 0)
(t3292 0)
(t3293 0)
(t3294 0)
(t3295 0)
(t3296 0)
(t3297 0)
(t3298 0)
(t3299 0)
(t3300 0)
(t3301 0)
(t3302 0)
(t3303 0)
(t3304 0)
(t3305 0)
(t3306 0)
(t3307 0)
(t3308 0)
(t3309 0)
(t3310 0)
(t3311 0)
(t3312 0)
(t3313 0)
(t3314 0)
(t3315 0)
(t3316 0)
(t3317 0)
(t3318 0)
(t3319 0)
(t3320 0)
(t3321 0)
(t3322 0)
(t3323 0)
(t3324 0)
(t3325 0)
(t3326 0)
(t3327 0)
(t3328 0)
(t3329 0)
(t3330 0)
(t3331 0)
(t3332 0)
(t3333 0)
(t3334 0)
(t3335 0)
(t3336 0)
(t3337 0)
(t3338 0)
(t3339 0)
(t3340 0)
(t3341 0)
(t3342 0)
(t3343 0)
(t3344 0)
(t3345 0)
(t3346 0)
(t3347 0)
(t3348 0)
(t3349 0)
(t3350 0)
(t3351 0)
(t3352 0)
(t3353 0)
(t3354 0)
(t3355 0)
(t3356 0)
(t3357 0)
(t3358 0)
(t3359 0)
(t3360 0)
(t3361 0)
(t3362 0)
(t3363 0)
(t3364 0)
(t3365 0)
(t3366 0)
(t3367 0)
(t3368 0)
(t3369 0)
(t3370 0)
(t3371 0)
(t3372 0)
(t3373 0)
(t3374 0)
(t3375 0)
(t3376 0)
(t3377 0)
(t3378 0)
(t3379 0)
(t3380 0)
(t3381 0)
(t3382 0)
(t3383 0)
(t3384 0)
(t3385 0)
(t3386 0)
(t3387 0)
(t3388 0)
(t3389 0)
(t3390 0)
(t3391 0)
(t3392 0)
(t3393 0)
(t3394 0)
(t3395 0)
(t3396 0)
(t3397 0)
(t3398 0)
(t3399 0)
(t3400 0)
(t3401 0)
(t3402 0)
(t3403 0)
(t3404 0)
(t3405 0)
(t3406 0)
(t3407 0)
(t3408 0)
(t3409 0)
(t3410 0)
(t3411 0)
(t3412 0)
(t3413 0)
(t3414 0)
(t3415 timeout
0)
(t3416 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 52347ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 909 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 64 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 65 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 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 3702/3702 (removed 0) transitions.
[2024-05-20 22:20:44] [INFO ] Invariant cache hit.
[2024-05-20 22:20:45] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-20 22:20:45] [INFO ] Invariant cache hit.
[2024-05-20 22:20:46] [INFO ] State equation strengthened by 3582 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :317505 after 3.72327e+07
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :3.72327e+07 after 3.95522e+07
[2024-05-20 22:21:06] [INFO ] Implicit Places using invariants and state equation in 21216 ms returned []
Implicit Place search using SMT with State Equation took 22081 ms to find 0 implicit places.
[2024-05-20 22:21:06] [INFO ] Redundant transitions in 108 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-20 22:21:06] [INFO ] Invariant cache hit.
[2024-05-20 22:21:06] [INFO ] State equation strengthened by 3582 read => feed constraints.
Detected timeout of ITS tools.
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 32569ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 32601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54877 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-20 22:21:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (73 resets) in 79 ms. (125 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:21:39] [INFO ] Invariant cache hit.
[2024-05-20 22:21:39] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:21:39] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:21:40] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2024-05-20 22:21:40] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:21:40] [INFO ] [Real]Added 3582 Read/Feed constraints in 243 ms returned sat
[2024-05-20 22:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:21:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:21:40] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:21:41] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-20 22:21:41] [INFO ] [Nat]Added 3582 Read/Feed constraints in 254 ms returned sat
[2024-05-20 22:21:41] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:21:42] [INFO ] Added : 5 causal constraints over 1 iterations in 536 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 229 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 230 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-20 22:21:43] [INFO ] Computed 32 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7143 resets) in 7781 ms. (128 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 951 ms. (1050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:21:52] [INFO ] Invariant cache hit.
[2024-05-20 22:21:52] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:21:52] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:21:52] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2024-05-20 22:21:53] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:21:53] [INFO ] [Real]Added 3604 Read/Feed constraints in 264 ms returned sat
[2024-05-20 22:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:21:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:21:53] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:21:54] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-05-20 22:21:54] [INFO ] [Nat]Added 3604 Read/Feed constraints in 277 ms returned sat
[2024-05-20 22:21:54] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 190 ms.
[2024-05-20 22:21:55] [INFO ] Added : 5 causal constraints over 1 iterations in 569 ms. Result :sat
Minimization took 4601 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 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 66 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 58 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:21:59] [INFO ] Invariant cache hit.
[2024-05-20 22:22:00] [INFO ] Implicit Places using invariants in 896 ms returned []
[2024-05-20 22:22:00] [INFO ] Invariant cache hit.
[2024-05-20 22:22:01] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:22:22] [INFO ] Implicit Places using invariants and state equation in 21531 ms returned []
Implicit Place search using SMT with State Equation took 22433 ms to find 0 implicit places.
[2024-05-20 22:22:22] [INFO ] Redundant transitions in 111 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:22:22] [INFO ] Invariant cache hit.
[2024-05-20 22:22:22] [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 32272ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54929 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:22:54] [INFO ] Flatten gal took : 85 ms
RANDOM walk for 40000 steps (284 resets) in 614 ms. (65 steps per ms) remains 2/2 properties
[2024-05-20 22:22:54] [INFO ] Flatten gal took : 118 ms
[2024-05-20 22:22:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13803631250691204712.gal : 19 ms
[2024-05-20 22:22:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18264763136031162119.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13803631250691204712.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18264763136031162119.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality18264763136031162119.prop.
Interrupted probabilistic random walk after 181139 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 181139 steps, saw 32446 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-20 22:22:57] [INFO ] Invariant cache hit.
[2024-05-20 22:22: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-20 22:22:58] [INFO ] Deduced a trap composed of 2 places in 46 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-20 22:22:58] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 7 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 47 places in 575 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:23:00] [INFO ] Deduced a trap composed of 43 places in 623 ms of which 7 ms to minimize.
[2024-05-20 22:23:00] [INFO ] Deduced a trap composed of 42 places in 644 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1733
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1733 after 1773
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1773 after 1873
[2024-05-20 22:23:01] [INFO ] Deduced a trap composed of 45 places in 646 ms of which 7 ms to minimize.
[2024-05-20 22:23:02] [INFO ] Deduced a trap composed of 50 places in 617 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1873 after 2124
[2024-05-20 22:23:02] [INFO ] Deduced a trap composed of 41 places in 616 ms of which 6 ms to minimize.
[2024-05-20 22:23:03] [INFO ] Deduced a trap composed of 35 places in 576 ms of which 5 ms to minimize.
SMT process timed out in 5424ms, 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 61 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 61 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (281 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
Interrupted probabilistic random walk after 201337 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 201337 steps, saw 34858 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-20 22:23:06] [INFO ] Invariant cache hit.
[2024-05-20 22:23: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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1020 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:23:06] [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-20 22:23:07] [INFO ] Deduced a trap composed of 43 places in 674 ms of which 7 ms to minimize.
[2024-05-20 22:23:08] [INFO ] Deduced a trap composed of 40 places in 674 ms of which 6 ms to minimize.
[2024-05-20 22:23:09] [INFO ] Deduced a trap composed of 70 places in 652 ms of which 8 ms to minimize.
[2024-05-20 22:23:09] [INFO ] Deduced a trap composed of 39 places in 597 ms of which 6 ms to minimize.
[2024-05-20 22:23:10] [INFO ] Deduced a trap composed of 44 places in 548 ms of which 5 ms to minimize.
[2024-05-20 22:23:10] [INFO ] Deduced a trap composed of 35 places in 554 ms of which 10 ms to minimize.
[2024-05-20 22:23:11] [INFO ] Deduced a trap composed of 47 places in 526 ms of which 5 ms to minimize.
[2024-05-20 22:23:11] [INFO ] Deduced a trap composed of 58 places in 549 ms of which 17 ms to minimize.
[2024-05-20 22:23:12] [INFO ] Deduced a trap composed of 35 places in 507 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2024-05-20 22:23:12] [INFO ] Deduced a trap composed of 41 places in 513 ms of which 5 ms to minimize.
[2024-05-20 22:23:13] [INFO ] Deduced a trap composed of 44 places in 477 ms of which 5 ms to minimize.
[2024-05-20 22:23:13] [INFO ] Deduced a trap composed of 48 places in 486 ms of which 6 ms to minimize.
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 48 places in 471 ms of which 6 ms to minimize.
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 48 places in 481 ms of which 6 ms to minimize.
[2024-05-20 22:23:15] [INFO ] Deduced a trap composed of 48 places in 470 ms of which 5 ms to minimize.
[2024-05-20 22:23:15] [INFO ] Deduced a trap composed of 44 places in 475 ms of which 5 ms to minimize.
[2024-05-20 22:23:16] [INFO ] Deduced a trap composed of 35 places in 460 ms of which 6 ms to minimize.
[2024-05-20 22:23:16] [INFO ] Deduced a trap composed of 47 places in 444 ms of which 5 ms to minimize.
[2024-05-20 22:23:17] [INFO ] Deduced a trap composed of 47 places in 440 ms of which 5 ms to minimize.
[2024-05-20 22:23:17] [INFO ] Deduced a trap composed of 47 places in 428 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-20 22:23:18] [INFO ] Deduced a trap composed of 38 places in 429 ms of which 5 ms to minimize.
[2024-05-20 22:23:18] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 4 ms to minimize.
[2024-05-20 22:23:19] [INFO ] Deduced a trap composed of 37 places in 437 ms of which 4 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 13840 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-20 22:23:20] [INFO ] Deduced a trap composed of 2 places in 45 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-20 22:23:21] [INFO ] Deduced a trap composed of 44 places in 671 ms of which 7 ms to minimize.
[2024-05-20 22:23:22] [INFO ] Deduced a trap composed of 50 places in 655 ms of which 6 ms to minimize.
[2024-05-20 22:23:22] [INFO ] Deduced a trap composed of 37 places in 643 ms of which 6 ms to minimize.
[2024-05-20 22:23:22] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:23:22] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 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 4256 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 18182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 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 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 57 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:23:25] [INFO ] Invariant cache hit.
[2024-05-20 22:23:25] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-20 22:23:25] [INFO ] Invariant cache hit.
[2024-05-20 22:23:26] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:23:45] [INFO ] Flatten gal took : 74 ms
[2024-05-20 22:23:45] [INFO ] Applying decomposition
[2024-05-20 22:23:45] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12480136549425161055.txt' '-o' '/tmp/graph12480136549425161055.bin' '-w' '/tmp/graph12480136549425161055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12480136549425161055.bin' '-l' '-1' '-v' '-w' '/tmp/graph12480136549425161055.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:23:45] [INFO ] Decomposing Gal with order
[2024-05-20 22:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:23:45] [INFO ] Removed a total of 2825 redundant transitions.
[2024-05-20 22:23:45] [INFO ] Flatten gal took : 206 ms
[2024-05-20 22:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 3396 labels/synchronizations in 137 ms.
[2024-05-20 22:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16449661931023921393.gal : 26 ms
[2024-05-20 22:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3551642788560153892.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16449661931023921393.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3551642788560153892.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3551642788560153892.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 86
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :86 after 86
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :86 after 4944
[2024-05-20 22:23:48] [INFO ] Implicit Places using invariants and state equation in 22788 ms returned []
Implicit Place search using SMT with State Equation took 23701 ms to find 0 implicit places.
[2024-05-20 22:23:48] [INFO ] Redundant transitions in 106 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:23:48] [INFO ] Invariant cache hit.
[2024-05-20 22:23:48] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4944 after 466742
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :466742 after 2.37317e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.37317e+07 after 2.83253e+07
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 32687ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56605 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 5 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-20 22:24:21] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 22:24:21] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:24:21] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:24:21] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:24:21] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:24:21] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:24:21] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:24:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12182990814821022054.gal : 1 ms
[2024-05-20 22:24:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5166783063913378978.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12182990814821022054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5166783063913378978.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5166783063913378978.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001689,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.001955,3888,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 113 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 162405 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-20 22:24:21] [INFO ] Computed 32 invariants in 47 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 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:24:21] [INFO ] Invariant cache hit.
[2024-05-20 22:24:21] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:24:21] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:24:22] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-05-20 22:24:22] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:24:22] [INFO ] [Real]Added 3582 Read/Feed constraints in 241 ms returned sat
[2024-05-20 22:24:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:24:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:24:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:24:23] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-05-20 22:24:23] [INFO ] [Nat]Added 3582 Read/Feed constraints in 264 ms returned sat
[2024-05-20 22:24:24] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:24:24] [INFO ] Added : 6 causal constraints over 2 iterations in 630 ms. Result :sat
Minimization took 936 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 253 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 254 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-20 22:24:25] [INFO ] Computed 32 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7160 resets) in 7894 ms. (126 steps per ms)
BEST_FIRST walk for 1000001 steps (208 resets) in 929 ms. (1075 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:24:34] [INFO ] Invariant cache hit.
[2024-05-20 22:24:34] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:24:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:24:35] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-20 22:24:35] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:24:35] [INFO ] [Real]Added 3604 Read/Feed constraints in 278 ms returned sat
[2024-05-20 22:24:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:24:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:24:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:24:36] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-05-20 22:24:37] [INFO ] [Nat]Added 3604 Read/Feed constraints in 282 ms returned sat
[2024-05-20 22:24:37] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-20 22:24:37] [INFO ] Added : 7 causal constraints over 2 iterations in 638 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 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 75 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-20 22:24:42] [INFO ] Invariant cache hit.
[2024-05-20 22:24:43] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-20 22:24:43] [INFO ] Invariant cache hit.
[2024-05-20 22:24:43] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:25:05] [INFO ] Implicit Places using invariants and state equation in 22610 ms returned []
Implicit Place search using SMT with State Equation took 23474 ms to find 0 implicit places.
[2024-05-20 22:25:05] [INFO ] Redundant transitions in 105 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:25:06] [INFO ] Invariant cache hit.
[2024-05-20 22:25:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
(s283 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 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 0.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)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.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.0timeout
) 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 32426ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56118 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:25:38] [INFO ] Flatten gal took : 80 ms
[2024-05-20 22:25:38] [INFO ] Flatten gal took : 82 ms
RANDOM walk for 40000 steps (283 resets) in 672 ms. (59 steps per ms) remains 2/2 properties
[2024-05-20 22:25:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality543687080056032622.gal : 15 ms
[2024-05-20 22:25:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5953770301280682521.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality543687080056032622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5953770301280682521.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 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
Loading property file /tmp/ReachabilityCardinality5953770301280682521.prop.
Interrupted probabilistic random walk after 183343 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 183343 steps, saw 32679 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-20 22:25:41] [INFO ] Invariant cache hit.
[2024-05-20 22:25: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-20 22:25: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-20 22:25:42] [INFO ] Deduced a trap composed of 39 places in 654 ms of which 6 ms to minimize.
[2024-05-20 22:25:43] [INFO ] Deduced a trap composed of 40 places in 619 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
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
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
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
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
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
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 3086 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
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
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-20 22:25:44] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
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
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
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
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:25:45] [INFO ] Deduced a trap composed of 37 places in 691 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:25:46] [INFO ] Deduced a trap composed of 49 places in 673 ms of which 7 ms to minimize.
[2024-05-20 22:25:46] [INFO ] Deduced a trap composed of 35 places in 449 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 3936 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 7067ms 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 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.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
RANDOM walk for 40000 steps (283 resets) in 482 ms. (82 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 195577 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 195577 steps, saw 34077 distinct states, run finished after 3003 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-20 22:25:52] [INFO ] Invariant cache hit.
[2024-05-20 22:25:52] [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-20 22:25:52] [INFO ] Deduced a trap composed of 2 places in 49 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-20 22:25:53] [INFO ] Deduced a trap composed of 38 places in 630 ms of which 6 ms to minimize.
[2024-05-20 22:25:53] [INFO ] Deduced a trap composed of 35 places in 60 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 2369 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-20 22:25:54] [INFO ] Deduced a trap composed of 2 places in 79 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-20 22:25:55] [INFO ] Deduced a trap composed of 37 places in 636 ms of which 6 ms to minimize.
[2024-05-20 22:25:56] [INFO ] Deduced a trap composed of 49 places in 630 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2024-05-20 22:25:56] [INFO ] Deduced a trap composed of 49 places in 592 ms of which 6 ms to minimize.
[2024-05-20 22:25:57] [INFO ] Deduced a trap composed of 36 places in 560 ms of which 6 ms to minimize.
[2024-05-20 22:25:57] [INFO ] Deduced a trap composed of 43 places in 567 ms of which 5 ms to minimize.
[2024-05-20 22:25:58] [INFO ] Deduced a trap composed of 36 places in 548 ms of which 5 ms to minimize.
[2024-05-20 22:25:58] [INFO ] Deduced a trap composed of 37 places in 566 ms of which 5 ms to minimize.
[2024-05-20 22:25:59] [INFO ] Deduced a trap composed of 36 places in 567 ms of which 6 ms to minimize.
[2024-05-20 22:26:00] [INFO ] Deduced a trap composed of 35 places in 557 ms of which 6 ms to minimize.
[2024-05-20 22:26:00] [INFO ] Deduced a trap composed of 38 places in 580 ms of which 7 ms to minimize.
[2024-05-20 22:26:01] [INFO ] Deduced a trap composed of 36 places in 554 ms of which 6 ms to minimize.
[2024-05-20 22:26:01] [INFO ] Deduced a trap composed of 36 places in 550 ms of which 6 ms to minimize.
[2024-05-20 22:26:02] [INFO ] Deduced a trap composed of 36 places in 540 ms of which 6 ms to minimize.
[2024-05-20 22:26:03] [INFO ] Deduced a trap composed of 36 places in 545 ms of which 6 ms to minimize.
[2024-05-20 22:26:03] [INFO ] Deduced a trap composed of 35 places in 547 ms of which 6 ms to minimize.
[2024-05-20 22:26:04] [INFO ] Deduced a trap composed of 40 places in 531 ms of which 6 ms to minimize.
[2024-05-20 22:26:04] [INFO ] Deduced a trap composed of 41 places in 535 ms of which 5 ms to minimize.
[2024-05-20 22:26:05] [INFO ] Deduced a trap composed of 43 places in 523 ms of which 6 ms to minimize.
[2024-05-20 22:26:05] [INFO ] Deduced a trap composed of 48 places in 487 ms of which 6 ms to minimize.
[2024-05-20 22:26:06] [INFO ] Deduced a trap composed of 38 places in 451 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-20 22:26:06] [INFO ] Deduced a trap composed of 46 places in 459 ms of which 6 ms to minimize.
[2024-05-20 22:26:07] [INFO ] Deduced a trap composed of 38 places in 453 ms of which 5 ms to minimize.
[2024-05-20 22:26:07] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 5 ms to minimize.
[2024-05-20 22:26:08] [INFO ] Deduced a trap composed of 41 places in 442 ms of which 4 ms to minimize.
[2024-05-20 22:26:08] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 5 ms to minimize.
[2024-05-20 22:26:08] [INFO ] Deduced a trap composed of 36 places in 402 ms of which 5 ms to minimize.
[2024-05-20 22:26:09] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 5 ms to minimize.
[2024-05-20 22:26:09] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 5 ms to minimize.
[2024-05-20 22:26:10] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 4 ms to minimize.
[2024-05-20 22:26:10] [INFO ] Deduced a trap composed of 43 places in 399 ms of which 4 ms to minimize.
[2024-05-20 22:26:11] [INFO ] Deduced a trap composed of 43 places in 394 ms of which 5 ms to minimize.
[2024-05-20 22:26:11] [INFO ] Deduced a trap composed of 42 places in 380 ms of which 5 ms to minimize.
[2024-05-20 22:26:11] [INFO ] Deduced a trap composed of 44 places in 411 ms of which 5 ms to minimize.
[2024-05-20 22:26:12] [INFO ] Deduced a trap composed of 45 places in 399 ms of which 5 ms to minimize.
[2024-05-20 22:26:12] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 5 ms to minimize.
[2024-05-20 22:26:13] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 4 ms to minimize.
[2024-05-20 22:26:13] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 4 ms to minimize.
[2024-05-20 22:26:13] [INFO ] Deduced a trap composed of 41 places in 392 ms of which 4 ms to minimize.
[2024-05-20 22:26:14] [INFO ] Deduced a trap composed of 40 places in 444 ms of which 5 ms to minimize.
[2024-05-20 22:26:14] [INFO ] Deduced a trap composed of 51 places in 452 ms of which 6 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-20 22:26:15] [INFO ] Deduced a trap composed of 49 places in 429 ms of which 5 ms to minimize.
[2024-05-20 22:26:15] [INFO ] Deduced a trap composed of 49 places in 420 ms of which 5 ms to minimize.
[2024-05-20 22:26:16] [INFO ] Deduced a trap composed of 37 places in 418 ms of which 4 ms to minimize.
[2024-05-20 22:26:16] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 4 ms to minimize.
[2024-05-20 22:26:16] [INFO ] Deduced a trap composed of 41 places in 363 ms of which 5 ms to minimize.
[2024-05-20 22:26:17] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 4 ms to minimize.
[2024-05-20 22:26:17] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 3 ms to minimize.
[2024-05-20 22:26:17] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 4 ms to minimize.
[2024-05-20 22:26:18] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 4 ms to minimize.
[2024-05-20 22:26:18] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 4 ms to minimize.
[2024-05-20 22:26:18] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 4 ms to minimize.
[2024-05-20 22:26:19] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 4 ms to minimize.
[2024-05-20 22:26:19] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-05-20 22:26:19] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 5 ms to minimize.
[2024-05-20 22:26:20] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 5 ms to minimize.
[2024-05-20 22:26:20] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 3 ms to minimize.
[2024-05-20 22:26:20] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 4 ms to minimize.
[2024-05-20 22:26:20] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 3 ms to minimize.
[2024-05-20 22:26:21] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 3 ms to minimize.
[2024-05-20 22:26:21] [INFO ] Deduced a trap composed of 36 places in 266 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-20 22:26:21] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 4 ms to minimize.
[2024-05-20 22:26:22] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 3 ms to minimize.
[2024-05-20 22:26:22] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 4 ms to minimize.
[2024-05-20 22:26:22] [INFO ] Deduced a trap composed of 52 places in 258 ms of which 3 ms to minimize.
[2024-05-20 22:26:22] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-05-20 22:26:23] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-05-20 22:26:23] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-20 22:26:23] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-05-20 22:26:23] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 3 ms to minimize.
[2024-05-20 22:26:23] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2024-05-20 22:26:23] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-20 22:26:24] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-20 22:26:24] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-05-20 22:26:24] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2024-05-20 22:26:24] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-20 22:26:24] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 2 ms to minimize.
[2024-05-20 22:26:25] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 2 ms to minimize.
[2024-05-20 22:26:25] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-05-20 22:26:25] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2024-05-20 22:26:25] [INFO ] Deduced a trap composed of 39 places in 178 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-20 22:26:25] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-05-20 22:26:26] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-05-20 22:26:26] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2024-05-20 22:26:26] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-05-20 22:26:26] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2024-05-20 22:26:26] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2024-05-20 22:26:26] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 2 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 2 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 2 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 22:26:28] [INFO ] Flatten gal took : 172 ms
[2024-05-20 22:26:28] [INFO ] Applying decomposition
[2024-05-20 22:26:29] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 2 ms to minimize.
[2024-05-20 22:26:29] [INFO ] Flatten gal took : 160 ms
[2024-05-20 22:26:29] [INFO ] Deduced a trap composed of 39 places in 249 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
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6794231237572917533.txt' '-o' '/tmp/graph6794231237572917533.bin' '-w' '/tmp/graph6794231237572917533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6794231237572917533.bin' '-l' '-1' '-v' '-w' '/tmp/graph6794231237572917533.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:26:29] [INFO ] Decomposing Gal with order
[2024-05-20 22:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:26:29] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 2 ms to minimize.
[2024-05-20 22:26:29] [INFO ] Removed a total of 2825 redundant transitions.
[2024-05-20 22:26:29] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 2 ms to minimize.
[2024-05-20 22:26:30] [INFO ] Flatten gal took : 433 ms
[2024-05-20 22:26:30] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-20 22:26:30] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-20 22:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 3454 labels/synchronizations in 253 ms.
[2024-05-20 22:26:30] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-05-20 22:26:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4905574302398886278.gal : 173 ms
[2024-05-20 22:26:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2129231929409725486.prop : 59 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4905574302398886278.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2129231929409725486.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-20 22:26:30] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 2 ms to minimize.
[2024-05-20 22:26:30] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 2 ms to minimize.
[2024-05-20 22:26:31] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:26:31] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2129231929409725486.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2382
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2382 after 2382
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2382 after 2382
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2382 after 2390
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2390 after 2392
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2392 after 2393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2393 after 2399
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2399 after 2405
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2405 after 2421
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2421 after 2435
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2435 after 2588
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 39705 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 42117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 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 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.
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-20 22:26:34] [INFO ] Invariant cache hit.
[2024-05-20 22:26:35] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-20 22:26:35] [INFO ] Invariant cache hit.
[2024-05-20 22:26:35] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2588 after 383990
[2024-05-20 22:26:57] [INFO ] Implicit Places using invariants and state equation in 22671 ms returned []
Implicit Place search using SMT with State Equation took 23499 ms to find 0 implicit places.
[2024-05-20 22:26:57] [INFO ] Redundant transitions in 107 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:26:57] [INFO ] Invariant cache hit.
[2024-05-20 22:26:58] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :383990 after 5.41678e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.41678e+07 after 5.92288e+07
Detected timeout of ITS tools.
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 32460ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56185 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 188719 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-20 22:27:30] [INFO ] Computed 32 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 78 ms. (126 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-20 22:27:30] [INFO ] Invariant cache hit.
[2024-05-20 22:27:30] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:27:30] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 22:27:31] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-20 22:27:31] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:27:31] [INFO ] [Real]Added 3582 Read/Feed constraints in 250 ms returned sat
[2024-05-20 22:27:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:27:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:27:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:27:32] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2024-05-20 22:27:32] [INFO ] [Nat]Added 3582 Read/Feed constraints in 288 ms returned sat
[2024-05-20 22:27:33] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 201 ms.
[2024-05-20 22:27:33] [INFO ] Added : 6 causal constraints over 2 iterations in 689 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 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 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 248 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-20 22:27:34] [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 (7169 resets) in 7828 ms. (127 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 963 ms. (1037 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:27:43] [INFO ] Invariant cache hit.
[2024-05-20 22:27:43] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:27:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:27:44] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2024-05-20 22:27:44] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:27:44] [INFO ] [Real]Added 3604 Read/Feed constraints in 285 ms returned sat
[2024-05-20 22:27:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:27:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:27:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:27:45] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2024-05-20 22:27:45] [INFO ] [Nat]Added 3604 Read/Feed constraints in 265 ms returned sat
[2024-05-20 22:27:46] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:27:46] [INFO ] Added : 5 causal constraints over 1 iterations in 531 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 75 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 75 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-20 22:27:51] [INFO ] Invariant cache hit.
[2024-05-20 22:27:51] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-20 22:27:51] [INFO ] Invariant cache hit.
[2024-05-20 22:27:52] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:28:14] [INFO ] Implicit Places using invariants and state equation in 22578 ms returned []
Implicit Place search using SMT with State Equation took 23449 ms to find 0 implicit places.
[2024-05-20 22:28:14] [INFO ] Redundant transitions in 108 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:28:14] [INFO ] Invariant cache hit.
[2024-05-20 22:28:14] [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 32678ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56360 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:28:47] [INFO ] Flatten gal took : 128 ms
RANDOM walk for 40000 steps (284 resets) in 601 ms. (66 steps per ms) remains 2/2 properties
[2024-05-20 22:28:47] [INFO ] Flatten gal took : 73 ms
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-20 22:28:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16970582110571604979.gal : 21 ms
[2024-05-20 22:28:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7893288509657271673.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16970582110571604979.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7893288509657271673.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7893288509657271673.prop.
Interrupted probabilistic random walk after 180311 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 180311 steps, saw 32360 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-20 22:28:50] [INFO ] Invariant cache hit.
[2024-05-20 22:28:50] [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-20 22:28:50] [INFO ] Deduced a trap composed of 2 places in 43 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-20 22:28:51] [INFO ] Deduced a trap composed of 47 places in 623 ms of which 6 ms to minimize.
[2024-05-20 22:28:52] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:28:52] [INFO ] Deduced a trap composed of 43 places in 605 ms of which 7 ms to minimize.
[2024-05-20 22:28:53] [INFO ] Deduced a trap composed of 43 places in 613 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
[2024-05-20 22:28:54] [INFO ] Deduced a trap composed of 46 places in 571 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:28:54] [INFO ] Deduced a trap composed of 41 places in 544 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:28:55] [INFO ] Deduced a trap composed of 45 places in 574 ms of which 6 ms to minimize.
[2024-05-20 22:28:55] [INFO ] Deduced a trap composed of 47 places in 510 ms of which 6 ms to minimize.
SMT process timed out in 5144ms, 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 (283 resets) in 451 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 194331 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194331 steps, saw 33913 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-20 22:28:59] [INFO ] Invariant cache hit.
[2024-05-20 22:28:59] [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-20 22:28:59] [INFO ] Deduced a trap composed of 2 places in 44 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-20 22:29:00] [INFO ] Deduced a trap composed of 38 places in 691 ms of which 7 ms to minimize.
[2024-05-20 22:29:00] [INFO ] Deduced a trap composed of 35 places in 59 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 2557 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-20 22:29:01] [INFO ] Deduced a trap composed of 2 places in 43 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-20 22:29:02] [INFO ] Deduced a trap composed of 36 places in 680 ms of which 7 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 72 places in 650 ms of which 7 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 38 places in 589 ms of which 6 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 38 places in 575 ms of which 6 ms to minimize.
[2024-05-20 22:29:05] [INFO ] Deduced a trap composed of 38 places in 521 ms of which 5 ms to minimize.
[2024-05-20 22:29:05] [INFO ] Deduced a trap composed of 38 places in 528 ms of which 6 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 39 places in 564 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 36 places in 523 ms of which 5 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 37 places in 539 ms of which 5 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 39 places in 523 ms of which 6 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 44 places in 548 ms of which 6 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 48 places in 517 ms of which 6 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 47 places in 522 ms of which 5 ms to minimize.
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 41 places in 508 ms of which 5 ms to minimize.
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 5 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 54 places in 512 ms of which 6 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 41 places in 521 ms of which 5 ms to minimize.
[2024-05-20 22:29:12] [INFO ] Deduced a trap composed of 49 places in 510 ms of which 6 ms to minimize.
[2024-05-20 22:29:12] [INFO ] Deduced a trap composed of 42 places in 510 ms of which 7 ms to minimize.
[2024-05-20 22:29:13] [INFO ] Deduced a trap composed of 38 places in 457 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-20 22:29:13] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 4 ms to minimize.
[2024-05-20 22:29:14] [INFO ] Deduced a trap composed of 45 places in 457 ms of which 5 ms to minimize.
[2024-05-20 22:29:14] [INFO ] Deduced a trap composed of 39 places in 453 ms of which 5 ms to minimize.
[2024-05-20 22:29:14] [INFO ] Deduced a trap composed of 37 places in 392 ms of which 4 ms to minimize.
[2024-05-20 22:29:15] [INFO ] Deduced a trap composed of 42 places in 369 ms of which 4 ms to minimize.
[2024-05-20 22:29:15] [INFO ] Deduced a trap composed of 38 places in 361 ms of which 5 ms to minimize.
[2024-05-20 22:29:16] [INFO ] Deduced a trap composed of 38 places in 364 ms of which 4 ms to minimize.
[2024-05-20 22:29:16] [INFO ] Deduced a trap composed of 37 places in 363 ms of which 4 ms to minimize.
[2024-05-20 22:29:16] [INFO ] Deduced a trap composed of 37 places in 377 ms of which 5 ms to minimize.
[2024-05-20 22:29:17] [INFO ] Deduced a trap composed of 36 places in 363 ms of which 4 ms to minimize.
[2024-05-20 22:29:17] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 4 ms to minimize.
[2024-05-20 22:29:18] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 4 ms to minimize.
[2024-05-20 22:29:18] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 4 ms to minimize.
[2024-05-20 22:29:18] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 5 ms to minimize.
[2024-05-20 22:29:19] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 4 ms to minimize.
[2024-05-20 22:29:19] [INFO ] Deduced a trap composed of 37 places in 341 ms of which 4 ms to minimize.
[2024-05-20 22:29:19] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 5 ms to minimize.
[2024-05-20 22:29:20] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 5 ms to minimize.
[2024-05-20 22:29:20] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 4 ms to minimize.
[2024-05-20 22:29:21] [INFO ] Deduced a trap composed of 38 places in 344 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-20 22:29:21] [INFO ] Deduced a trap composed of 37 places in 342 ms of which 4 ms to minimize.
[2024-05-20 22:29:21] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 4 ms to minimize.
[2024-05-20 22:29:22] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 4 ms to minimize.
[2024-05-20 22:29:22] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 4 ms to minimize.
[2024-05-20 22:29:22] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 4 ms to minimize.
[2024-05-20 22:29:23] [INFO ] Deduced a trap composed of 39 places in 370 ms of which 8 ms to minimize.
[2024-05-20 22:29:23] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 4 ms to minimize.
[2024-05-20 22:29:23] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 4 ms to minimize.
[2024-05-20 22:29:24] [INFO ] Deduced a trap composed of 45 places in 341 ms of which 4 ms to minimize.
[2024-05-20 22:29:24] [INFO ] Deduced a trap composed of 41 places in 330 ms of which 4 ms to minimize.
[2024-05-20 22:29:25] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 4 ms to minimize.
[2024-05-20 22:29:25] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 4 ms to minimize.
[2024-05-20 22:29:25] [INFO ] Deduced a trap composed of 39 places in 328 ms of which 4 ms to minimize.
[2024-05-20 22:29:26] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 4 ms to minimize.
[2024-05-20 22:29:26] [INFO ] Deduced a trap composed of 43 places in 339 ms of which 4 ms to minimize.
[2024-05-20 22:29:26] [INFO ] Deduced a trap composed of 43 places in 332 ms of which 4 ms to minimize.
[2024-05-20 22:29:27] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 4 ms to minimize.
[2024-05-20 22:29:27] [INFO ] Deduced a trap composed of 35 places in 314 ms of which 4 ms to minimize.
[2024-05-20 22:29:27] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 4 ms to minimize.
[2024-05-20 22:29:28] [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-20 22:29:28] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 4 ms to minimize.
[2024-05-20 22:29:28] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 3 ms to minimize.
[2024-05-20 22:29:28] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2024-05-20 22:29:29] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 3 ms to minimize.
[2024-05-20 22:29:29] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 3 ms to minimize.
[2024-05-20 22:29:29] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 3 ms to minimize.
[2024-05-20 22:29:29] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2024-05-20 22:29:30] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-05-20 22:29:30] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 3 ms to minimize.
[2024-05-20 22:29:30] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 3 ms to minimize.
[2024-05-20 22:29:30] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 2 ms to minimize.
[2024-05-20 22:29:31] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-05-20 22:29:31] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-20 22:29:31] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 3 ms to minimize.
[2024-05-20 22:29:31] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 2 ms to minimize.
[2024-05-20 22:29:31] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-20 22:29:32] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2024-05-20 22:29:32] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2024-05-20 22:29:32] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2024-05-20 22:29:32] [INFO ] Deduced a trap composed of 38 places in 167 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-20 22:29:32] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-05-20 22:29:33] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2024-05-20 22:29:33] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
[2024-05-20 22:29:33] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2024-05-20 22:29:33] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-20 22:29:33] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-20 22:29:33] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-20 22:29:34] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 13 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 44 places in 121 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-20 22:29:35] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-20 22:29:36] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-20 22:29:36] [INFO ] Deduced a trap composed of 43 places in 120 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
Detected timeout of ITS tools.
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:29:37] [INFO ] Flatten gal took : 67 ms
[2024-05-20 22:29:37] [INFO ] Applying decomposition
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:29:37] [INFO ] Flatten gal took : 67 ms
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 36340 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 38949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 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.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14288332503018776357.txt' '-o' '/tmp/graph14288332503018776357.bin' '-w' '/tmp/graph14288332503018776357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14288332503018776357.bin' '-l' '-1' '-v' '-w' '/tmp/graph14288332503018776357.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:29:38] [INFO ] Decomposing Gal with order
[2024-05-20 22:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
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 67 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:29:38] [INFO ] Invariant cache hit.
[2024-05-20 22:29:38] [INFO ] Removed a total of 2825 redundant transitions.
[2024-05-20 22:29:38] [INFO ] Flatten gal took : 190 ms
[2024-05-20 22:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 3452 labels/synchronizations in 105 ms.
[2024-05-20 22:29:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality924291798413724197.gal : 39 ms
[2024-05-20 22:29:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5248672612553163272.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality924291798413724197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5248672612553163272.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality5248672612553163272.prop.
[2024-05-20 22:29:39] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-20 22:29:39] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 75
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :75 after 75
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :75 after 75
[2024-05-20 22:29:39] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :75 after 4016
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4016 after 376130
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :376130 after 2.1083e+07
[2024-05-20 22:30:00] [INFO ] Implicit Places using invariants and state equation in 21286 ms returned []
Implicit Place search using SMT with State Equation took 22147 ms to find 0 implicit places.
[2024-05-20 22:30:00] [INFO ] Redundant transitions in 106 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:30:00] [INFO ] Invariant cache hit.
[2024-05-20 22:30:00] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.1083e+07 after 2.72079e+07
Detected timeout of ITS tools.
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 32444ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54804 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 182507 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-20 22:30:32] [INFO ] Computed 32 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 88 ms. (112 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-20 22:30:33] [INFO ] Invariant cache hit.
[2024-05-20 22:30:33] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:30:33] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-20 22:30:33] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2024-05-20 22:30:34] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:30:34] [INFO ] [Real]Added 3582 Read/Feed constraints in 288 ms returned sat
[2024-05-20 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:30:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:30:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:30:35] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-20 22:30:35] [INFO ] [Nat]Added 3582 Read/Feed constraints in 304 ms returned sat
[2024-05-20 22:30:35] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:30:36] [INFO ] Added : 8 causal constraints over 2 iterations in 661 ms. Result :sat
Minimization took 953 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 264 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 264 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:30:37] [INFO ] Computed 32 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7143 resets) in 8710 ms. (114 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 1033 ms. (967 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:30:47] [INFO ] Invariant cache hit.
[2024-05-20 22:30:47] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:30:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:30:47] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2024-05-20 22:30:48] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:30:48] [INFO ] [Real]Added 3603 Read/Feed constraints in 277 ms returned sat
[2024-05-20 22:30:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:30:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:30:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:30:49] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2024-05-20 22:30:49] [INFO ] [Nat]Added 3603 Read/Feed constraints in 347 ms returned sat
[2024-05-20 22:30:49] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 197 ms.
[2024-05-20 22:30:50] [INFO ] Added : 10 causal constraints over 2 iterations in 708 ms. Result :sat
Minimization took 4528 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 71 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:30:55] [INFO ] Invariant cache hit.
[2024-05-20 22:30:55] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-20 22:30:55] [INFO ] Invariant cache hit.
[2024-05-20 22:30:56] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:31:15] [INFO ] Implicit Places using invariants and state equation in 19893 ms returned []
Implicit Place search using SMT with State Equation took 20811 ms to find 0 implicit places.
[2024-05-20 22:31:15] [INFO ] Redundant transitions in 105 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:31:15] [INFO ] Invariant cache hit.
[2024-05-20 22:31:16] [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 32423ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53459 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:31:48] [INFO ] Flatten gal took : 66 ms
[2024-05-20 22:31:48] [INFO ] Flatten gal took : 65 ms
[2024-05-20 22:31:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6582194354710097684.gal : 15 ms
[2024-05-20 22:31:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3537874386816325707.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6582194354710097684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3537874386816325707.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (283 resets) in 525 ms. (76 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 59 ms. (666 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3537874386816325707.prop.
Interrupted probabilistic random walk after 184690 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184690 steps, saw 32829 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-20 22:31:51] [INFO ] Invariant cache hit.
[2024-05-20 22:31:51] [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-20 22:31:51] [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-20 22:31:52] [INFO ] Deduced a trap composed of 52 places in 647 ms of which 6 ms to minimize.
[2024-05-20 22:31:53] [INFO ] Deduced a trap composed of 37 places in 605 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:31:53] [INFO ] Deduced a trap composed of 40 places in 603 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
[2024-05-20 22:31:54] [INFO ] Deduced a trap composed of 42 places in 558 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:31:55] [INFO ] Deduced a trap composed of 42 places in 512 ms of which 5 ms to minimize.
[2024-05-20 22:31:55] [INFO ] Deduced a trap composed of 39 places in 513 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:31:56] [INFO ] Deduced a trap composed of 37 places in 497 ms of which 5 ms to minimize.
[2024-05-20 22:31:56] [INFO ] Deduced a trap composed of 47 places in 517 ms of which 6 ms to minimize.
[2024-05-20 22:31:57] [INFO ] Deduced a trap composed of 37 places in 495 ms of which 5 ms to minimize.
SMT process timed out in 5471ms, 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 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 67 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 574 ms. (69 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
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 198226 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198226 steps, saw 34450 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:32:00] [INFO ] Invariant cache hit.
[2024-05-20 22:32:00] [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-20 22:32:00] [INFO ] Deduced a trap composed of 2 places in 41 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-20 22:32:01] [INFO ] Deduced a trap composed of 38 places in 615 ms of which 6 ms to minimize.
[2024-05-20 22:32:02] [INFO ] Deduced a trap composed of 39 places in 616 ms of which 6 ms to minimize.
[2024-05-20 22:32:02] [INFO ] Deduced a trap composed of 38 places in 608 ms of which 6 ms to minimize.
[2024-05-20 22:32:03] [INFO ] Deduced a trap composed of 36 places in 585 ms of which 6 ms to minimize.
[2024-05-20 22:32:03] [INFO ] Deduced a trap composed of 47 places in 546 ms of which 6 ms to minimize.
[2024-05-20 22:32:04] [INFO ] Deduced a trap composed of 44 places in 555 ms of which 6 ms to minimize.
[2024-05-20 22:32:04] [INFO ] Deduced a trap composed of 40 places in 554 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2024-05-20 22:32:05] [INFO ] Deduced a trap composed of 39 places in 566 ms of which 6 ms to minimize.
[2024-05-20 22:32:06] [INFO ] Deduced a trap composed of 41 places in 546 ms of which 6 ms to minimize.
[2024-05-20 22:32:06] [INFO ] Deduced a trap composed of 43 places in 548 ms of which 6 ms to minimize.
[2024-05-20 22:32:07] [INFO ] Deduced a trap composed of 39 places in 510 ms of which 5 ms to minimize.
[2024-05-20 22:32:07] [INFO ] Deduced a trap composed of 43 places in 487 ms of which 6 ms to minimize.
[2024-05-20 22:32:08] [INFO ] Deduced a trap composed of 43 places in 474 ms of which 5 ms to minimize.
[2024-05-20 22:32:08] [INFO ] Deduced a trap composed of 41 places in 504 ms of which 6 ms to minimize.
[2024-05-20 22:32:09] [INFO ] Deduced a trap composed of 42 places in 523 ms of which 6 ms to minimize.
[2024-05-20 22:32:09] [INFO ] Deduced a trap composed of 40 places in 487 ms of which 5 ms to minimize.
[2024-05-20 22:32:10] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 5 ms to minimize.
[2024-05-20 22:32:10] [INFO ] Deduced a trap composed of 37 places in 424 ms of which 5 ms to minimize.
[2024-05-20 22:32:11] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 5 ms to minimize.
[2024-05-20 22:32:11] [INFO ] Deduced a trap composed of 35 places in 397 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-20 22:32:11] [INFO ] Deduced a trap composed of 46 places in 393 ms of which 4 ms to minimize.
[2024-05-20 22:32:12] [INFO ] Deduced a trap composed of 35 places in 347 ms of which 4 ms to minimize.
[2024-05-20 22:32:12] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 4 ms to minimize.
[2024-05-20 22:32:12] [INFO ] Deduced a trap composed of 41 places in 314 ms of which 4 ms to minimize.
[2024-05-20 22:32:13] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 4 ms to minimize.
[2024-05-20 22:32:13] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 4 ms to minimize.
[2024-05-20 22:32:13] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 4 ms to minimize.
[2024-05-20 22:32:14] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 4 ms to minimize.
[2024-05-20 22:32:14] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 4 ms to minimize.
[2024-05-20 22:32:14] [INFO ] Deduced a trap composed of 43 places in 297 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 15642 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-20 22:32:16] [INFO ] Deduced a trap composed of 2 places in 50 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-20 22:32:16] [INFO ] Deduced a trap composed of 48 places in 602 ms of which 6 ms to minimize.
[2024-05-20 22:32:17] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:32:17] [INFO ] Deduced a trap composed of 41 places in 556 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 3411 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 19103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 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 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:32:19] [INFO ] Invariant cache hit.
[2024-05-20 22:32:20] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-20 22:32:20] [INFO ] Invariant cache hit.
[2024-05-20 22:32:21] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:32:38] [INFO ] Flatten gal took : 69 ms
[2024-05-20 22:32:38] [INFO ] Applying decomposition
[2024-05-20 22:32:38] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4790481554056046061.txt' '-o' '/tmp/graph4790481554056046061.bin' '-w' '/tmp/graph4790481554056046061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4790481554056046061.bin' '-l' '-1' '-v' '-w' '/tmp/graph4790481554056046061.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:32:38] [INFO ] Decomposing Gal with order
[2024-05-20 22:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:32:39] [INFO ] Removed a total of 2824 redundant transitions.
[2024-05-20 22:32:39] [INFO ] Flatten gal took : 203 ms
[2024-05-20 22:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 3452 labels/synchronizations in 92 ms.
[2024-05-20 22:32:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12163932205683723820.gal : 25 ms
[2024-05-20 22:32:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality626829697327244142.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12163932205683723820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality626829697327244142.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality626829697327244142.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 122
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122 after 122
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :122 after 8848
[2024-05-20 22:32:40] [INFO ] Implicit Places using invariants and state equation in 19876 ms returned []
Implicit Place search using SMT with State Equation took 20797 ms to find 0 implicit places.
[2024-05-20 22:32:40] [INFO ] Redundant transitions in 106 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:32:40] [INFO ] Invariant cache hit.
[2024-05-20 22:32:40] [INFO ] State equation strengthened by 3603 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8848 after 774993
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 32582ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53611 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 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-20 22:33:13] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 22:33:13] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:33:13] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:33:13] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:33:13] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:33:13] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:33:13] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:33:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5500757502864046201.gal : 1 ms
[2024-05-20 22:33:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2856523546992124100.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5500757502864046201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2856523546992124100.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2856523546992124100.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.004112,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.00443,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 55 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 160431 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-20 22:33:13] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 resets) in 78 ms. (126 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-20 22:33:13] [INFO ] Invariant cache hit.
[2024-05-20 22:33:13] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:33:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:33:14] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-20 22:33:14] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:33:14] [INFO ] [Real]Added 3582 Read/Feed constraints in 247 ms returned sat
[2024-05-20 22:33:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:33:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:33:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:33:15] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2024-05-20 22:33:15] [INFO ] [Nat]Added 3582 Read/Feed constraints in 290 ms returned sat
[2024-05-20 22:33:15] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 167 ms.
[2024-05-20 22:33:16] [INFO ] Added : 13 causal constraints over 3 iterations in 746 ms. Result :sat
Minimization took 938 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 244 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 245 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:33:17] [INFO ] Computed 32 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7149 resets) in 7891 ms. (126 steps per ms)
BEST_FIRST walk for 1000001 steps (203 resets) in 983 ms. (1016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:33:26] [INFO ] Invariant cache hit.
[2024-05-20 22:33:26] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:33:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:33:27] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-20 22:33:27] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:33:27] [INFO ] [Real]Added 3603 Read/Feed constraints in 253 ms returned sat
[2024-05-20 22:33:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:33:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:33:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:33:28] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2024-05-20 22:33:28] [INFO ] [Nat]Added 3603 Read/Feed constraints in 247 ms returned sat
[2024-05-20 22:33:28] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:33:29] [INFO ] Added : 7 causal constraints over 2 iterations in 636 ms. Result :sat
Minimization took 4570 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 75 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-20 22:33:34] [INFO ] Invariant cache hit.
[2024-05-20 22:33:34] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-20 22:33:34] [INFO ] Invariant cache hit.
[2024-05-20 22:33:35] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:33:57] [INFO ] Implicit Places using invariants and state equation in 22268 ms returned []
Implicit Place search using SMT with State Equation took 23131 ms to find 0 implicit places.
[2024-05-20 22:33:57] [INFO ] Redundant transitions in 108 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:33:57] [INFO ] Invariant cache hit.
[2024-05-20 22:33:57] [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 32248ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55605 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:34:29] [INFO ] Flatten gal took : 83 ms
[2024-05-20 22:34:29] [INFO ] Flatten gal took : 67 ms
[2024-05-20 22:34:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7083288988953749406.gal : 12 ms
[2024-05-20 22:34:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15848854148160638543.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7083288988953749406.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15848854148160638543.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (286 resets) in 610 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 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
Loading property file /tmp/ReachabilityCardinality15848854148160638543.prop.
Interrupted probabilistic random walk after 188138 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188138 steps, saw 33168 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-20 22:34:32] [INFO ] Invariant cache hit.
[2024-05-20 22:34:32] [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-20 22:34:33] [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/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-20 22:34:33] [INFO ] Deduced a trap composed of 52 places in 628 ms of which 6 ms to minimize.
[2024-05-20 22:34:34] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:34:35] [INFO ] Deduced a trap composed of 40 places in 587 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
[2024-05-20 22:34:35] [INFO ] Deduced a trap composed of 36 places in 551 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:34:36] [INFO ] Deduced a trap composed of 35 places in 558 ms of which 6 ms to minimize.
[2024-05-20 22:34:36] [INFO ] Deduced a trap composed of 37 places in 537 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:34:37] [INFO ] Deduced a trap composed of 37 places in 519 ms of which 5 ms to minimize.
[2024-05-20 22:34:37] [INFO ] Deduced a trap composed of 42 places in 499 ms of which 6 ms to minimize.
[2024-05-20 22:34:38] [INFO ] Deduced a trap composed of 38 places in 498 ms of which 6 ms to minimize.
SMT process timed out in 5420ms, 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 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.
RANDOM walk for 40000 steps (284 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 196690 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 196690 steps, saw 34240 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-20 22:34:41] [INFO ] Invariant cache hit.
[2024-05-20 22:34:41] [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-20 22:34:41] [INFO ] Deduced a trap composed of 2 places in 37 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-20 22:34:42] [INFO ] Deduced a trap composed of 38 places in 619 ms of which 6 ms to minimize.
[2024-05-20 22:34:43] [INFO ] Deduced a trap composed of 39 places in 604 ms of which 6 ms to minimize.
[2024-05-20 22:34:43] [INFO ] Deduced a trap composed of 38 places in 624 ms of which 6 ms to minimize.
[2024-05-20 22:34:44] [INFO ] Deduced a trap composed of 36 places in 572 ms of which 6 ms to minimize.
[2024-05-20 22:34:44] [INFO ] Deduced a trap composed of 47 places in 573 ms of which 6 ms to minimize.
[2024-05-20 22:34:45] [INFO ] Deduced a trap composed of 44 places in 550 ms of which 6 ms to minimize.
[2024-05-20 22:34:46] [INFO ] Deduced a trap composed of 44 places in 559 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3059
[2024-05-20 22:34:46] [INFO ] Deduced a trap composed of 44 places in 544 ms of which 6 ms to minimize.
[2024-05-20 22:34:47] [INFO ] Deduced a trap composed of 38 places in 563 ms of which 6 ms to minimize.
[2024-05-20 22:34:47] [INFO ] Deduced a trap composed of 40 places in 551 ms of which 6 ms to minimize.
[2024-05-20 22:34:48] [INFO ] Deduced a trap composed of 39 places in 524 ms of which 6 ms to minimize.
[2024-05-20 22:34:48] [INFO ] Deduced a trap composed of 47 places in 510 ms of which 6 ms to minimize.
[2024-05-20 22:34:49] [INFO ] Deduced a trap composed of 35 places in 489 ms of which 6 ms to minimize.
[2024-05-20 22:34:49] [INFO ] Deduced a trap composed of 48 places in 472 ms of which 5 ms to minimize.
[2024-05-20 22:34:50] [INFO ] Deduced a trap composed of 44 places in 476 ms of which 5 ms to minimize.
[2024-05-20 22:34:50] [INFO ] Deduced a trap composed of 43 places in 468 ms of which 5 ms to minimize.
[2024-05-20 22:34:51] [INFO ] Deduced a trap composed of 48 places in 464 ms of which 5 ms to minimize.
[2024-05-20 22:34:51] [INFO ] Deduced a trap composed of 47 places in 443 ms of which 5 ms to minimize.
[2024-05-20 22:34:52] [INFO ] Deduced a trap composed of 46 places in 431 ms of which 5 ms to minimize.
[2024-05-20 22:34:52] [INFO ] Deduced a trap composed of 47 places in 441 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-20 22:34:53] [INFO ] Deduced a trap composed of 46 places in 444 ms of which 5 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 46 places in 451 ms of which 5 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 45 places in 430 ms of which 5 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 48 places in 420 ms of which 5 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 5 ms to minimize.
[2024-05-20 22:34:55] [INFO ] Deduced a trap composed of 46 places in 414 ms of which 5 ms to minimize.
[2024-05-20 22:34:55] [INFO ] Deduced a trap composed of 45 places in 421 ms of which 5 ms to minimize.
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 48 places in 413 ms of which 5 ms to minimize.
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 45 places in 396 ms of which 5 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 46 places in 391 ms of which 5 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 50 places in 393 ms of which 4 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 43 places in 399 ms of which 4 ms to minimize.
[2024-05-20 22:34:58] [INFO ] Deduced a trap composed of 44 places in 385 ms of which 5 ms to minimize.
[2024-05-20 22:34:58] [INFO ] Deduced a trap composed of 47 places in 389 ms of which 5 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 18253 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-20 22:35:00] [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, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:35:00] [INFO ] Deduced a trap composed of 64 places in 578 ms of which 6 ms to minimize.
[2024-05-20 22:35:00] [INFO ] Deduced a trap composed of 35 places in 57 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 3386 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 21690ms 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 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:35:03] [INFO ] Invariant cache hit.
[2024-05-20 22:35:04] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-20 22:35:04] [INFO ] Invariant cache hit.
[2024-05-20 22:35:05] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:35:19] [INFO ] Flatten gal took : 63 ms
[2024-05-20 22:35:19] [INFO ] Applying decomposition
[2024-05-20 22:35:20] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3346397565173928035.txt' '-o' '/tmp/graph3346397565173928035.bin' '-w' '/tmp/graph3346397565173928035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3346397565173928035.bin' '-l' '-1' '-v' '-w' '/tmp/graph3346397565173928035.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:35:20] [INFO ] Decomposing Gal with order
[2024-05-20 22:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:35:20] [INFO ] Removed a total of 2820 redundant transitions.
[2024-05-20 22:35:20] [INFO ] Flatten gal took : 171 ms
[2024-05-20 22:35:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 3284 labels/synchronizations in 141 ms.
[2024-05-20 22:35:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7405063478180387448.gal : 18 ms
[2024-05-20 22:35:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14831721855989098985.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7405063478180387448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14831721855989098985.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14831721855989098985.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 812
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :812 after 812
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :812 after 838
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :838 after 853
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :853 after 998
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :998 after 139233
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :139233 after 4.7786e+06
[2024-05-20 22:35:28] [INFO ] Implicit Places using invariants and state equation in 23798 ms returned []
Implicit Place search using SMT with State Equation took 24709 ms to find 0 implicit places.
[2024-05-20 22:35:28] [INFO ] Redundant transitions in 109 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:35:28] [INFO ] Invariant cache hit.
[2024-05-20 22:35:28] [INFO ] State equation strengthened by 3603 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.7786e+06 after 8.52118e+06
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 32237ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57167 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 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-20 22:36:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:36:00] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:36:00] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:36:00] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:36:00] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:36:00] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:36:00] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:36:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14838939205630263570.gal : 0 ms
[2024-05-20 22:36:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7661302491595303644.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14838939205630263570.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7661302491595303644.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7661302491595303644.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002244,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002654,3892,2,5,6,33,7,0,24,18,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 53 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 167298 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-20 22:36:00] [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 (70 resets) in 76 ms. (129 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-20 22:36:00] [INFO ] Invariant cache hit.
[2024-05-20 22:36:00] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:36:00] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:36:01] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-05-20 22:36:01] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:36:01] [INFO ] [Real]Added 3582 Read/Feed constraints in 234 ms returned sat
[2024-05-20 22:36:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:36:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:36:02] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:36:02] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-05-20 22:36:02] [INFO ] [Nat]Added 3582 Read/Feed constraints in 266 ms returned sat
[2024-05-20 22:36:03] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-20 22:36:03] [INFO ] Added : 7 causal constraints over 2 iterations in 628 ms. Result :sat
Minimization took 916 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 240 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 240 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-20 22:36:04] [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 (7156 resets) in 7596 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 919 ms. (1086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:36:13] [INFO ] Invariant cache hit.
[2024-05-20 22:36:13] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:36:13] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:36:14] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-20 22:36:14] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:36:14] [INFO ] [Real]Added 3604 Read/Feed constraints in 255 ms returned sat
[2024-05-20 22:36:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:36:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:36:14] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:36:15] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2024-05-20 22:36:15] [INFO ] [Nat]Added 3604 Read/Feed constraints in 290 ms returned sat
[2024-05-20 22:36:15] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:36:16] [INFO ] Added : 7 causal constraints over 2 iterations in 632 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 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 65 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:36:20] [INFO ] Invariant cache hit.
[2024-05-20 22:36:21] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-20 22:36:21] [INFO ] Invariant cache hit.
[2024-05-20 22:36:22] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:36:42] [INFO ] Implicit Places using invariants and state equation in 20503 ms returned []
Implicit Place search using SMT with State Equation took 21382 ms to find 0 implicit places.
[2024-05-20 22:36:42] [INFO ] Redundant transitions in 111 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:36:42] [INFO ] Invariant cache hit.
[2024-05-20 22:36:42] [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 32229ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53837 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:37:14] [INFO ] Flatten gal took : 99 ms
RANDOM walk for 40000 steps (284 resets) in 503 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
[2024-05-20 22:37:14] [INFO ] Flatten gal took : 67 ms
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2024-05-20 22:37:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12906982221360370208.gal : 12 ms
[2024-05-20 22:37:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11050573791574243358.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12906982221360370208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11050573791574243358.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11050573791574243358.prop.
Interrupted probabilistic random walk after 184062 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184062 steps, saw 32760 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-20 22:37:17] [INFO ] Invariant cache hit.
[2024-05-20 22:37:17] [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-20 22:37:18] [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-20 22:37:18] [INFO ] Deduced a trap composed of 35 places in 604 ms of which 6 ms to minimize.
[2024-05-20 22:37:19] [INFO ] Deduced a trap composed of 42 places in 572 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
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
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 2593 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
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
[2024-05-20 22:37:20] [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: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
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
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:37:21] [INFO ] Deduced a trap composed of 37 places in 619 ms of which 6 ms to minimize.
[2024-05-20 22:37:21] [INFO ] Deduced a trap composed of 35 places in 603 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:37:22] [INFO ] Deduced a trap composed of 37 places in 565 ms of which 6 ms to minimize.
[2024-05-20 22:37:23] [INFO ] Deduced a trap composed of 36 places in 553 ms of which 6 ms to minimize.
[2024-05-20 22:37:23] [INFO ] Deduced a trap composed of 36 places in 540 ms of which 6 ms to minimize.
[2024-05-20 22:37:24] [INFO ] Deduced a trap composed of 49 places in 518 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
[2024-05-20 22:37:24] [INFO ] Deduced a trap composed of 36 places in 500 ms of which 5 ms to minimize.
[2024-05-20 22:37:25] [INFO ] Deduced a trap composed of 46 places in 479 ms of which 5 ms to minimize.
[2024-05-20 22:37:25] [INFO ] Deduced a trap composed of 37 places in 456 ms of which 5 ms to minimize.
SMT process timed out in 7842ms, 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 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 66 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (284 resets) in 479 ms. (83 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 201037 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 201037 steps, saw 34821 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:37:28] [INFO ] Invariant cache hit.
[2024-05-20 22:37:28] [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-20 22:37:29] [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-20 22:37:29] [INFO ] Deduced a trap composed of 37 places in 625 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 2195 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-20 22:37:31] [INFO ] Deduced a trap composed of 2 places in 36 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, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2024-05-20 22:37:32] [INFO ] Deduced a trap composed of 37 places in 627 ms of which 6 ms to minimize.
[2024-05-20 22:37:32] [INFO ] Deduced a trap composed of 35 places in 583 ms of which 6 ms to minimize.
[2024-05-20 22:37:33] [INFO ] Deduced a trap composed of 37 places in 557 ms of which 6 ms to minimize.
[2024-05-20 22:37:33] [INFO ] Deduced a trap composed of 36 places in 558 ms of which 6 ms to minimize.
[2024-05-20 22:37:34] [INFO ] Deduced a trap composed of 36 places in 521 ms of which 6 ms to minimize.
[2024-05-20 22:37:34] [INFO ] Deduced a trap composed of 49 places in 531 ms of which 6 ms to minimize.
[2024-05-20 22:37:35] [INFO ] Deduced a trap composed of 44 places in 482 ms of which 5 ms to minimize.
[2024-05-20 22:37:35] [INFO ] Deduced a trap composed of 42 places in 504 ms of which 5 ms to minimize.
[2024-05-20 22:37:36] [INFO ] Deduced a trap composed of 52 places in 479 ms of which 5 ms to minimize.
[2024-05-20 22:37:36] [INFO ] Deduced a trap composed of 43 places in 471 ms of which 5 ms to minimize.
[2024-05-20 22:37:37] [INFO ] Deduced a trap composed of 44 places in 451 ms of which 5 ms to minimize.
[2024-05-20 22:37:37] [INFO ] Deduced a trap composed of 37 places in 456 ms of which 5 ms to minimize.
[2024-05-20 22:37:38] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 5 ms to minimize.
[2024-05-20 22:37:38] [INFO ] Deduced a trap composed of 39 places in 420 ms of which 4 ms to minimize.
[2024-05-20 22:37:39] [INFO ] Deduced a trap composed of 35 places in 413 ms of which 5 ms to minimize.
[2024-05-20 22:37:39] [INFO ] Deduced a trap composed of 36 places in 402 ms of which 5 ms to minimize.
[2024-05-20 22:37:39] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 5 ms to minimize.
[2024-05-20 22:37:40] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 5 ms to minimize.
[2024-05-20 22:37:40] [INFO ] Deduced a trap composed of 37 places in 339 ms of which 5 ms to minimize.
[2024-05-20 22:37:40] [INFO ] Deduced a trap composed of 40 places in 325 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-20 22:37:41] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 4 ms to minimize.
[2024-05-20 22:37:41] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 4 ms to minimize.
[2024-05-20 22:37:41] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 4 ms to minimize.
[2024-05-20 22:37:42] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 4 ms to minimize.
[2024-05-20 22:37:42] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 4 ms to minimize.
[2024-05-20 22:37:42] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 4 ms to minimize.
[2024-05-20 22:37:43] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 4 ms to minimize.
[2024-05-20 22:37:43] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 4 ms to minimize.
[2024-05-20 22:37:43] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 3 ms to minimize.
[2024-05-20 22:37:44] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 3 ms to minimize.
[2024-05-20 22:37:44] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 6 ms to minimize.
[2024-05-20 22:37:44] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 4 ms to minimize.
[2024-05-20 22:37:44] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 4 ms to minimize.
[2024-05-20 22:37:45] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 4 ms to minimize.
[2024-05-20 22:37:45] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 3 ms to minimize.
[2024-05-20 22:37:45] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 4 ms to minimize.
[2024-05-20 22:37:46] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 4 ms to minimize.
[2024-05-20 22:37:46] [INFO ] Deduced a trap composed of 49 places in 280 ms of which 3 ms to minimize.
[2024-05-20 22:37:46] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 4 ms to minimize.
[2024-05-20 22:37:46] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 3 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-20 22:37:47] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 3 ms to minimize.
[2024-05-20 22:37:47] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 3 ms to minimize.
[2024-05-20 22:37:47] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 4 ms to minimize.
[2024-05-20 22:37:48] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 3 ms to minimize.
[2024-05-20 22:37:48] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 4 ms to minimize.
[2024-05-20 22:37:48] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 3 ms to minimize.
[2024-05-20 22:37:48] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 3 ms to minimize.
[2024-05-20 22:37:49] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 3 ms to minimize.
[2024-05-20 22:37:49] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 5 ms to minimize.
[2024-05-20 22:37:49] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-05-20 22:37:49] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 3 ms to minimize.
[2024-05-20 22:37:50] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 3 ms to minimize.
[2024-05-20 22:37:50] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 3 ms to minimize.
[2024-05-20 22:37:50] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 3 ms to minimize.
[2024-05-20 22:37:50] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2024-05-20 22:37:51] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-05-20 22:37:51] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-05-20 22:37:51] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2024-05-20 22:37:51] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-05-20 22:37:51] [INFO ] Deduced a trap composed of 44 places in 197 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-20 22:37:52] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-05-20 22:37:52] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 2 ms to minimize.
[2024-05-20 22:37:52] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2024-05-20 22:37:52] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2024-05-20 22:37:52] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2024-05-20 22:37:53] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2024-05-20 22:37:53] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-05-20 22:37:53] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 2 ms to minimize.
[2024-05-20 22:37:53] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-05-20 22:37:53] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-20 22:37:54] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-20 22:37:55] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-05-20 22:37:55] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 4 ms to minimize.
[2024-05-20 22:37:55] [INFO ] Deduced a trap composed of 40 places in 224 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-20 22:37:55] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 4 ms to minimize.
[2024-05-20 22:37:56] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 3 ms to minimize.
[2024-05-20 22:37:56] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 3 ms to minimize.
[2024-05-20 22:37:56] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 3 ms to minimize.
[2024-05-20 22:37:57] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 3 ms to minimize.
[2024-05-20 22:37:57] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 3 ms to minimize.
[2024-05-20 22:37:57] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 4 ms to minimize.
[2024-05-20 22:37:57] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 4 ms to minimize.
[2024-05-20 22:37:58] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 3 ms to minimize.
[2024-05-20 22:37:58] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 13 ms to minimize.
[2024-05-20 22:37:58] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 3 ms to minimize.
[2024-05-20 22:37:58] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-20 22:37:58] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 3 ms to minimize.
[2024-05-20 22:37:59] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-05-20 22:37:59] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 2 ms to minimize.
[2024-05-20 22:37:59] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-05-20 22:37:59] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-05-20 22:38:00] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 3 ms to minimize.
[2024-05-20 22:38:00] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-05-20 22:38:00] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 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-20 22:38:00] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-05-20 22:38:00] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-20 22:38:01] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2024-05-20 22:38:01] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-05-20 22:38:01] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-05-20 22:38:01] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 3 ms to minimize.
[2024-05-20 22:38:01] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
[2024-05-20 22:38:02] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-05-20 22:38:02] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 4 ms to minimize.
[2024-05-20 22:38:02] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 3 ms to minimize.
[2024-05-20 22:38:02] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 3 ms to minimize.
[2024-05-20 22:38:03] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 3 ms to minimize.
[2024-05-20 22:38:03] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 3 ms to minimize.
[2024-05-20 22:38:03] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 3 ms to minimize.
[2024-05-20 22:38:03] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-05-20 22:38:04] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
[2024-05-20 22:38:04] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 3 ms to minimize.
[2024-05-20 22:38:04] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 3 ms to minimize.
[2024-05-20 22:38:04] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 22:38:04] [INFO ] Flatten gal took : 67 ms
[2024-05-20 22:38:04] [INFO ] Applying decomposition
[2024-05-20 22:38:05] [INFO ] Flatten gal took : 64 ms
[2024-05-20 22:38:05] [INFO ] Deduced a trap composed of 36 places in 204 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
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11466686304375839448.txt' '-o' '/tmp/graph11466686304375839448.bin' '-w' '/tmp/graph11466686304375839448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11466686304375839448.bin' '-l' '-1' '-v' '-w' '/tmp/graph11466686304375839448.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:38:05] [INFO ] Decomposing Gal with order
[2024-05-20 22:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:38:05] [INFO ] Removed a total of 2828 redundant transitions.
[2024-05-20 22:38:05] [INFO ] Flatten gal took : 162 ms
[2024-05-20 22:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 3510 labels/synchronizations in 95 ms.
[2024-05-20 22:38:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8582185952858976468.gal : 22 ms
[2024-05-20 22:38:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6869747569281072482.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8582185952858976468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6869747569281072482.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-20 22:38:05] [INFO ] Deduced a trap composed of 42 places in 439 ms of which 3 ms to minimize.
[2024-05-20 22:38:05] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality6869747569281072482.prop.
[2024-05-20 22:38:06] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1278
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1278 after 1278
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1278 after 1278
[2024-05-20 22:38:06] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1278 after 1337
[2024-05-20 22:38:06] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
[2024-05-20 22:38:06] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 3 ms to minimize.
[2024-05-20 22:38:07] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1337 after 4867
[2024-05-20 22:38:07] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:38:07] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-05-20 22:38:07] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-20 22:38:07] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-20 22:38:07] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-20 22:38:08] [INFO ] Deduced a trap composed of 41 places in 176 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
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4867 after 348577
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 40609 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 42854ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 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 66 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-20 22:38:11] [INFO ] Invariant cache hit.
[2024-05-20 22:38:12] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-20 22:38:12] [INFO ] Invariant cache hit.
[2024-05-20 22:38:13] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :348577 after 1.78798e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.78798e+07 after 2.30031e+07
[2024-05-20 22:38:34] [INFO ] Implicit Places using invariants and state equation in 21597 ms returned []
Implicit Place search using SMT with State Equation took 22508 ms to find 0 implicit places.
[2024-05-20 22:38:34] [INFO ] Redundant transitions in 111 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:38:34] [INFO ] Invariant cache hit.
[2024-05-20 22:38:34] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
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 32284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54981 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 186206 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-20 22:39:06] [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 77 ms. (128 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-20 22:39:07] [INFO ] Invariant cache hit.
[2024-05-20 22:39:07] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:39:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 22:39:07] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2024-05-20 22:39:07] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:39:08] [INFO ] [Real]Added 3582 Read/Feed constraints in 264 ms returned sat
[2024-05-20 22:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:39:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:39:08] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:39:08] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-20 22:39:09] [INFO ] [Nat]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-20 22:39:09] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-20 22:39:09] [INFO ] Added : 4 causal constraints over 1 iterations in 529 ms. Result :sat
Minimization took 920 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 241 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 241 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:39:10] [INFO ] Computed 32 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7149 resets) in 7609 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (209 resets) in 935 ms. (1068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:39:19] [INFO ] Invariant cache hit.
[2024-05-20 22:39:19] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 22:39:19] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:39:20] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2024-05-20 22:39:20] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:39:20] [INFO ] [Real]Added 3603 Read/Feed constraints in 263 ms returned sat
[2024-05-20 22:39:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:39:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:39:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:39:21] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2024-05-20 22:39:21] [INFO ] [Nat]Added 3603 Read/Feed constraints in 255 ms returned sat
[2024-05-20 22:39:21] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-20 22:39:22] [INFO ] Added : 4 causal constraints over 1 iterations in 520 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:39:26] [INFO ] Invariant cache hit.
[2024-05-20 22:39:27] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-20 22:39:27] [INFO ] Invariant cache hit.
[2024-05-20 22:39:28] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:39:44] [INFO ] Implicit Places using invariants and state equation in 16565 ms returned []
Implicit Place search using SMT with State Equation took 17449 ms to find 0 implicit places.
[2024-05-20 22:39:44] [INFO ] Redundant transitions in 105 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:39:44] [INFO ] Invariant cache hit.
[2024-05-20 22:39:44] [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 32236ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49899 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:40:16] [INFO ] Flatten gal took : 83 ms
RANDOM walk for 40000 steps (284 resets) in 636 ms. (62 steps per ms) remains 2/2 properties
[2024-05-20 22:40:16] [INFO ] Flatten gal took : 101 ms
[2024-05-20 22:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2864944040408864094.gal : 12 ms
[2024-05-20 22:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16218771385091127757.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2864944040408864094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16218771385091127757.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16218771385091127757.prop.
Interrupted probabilistic random walk after 189445 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189445 steps, saw 33288 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-20 22:40:19] [INFO ] Invariant cache hit.
[2024-05-20 22:40:20] [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-20 22:40:20] [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-20 22:40:20] [INFO ] Deduced a trap composed of 51 places in 644 ms of which 6 ms to minimize.
[2024-05-20 22:40:21] [INFO ] Deduced a trap composed of 38 places in 596 ms of which 6 ms to minimize.
[2024-05-20 22:40:21] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-20 22:40:21] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:40:21] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:40:21] [INFO ] Deduced a trap composed of 37 places in 57 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
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
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
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
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
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
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 2972 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
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
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
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1720
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1720 after 1733
[2024-05-20 22:40:23] [INFO ] Deduced a trap composed of 2 places in 44 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
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1733 after 1773
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
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1773 after 1873
[2024-05-20 22:40:23] [INFO ] Deduced a trap composed of 40 places in 635 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1873 after 2124
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 39 places in 574 ms of which 6 ms to minimize.
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 34 places in 58 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 3246 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 6274ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 96 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.
RANDOM walk for 40000 steps (283 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
Interrupted probabilistic random walk after 201490 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 201490 steps, saw 34872 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-20 22:40:29] [INFO ] Invariant cache hit.
[2024-05-20 22:40:29] [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-20 22:40:29] [INFO ] Deduced a trap composed of 2 places in 48 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-20 22:40:30] [INFO ] Deduced a trap composed of 38 places in 626 ms of which 6 ms to minimize.
[2024-05-20 22:40:31] [INFO ] Deduced a trap composed of 39 places in 624 ms of which 7 ms to minimize.
[2024-05-20 22:40:31] [INFO ] Deduced a trap composed of 38 places in 619 ms of which 6 ms to minimize.
[2024-05-20 22:40:32] [INFO ] Deduced a trap composed of 36 places in 583 ms of which 6 ms to minimize.
[2024-05-20 22:40:33] [INFO ] Deduced a trap composed of 47 places in 565 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2024-05-20 22:40:33] [INFO ] Deduced a trap composed of 44 places in 560 ms of which 5 ms to minimize.
[2024-05-20 22:40:34] [INFO ] Deduced a trap composed of 44 places in 548 ms of which 6 ms to minimize.
[2024-05-20 22:40:34] [INFO ] Deduced a trap composed of 44 places in 539 ms of which 6 ms to minimize.
[2024-05-20 22:40:35] [INFO ] Deduced a trap composed of 38 places in 548 ms of which 6 ms to minimize.
[2024-05-20 22:40:35] [INFO ] Deduced a trap composed of 40 places in 595 ms of which 7 ms to minimize.
[2024-05-20 22:40:36] [INFO ] Deduced a trap composed of 39 places in 522 ms of which 6 ms to minimize.
[2024-05-20 22:40:36] [INFO ] Deduced a trap composed of 42 places in 502 ms of which 5 ms to minimize.
[2024-05-20 22:40:37] [INFO ] Deduced a trap composed of 42 places in 510 ms of which 6 ms to minimize.
[2024-05-20 22:40:38] [INFO ] Deduced a trap composed of 46 places in 491 ms of which 6 ms to minimize.
[2024-05-20 22:40:38] [INFO ] Deduced a trap composed of 41 places in 500 ms of which 6 ms to minimize.
[2024-05-20 22:40:39] [INFO ] Deduced a trap composed of 44 places in 488 ms of which 5 ms to minimize.
[2024-05-20 22:40:39] [INFO ] Deduced a trap composed of 42 places in 483 ms of which 5 ms to minimize.
[2024-05-20 22:40:40] [INFO ] Deduced a trap composed of 46 places in 486 ms of which 6 ms to minimize.
[2024-05-20 22:40:40] [INFO ] Deduced a trap composed of 45 places in 490 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 12053 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-20 22:40:41] [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-20 22:40:42] [INFO ] Deduced a trap composed of 40 places in 603 ms of which 6 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 2838 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 14939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:40:44] [INFO ] Invariant cache hit.
[2024-05-20 22:40:45] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-20 22:40:45] [INFO ] Invariant cache hit.
[2024-05-20 22:40:46] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:41:02] [INFO ] Implicit Places using invariants and state equation in 16472 ms returned []
Implicit Place search using SMT with State Equation took 17369 ms to find 0 implicit places.
[2024-05-20 22:41:02] [INFO ] Redundant transitions in 111 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:41:02] [INFO ] Invariant cache hit.
[2024-05-20 22:41:02] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:41:07] [INFO ] Flatten gal took : 60 ms
[2024-05-20 22:41:07] [INFO ] Applying decomposition
[2024-05-20 22:41:07] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2916261804366751170.txt' '-o' '/tmp/graph2916261804366751170.bin' '-w' '/tmp/graph2916261804366751170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2916261804366751170.bin' '-l' '-1' '-v' '-w' '/tmp/graph2916261804366751170.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:41:07] [INFO ] Decomposing Gal with order
[2024-05-20 22:41:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:41:07] [INFO ] Removed a total of 2824 redundant transitions.
[2024-05-20 22:41:07] [INFO ] Flatten gal took : 159 ms
[2024-05-20 22:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 85 ms.
[2024-05-20 22:41:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5439941740111225767.gal : 20 ms
[2024-05-20 22:41:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4799928372009445353.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5439941740111225767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4799928372009445353.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4799928372009445353.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 786
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :786 after 786
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :786 after 786
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :786 after 786
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :786 after 786
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :786 after 796
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :796 after 801
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :801 after 807
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :807 after 821
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :821 after 935
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :935 after 2955
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2955 after 5.42808e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.42808e+06 after 6.49998e+06
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 32263ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49852 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-20 22:41:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:41:34] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:41:34] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:41:34] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:41:34] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:41:34] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:41:34] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:41:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15160298452929956016.gal : 0 ms
[2024-05-20 22:41:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1323631089812501250.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15160298452929956016.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1323631089812501250.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1323631089812501250.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001623,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.0019,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 65 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 147761 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-20 22:41:34] [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 (70 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-20 22:41:34] [INFO ] Invariant cache hit.
[2024-05-20 22:41:34] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:41:34] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:41:35] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2024-05-20 22:41:35] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:41:35] [INFO ] [Real]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-20 22:41:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:41:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:41:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:41:36] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-05-20 22:41:36] [INFO ] [Nat]Added 3582 Read/Feed constraints in 311 ms returned sat
[2024-05-20 22:41:37] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 168 ms.
[2024-05-20 22:41:37] [INFO ] Added : 10 causal constraints over 2 iterations in 616 ms. Result :sat
Minimization took 914 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
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 173 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 173 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:41:38] [INFO ] Computed 32 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7157 resets) in 7594 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (208 resets) in 922 ms. (1083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:41:47] [INFO ] Invariant cache hit.
[2024-05-20 22:41:47] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 22:41:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:41:47] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-20 22:41:48] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:41:48] [INFO ] [Real]Added 3603 Read/Feed constraints in 245 ms returned sat
[2024-05-20 22:41:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:41:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:41:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:41:49] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2024-05-20 22:41:49] [INFO ] [Nat]Added 3603 Read/Feed constraints in 287 ms returned sat
[2024-05-20 22:41:49] [INFO ] Computed and/alt/rep : 2621/6956/2621 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-20 22:41:50] [INFO ] Added : 11 causal constraints over 3 iterations in 751 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 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 63 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-20 22:41:54] [INFO ] Invariant cache hit.
[2024-05-20 22:41:55] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-20 22:41:55] [INFO ] Invariant cache hit.
[2024-05-20 22:41:56] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:42:12] [INFO ] Implicit Places using invariants and state equation in 16791 ms returned []
Implicit Place search using SMT with State Equation took 17643 ms to find 0 implicit places.
[2024-05-20 22:42:12] [INFO ] Redundant transitions in 111 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:42:12] [INFO ] Invariant cache hit.
[2024-05-20 22:42:12] [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 32188ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50049 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:42:44] [INFO ] Flatten gal took : 87 ms
RANDOM walk for 40000 steps (283 resets) in 575 ms. (69 steps per ms) remains 2/2 properties
[2024-05-20 22:42:44] [INFO ] Flatten gal took : 64 ms
[2024-05-20 22:42:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11840265646585683124.gal : 13 ms
[2024-05-20 22:42:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5314830330073804493.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11840265646585683124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5314830330073804493.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 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
Loading property file /tmp/ReachabilityCardinality5314830330073804493.prop.
Interrupted probabilistic random walk after 189395 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189395 steps, saw 33286 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-20 22:42:48] [INFO ] Invariant cache hit.
[2024-05-20 22:42:48] [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-20 22:42:48] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 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-20 22:42:49] [INFO ] Deduced a trap composed of 52 places in 662 ms of which 6 ms to minimize.
[2024-05-20 22:42:49] [INFO ] Deduced a trap composed of 35 places in 587 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
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
At refinement iteration 9 (OVERLAPS) 3695/4776 variables, 1081/1116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
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
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
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
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4721 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
After SMT solving in domain Real declared 4778/4778 variables, and 4721 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2889 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
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:42:51] [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: 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-20 22:42:51] [INFO ] Deduced a trap composed of 40 places in 629 ms of which 6 ms to minimize.
[2024-05-20 22:42:51] [INFO ] Deduced a trap composed of 34 places in 54 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
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
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 2487 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 5431ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 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.
RANDOM walk for 40000 steps (282 resets) in 561 ms. (71 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
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 202681 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 202681 steps, saw 35033 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-20 22:42:56] [INFO ] Invariant cache hit.
[2024-05-20 22:42:56] [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-20 22:42:56] [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-20 22:42:57] [INFO ] Deduced a trap composed of 35 places in 580 ms of which 6 ms to minimize.
[2024-05-20 22:42:58] [INFO ] Deduced a trap composed of 35 places in 586 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 2762 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-20 22:42:59] [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: 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-20 22:43:00] [INFO ] Deduced a trap composed of 40 places in 615 ms of which 6 ms to minimize.
[2024-05-20 22:43:01] [INFO ] Deduced a trap composed of 35 places in 617 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3060
[2024-05-20 22:43:01] [INFO ] Deduced a trap composed of 41 places in 596 ms of which 6 ms to minimize.
[2024-05-20 22:43:02] [INFO ] Deduced a trap composed of 38 places in 550 ms of which 6 ms to minimize.
[2024-05-20 22:43:02] [INFO ] Deduced a trap composed of 39 places in 568 ms of which 6 ms to minimize.
[2024-05-20 22:43:03] [INFO ] Deduced a trap composed of 38 places in 572 ms of which 6 ms to minimize.
[2024-05-20 22:43:04] [INFO ] Deduced a trap composed of 39 places in 551 ms of which 5 ms to minimize.
[2024-05-20 22:43:04] [INFO ] Deduced a trap composed of 36 places in 568 ms of which 6 ms to minimize.
[2024-05-20 22:43:05] [INFO ] Deduced a trap composed of 56 places in 544 ms of which 6 ms to minimize.
[2024-05-20 22:43:05] [INFO ] Deduced a trap composed of 45 places in 545 ms of which 5 ms to minimize.
[2024-05-20 22:43:06] [INFO ] Deduced a trap composed of 42 places in 558 ms of which 5 ms to minimize.
[2024-05-20 22:43:06] [INFO ] Deduced a trap composed of 38 places in 508 ms of which 5 ms to minimize.
[2024-05-20 22:43:07] [INFO ] Deduced a trap composed of 52 places in 468 ms of which 5 ms to minimize.
[2024-05-20 22:43:07] [INFO ] Deduced a trap composed of 43 places in 476 ms of which 5 ms to minimize.
[2024-05-20 22:43:08] [INFO ] Deduced a trap composed of 50 places in 483 ms of which 5 ms to minimize.
[2024-05-20 22:43:08] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 5 ms to minimize.
[2024-05-20 22:43:09] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 5 ms to minimize.
[2024-05-20 22:43:09] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 4 ms to minimize.
[2024-05-20 22:43:10] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 5 ms to minimize.
[2024-05-20 22:43:10] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 4 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-20 22:43:10] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 4 ms to minimize.
[2024-05-20 22:43:11] [INFO ] Deduced a trap composed of 35 places in 346 ms of which 5 ms to minimize.
[2024-05-20 22:43:11] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 4 ms to minimize.
[2024-05-20 22:43:11] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 4 ms to minimize.
[2024-05-20 22:43:12] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 4 ms to minimize.
[2024-05-20 22:43:12] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 3 ms to minimize.
[2024-05-20 22:43:12] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 4 ms to minimize.
[2024-05-20 22:43:13] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 4 ms to minimize.
[2024-05-20 22:43:13] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 4 ms to minimize.
[2024-05-20 22:43:13] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 4 ms to minimize.
[2024-05-20 22:43:13] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-05-20 22:43:14] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 3 ms to minimize.
[2024-05-20 22:43:14] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-05-20 22:43:14] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-05-20 22:43:14] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 8 ms to minimize.
[2024-05-20 22:43:15] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 3 ms to minimize.
[2024-05-20 22:43:15] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 3 ms to minimize.
[2024-05-20 22:43:15] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 3 ms to minimize.
[2024-05-20 22:43:15] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-05-20 22:43:15] [INFO ] Deduced a trap composed of 36 places in 179 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-20 22:43:16] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2024-05-20 22:43:16] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
[2024-05-20 22:43:16] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2024-05-20 22:43:16] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 2 ms to minimize.
[2024-05-20 22:43:16] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-05-20 22:43:16] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:43:17] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 2 ms to minimize.
[2024-05-20 22:43:17] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2024-05-20 22:43:17] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-20 22:43:17] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-05-20 22:43:17] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 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 19740 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 22559ms 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 65 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:43:19] [INFO ] Invariant cache hit.
[2024-05-20 22:43:20] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-20 22:43:20] [INFO ] Invariant cache hit.
[2024-05-20 22:43:21] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:43:35] [INFO ] Flatten gal took : 65 ms
[2024-05-20 22:43:35] [INFO ] Applying decomposition
[2024-05-20 22:43:35] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14283380523220635825.txt' '-o' '/tmp/graph14283380523220635825.bin' '-w' '/tmp/graph14283380523220635825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14283380523220635825.bin' '-l' '-1' '-v' '-w' '/tmp/graph14283380523220635825.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:43:35] [INFO ] Decomposing Gal with order
[2024-05-20 22:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:43:35] [INFO ] Removed a total of 2829 redundant transitions.
[2024-05-20 22:43:35] [INFO ] Flatten gal took : 164 ms
[2024-05-20 22:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 3451 labels/synchronizations in 88 ms.
[2024-05-20 22:43:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9612968989737547099.gal : 22 ms
[2024-05-20 22:43:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13421605751750437082.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9612968989737547099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13421605751750437082.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13421605751750437082.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2157
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2157 after 2157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2157 after 2707
[2024-05-20 22:43:38] [INFO ] Implicit Places using invariants and state equation in 18347 ms returned []
Implicit Place search using SMT with State Equation took 19230 ms to find 0 implicit places.
[2024-05-20 22:43:38] [INFO ] Redundant transitions in 106 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:43:38] [INFO ] Invariant cache hit.
[2024-05-20 22:43:38] [INFO ] State equation strengthened by 3603 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2707 after 662975
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :662975 after 6.10885e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.10885e+07 after 6.18038e+07
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 32208ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51652 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 5 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-20 22:44:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:44:11] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:44:11] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:44:11] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:44:11] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:44:11] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:44:11] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:44:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14106068629265072680.gal : 0 ms
[2024-05-20 22:44:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14257849901398650119.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14106068629265072680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14257849901398650119.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14257849901398650119.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,447,0.00439,3524,2,118,9,764,6,0,24,785,0
Total reachable state count : 447
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,84,0.00476,3900,2,33,9,764,7,0,27,785,0
Over-approximation ignoring read arcs solved 0 properties in 128 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 156599 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-20 22:44:11] [INFO ] Computed 32 invariants in 45 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-20 22:44:11] [INFO ] Invariant cache hit.
[2024-05-20 22:44:11] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:44:11] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:44:12] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-20 22:44:12] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:44:12] [INFO ] [Real]Added 3582 Read/Feed constraints in 242 ms returned sat
[2024-05-20 22:44:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:44:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:44:12] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:44:13] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2024-05-20 22:44:13] [INFO ] [Nat]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-20 22:44:13] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 172 ms.
[2024-05-20 22:44:14] [INFO ] Added : 4 causal constraints over 1 iterations in 521 ms. Result :sat
Minimization took 936 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 242 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 243 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-20 22:44:15] [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 (7161 resets) in 7610 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (201 resets) in 931 ms. (1072 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:44:23] [INFO ] Invariant cache hit.
[2024-05-20 22:44:24] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:44:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:44:24] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-20 22:44:24] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:44:24] [INFO ] [Real]Added 3604 Read/Feed constraints in 250 ms returned sat
[2024-05-20 22:44:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:44:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:44:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:44:25] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:44:25] [INFO ] [Nat]Added 3604 Read/Feed constraints in 258 ms returned sat
[2024-05-20 22:44:26] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 173 ms.
[2024-05-20 22:44:26] [INFO ] Added : 4 causal constraints over 1 iterations in 526 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 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 78 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:44:31] [INFO ] Invariant cache hit.
[2024-05-20 22:44:32] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-20 22:44:32] [INFO ] Invariant cache hit.
[2024-05-20 22:44:32] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:44:52] [INFO ] Implicit Places using invariants and state equation in 20280 ms returned []
Implicit Place search using SMT with State Equation took 21190 ms to find 0 implicit places.
[2024-05-20 22:44:52] [INFO ] Redundant transitions in 108 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:44:52] [INFO ] Invariant cache hit.
[2024-05-20 22:44:52] [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 32218ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53635 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:45:24] [INFO ] Flatten gal took : 116 ms
RANDOM walk for 40000 steps (282 resets) in 566 ms. (70 steps per ms) remains 2/2 properties
[2024-05-20 22:45:25] [INFO ] Flatten gal took : 92 ms
[2024-05-20 22:45:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6175284044331081605.gal : 13 ms
[2024-05-20 22:45:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16937879533483633686.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6175284044331081605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16937879533483633686.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 69 ms. (571 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16937879533483633686.prop.
Interrupted probabilistic random walk after 179253 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 179253 steps, saw 32253 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-20 22:45:28] [INFO ] Invariant cache hit.
[2024-05-20 22:45:28] [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-20 22:45:28] [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-20 22:45:29] [INFO ] Deduced a trap composed of 35 places in 649 ms of which 6 ms to minimize.
[2024-05-20 22:45:29] [INFO ] Deduced a trap composed of 34 places in 589 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:45:30] [INFO ] Deduced a trap composed of 52 places in 559 ms of which 6 ms to minimize.
[2024-05-20 22:45:30] [INFO ] Deduced a trap composed of 51 places in 556 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1720
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1720 after 1733
[2024-05-20 22:45:31] [INFO ] Deduced a trap composed of 42 places in 524 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1733 after 1773
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1773 after 1873
[2024-05-20 22:45:31] [INFO ] Deduced a trap composed of 37 places in 509 ms of which 5 ms to minimize.
[2024-05-20 22:45:32] [INFO ] Deduced a trap composed of 37 places in 475 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1873 after 2124
[2024-05-20 22:45:32] [INFO ] Deduced a trap composed of 43 places in 513 ms of which 5 ms to minimize.
[2024-05-20 22:45:33] [INFO ] Deduced a trap composed of 35 places in 489 ms of which 5 ms to minimize.
SMT process timed out in 5311ms, 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 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 66 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (285 resets) in 668 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
Interrupted probabilistic random walk after 198442 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198442 steps, saw 34474 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:45:36] [INFO ] Invariant cache hit.
[2024-05-20 22:45:36] [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-20 22:45:36] [INFO ] Deduced a trap composed of 2 places in 47 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-20 22:45:37] [INFO ] Deduced a trap composed of 37 places in 609 ms of which 6 ms to minimize.
[2024-05-20 22:45:38] [INFO ] Deduced a trap composed of 37 places in 594 ms of which 6 ms to minimize.
[2024-05-20 22:45:38] [INFO ] Deduced a trap composed of 34 places in 600 ms of which 5 ms to minimize.
[2024-05-20 22:45:39] [INFO ] Deduced a trap composed of 42 places in 571 ms of which 6 ms to minimize.
[2024-05-20 22:45:40] [INFO ] Deduced a trap composed of 40 places in 553 ms of which 5 ms to minimize.
[2024-05-20 22:45:40] [INFO ] Deduced a trap composed of 44 places in 563 ms of which 6 ms to minimize.
[2024-05-20 22:45:41] [INFO ] Deduced a trap composed of 41 places in 547 ms of which 5 ms to minimize.
[2024-05-20 22:45:41] [INFO ] Deduced a trap composed of 44 places in 523 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2024-05-20 22:45:42] [INFO ] Deduced a trap composed of 46 places in 514 ms of which 5 ms to minimize.
[2024-05-20 22:45:42] [INFO ] Deduced a trap composed of 50 places in 531 ms of which 6 ms to minimize.
[2024-05-20 22:45:43] [INFO ] Deduced a trap composed of 48 places in 525 ms of which 6 ms to minimize.
[2024-05-20 22:45:43] [INFO ] Deduced a trap composed of 35 places in 532 ms of which 6 ms to minimize.
[2024-05-20 22:45:44] [INFO ] Deduced a trap composed of 35 places in 486 ms of which 6 ms to minimize.
[2024-05-20 22:45:44] [INFO ] Deduced a trap composed of 42 places in 481 ms of which 5 ms to minimize.
[2024-05-20 22:45:45] [INFO ] Deduced a trap composed of 40 places in 448 ms of which 5 ms to minimize.
[2024-05-20 22:45:45] [INFO ] Deduced a trap composed of 46 places in 417 ms of which 4 ms to minimize.
[2024-05-20 22:45:46] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 5 ms to minimize.
[2024-05-20 22:45:46] [INFO ] Deduced a trap composed of 38 places in 399 ms of which 5 ms to minimize.
[2024-05-20 22:45:47] [INFO ] Deduced a trap composed of 46 places in 397 ms of which 4 ms to minimize.
[2024-05-20 22:45:47] [INFO ] Deduced a trap composed of 45 places in 385 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-20 22:45:47] [INFO ] Deduced a trap composed of 45 places in 380 ms of which 5 ms to minimize.
[2024-05-20 22:45:48] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 5 ms to minimize.
[2024-05-20 22:45:48] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 5 ms to minimize.
[2024-05-20 22:45:48] [INFO ] Deduced a trap composed of 40 places in 366 ms of which 5 ms to minimize.
[2024-05-20 22:45:49] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 4 ms to minimize.
[2024-05-20 22:45:49] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 4 ms to minimize.
[2024-05-20 22:45:49] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 3 ms to minimize.
[2024-05-20 22:45:50] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 4 ms to minimize.
[2024-05-20 22:45:50] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 4 ms to minimize.
[2024-05-20 22:45:50] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 4 ms to minimize.
[2024-05-20 22:45:51] [INFO ] Deduced a trap composed of 37 places in 299 ms of which 3 ms to minimize.
[2024-05-20 22:45:51] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 4 ms to minimize.
[2024-05-20 22:45:51] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 4 ms to minimize.
[2024-05-20 22:45:52] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 3 ms to minimize.
[2024-05-20 22:45:52] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 3 ms to minimize.
[2024-05-20 22:45:52] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 3 ms to minimize.
[2024-05-20 22:45:52] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 4 ms to minimize.
[2024-05-20 22:45:53] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 4 ms to minimize.
[2024-05-20 22:45:53] [INFO ] Deduced a trap composed of 39 places in 267 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 17994 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-20 22:45:54] [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, 39/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:45:55] [INFO ] Deduced a trap composed of 45 places in 586 ms of which 7 ms to minimize.
[2024-05-20 22:45:56] [INFO ] Deduced a trap composed of 45 places in 587 ms of which 7 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 4054 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 22082ms 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 76 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.
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-20 22:45:59] [INFO ] Invariant cache hit.
[2024-05-20 22:45:59] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-05-20 22:45:59] [INFO ] Invariant cache hit.
[2024-05-20 22:46:00] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:46:15] [INFO ] Flatten gal took : 63 ms
[2024-05-20 22:46:15] [INFO ] Applying decomposition
[2024-05-20 22:46:15] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15786180564069171191.txt' '-o' '/tmp/graph15786180564069171191.bin' '-w' '/tmp/graph15786180564069171191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15786180564069171191.bin' '-l' '-1' '-v' '-w' '/tmp/graph15786180564069171191.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:46:15] [INFO ] Decomposing Gal with order
[2024-05-20 22:46:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:46:15] [INFO ] Removed a total of 2821 redundant transitions.
[2024-05-20 22:46:15] [INFO ] Flatten gal took : 162 ms
[2024-05-20 22:46:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 3280 labels/synchronizations in 87 ms.
[2024-05-20 22:46:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1615024799567525648.gal : 22 ms
[2024-05-20 22:46:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15868391542291122745.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1615024799567525648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15868391542291122745.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15868391542291122745.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1002
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1002 after 1002
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1002 after 112824
[2024-05-20 22:46:20] [INFO ] Implicit Places using invariants and state equation in 20339 ms returned []
Implicit Place search using SMT with State Equation took 21334 ms to find 0 implicit places.
[2024-05-20 22:46:20] [INFO ] Redundant transitions in 107 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:46:20] [INFO ] Invariant cache hit.
[2024-05-20 22:46:20] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :112824 after 7.24947e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.24947e+06 after 1.36621e+07
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 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 1.0)
(s286 0.0)
(s287 1.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 1.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 1.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 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 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 1.0)
(s408 0.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 1.0)
(s437 0.0)
(s438 0.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 1.0)
(s467 1.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 1.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 1.0)
(s527 1.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 1.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 1.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 1.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 1.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.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 0.0)
(s768 0.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 0.0)
(s799 0.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 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 1.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 1.0)
(s888 0.0)
(s889 0.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 0.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 1.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 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 32209ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53769 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 5 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-20 22:46:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:46:52] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:46:52] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:46:52] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:46:52] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:46:52] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:46:52] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:46:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16676150813798227853.gal : 0 ms
[2024-05-20 22:46:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11753801753609906508.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16676150813798227853.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11753801753609906508.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11753801753609906508.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.006416,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.006746,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 161676 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-20 22:46:52] [INFO ] Computed 32 invariants in 47 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-20 22:46:53] [INFO ] Invariant cache hit.
[2024-05-20 22:46:53] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:46:53] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:46:53] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-05-20 22:46:53] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:46:54] [INFO ] [Real]Added 3582 Read/Feed constraints in 278 ms returned sat
[2024-05-20 22:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:46:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:46:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:46:54] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2024-05-20 22:46:55] [INFO ] [Nat]Added 3582 Read/Feed constraints in 395 ms returned sat
[2024-05-20 22:46:55] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-20 22:46:56] [INFO ] Added : 10 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 938 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 257 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 257 ms. Remains : 1082/1090 places, 3694/3702 transitions.
// Phase 1: matrix 3694 rows 1082 cols
[2024-05-20 22:46:57] [INFO ] Computed 32 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7158 resets) in 7635 ms. (130 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 920 ms. (1085 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:47:05] [INFO ] Invariant cache hit.
[2024-05-20 22:47:06] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:47:06] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:47:06] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-05-20 22:47:06] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:47:06] [INFO ] [Real]Added 3604 Read/Feed constraints in 243 ms returned sat
[2024-05-20 22:47:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:47:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:47:07] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:47:07] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-20 22:47:08] [INFO ] [Nat]Added 3604 Read/Feed constraints in 334 ms returned sat
[2024-05-20 22:47:08] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-20 22:47:08] [INFO ] Added : 8 causal constraints over 2 iterations in 645 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 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 63 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:47:13] [INFO ] Invariant cache hit.
[2024-05-20 22:47:14] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-20 22:47:14] [INFO ] Invariant cache hit.
[2024-05-20 22:47:15] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:47:33] [INFO ] Implicit Places using invariants and state equation in 19027 ms returned []
Implicit Place search using SMT with State Equation took 19930 ms to find 0 implicit places.
[2024-05-20 22:47:33] [INFO ] Redundant transitions in 108 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:47:33] [INFO ] Invariant cache hit.
[2024-05-20 22:47:33] [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 32214ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32242ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52361 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:48:05] [INFO ] Flatten gal took : 133 ms
RANDOM walk for 40000 steps (283 resets) in 515 ms. (77 steps per ms) remains 2/2 properties
[2024-05-20 22:48:06] [INFO ] Flatten gal took : 68 ms
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
[2024-05-20 22:48:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10726558496122650419.gal : 13 ms
[2024-05-20 22:48:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8729336361199893918.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10726558496122650419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8729336361199893918.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8729336361199893918.prop.
Interrupted probabilistic random walk after 182446 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 182446 steps, saw 32587 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:09] [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-20 22:48:09] [INFO ] Deduced a trap composed of 2 places in 33 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-20 22:48:10] [INFO ] Deduced a trap composed of 52 places in 632 ms of which 6 ms to minimize.
[2024-05-20 22:48:10] [INFO ] Deduced a trap composed of 52 places in 643 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:48:11] [INFO ] Deduced a trap composed of 38 places in 618 ms of which 6 ms to minimize.
[2024-05-20 22:48:11] [INFO ] Deduced a trap composed of 42 places in 608 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:48:12] [INFO ] Deduced a trap composed of 56 places in 605 ms of which 5 ms to minimize.
[2024-05-20 22:48:13] [INFO ] Deduced a trap composed of 42 places in 581 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:48:13] [INFO ] Deduced a trap composed of 47 places in 600 ms of which 6 ms to minimize.
[2024-05-20 22:48:14] [INFO ] Deduced a trap composed of 36 places in 579 ms of which 6 ms to minimize.
SMT process timed out in 5314ms, 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 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 75 ms. Remains : 1082/1082 places, 3694/3694 transitions.
RANDOM walk for 40000 steps (281 resets) in 598 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 198293 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198293 steps, saw 34458 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:48:17] [INFO ] Invariant cache hit.
[2024-05-20 22:48:17] [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-20 22:48:17] [INFO ] Deduced a trap composed of 2 places in 48 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-20 22:48:18] [INFO ] Deduced a trap composed of 38 places in 617 ms of which 7 ms to minimize.
[2024-05-20 22:48:18] [INFO ] Deduced a trap composed of 35 places in 64 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 2276 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-20 22:48:20] [INFO ] Deduced a trap composed of 2 places in 44 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-20 22:48:20] [INFO ] Deduced a trap composed of 38 places in 633 ms of which 6 ms to minimize.
[2024-05-20 22:48:21] [INFO ] Deduced a trap composed of 36 places in 613 ms of which 6 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 53 places in 580 ms of which 6 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3060
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 38 places in 492 ms of which 5 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 38 places in 501 ms of which 5 ms to minimize.
[2024-05-20 22:48:24] [INFO ] Deduced a trap composed of 37 places in 478 ms of which 5 ms to minimize.
[2024-05-20 22:48:24] [INFO ] Deduced a trap composed of 45 places in 485 ms of which 5 ms to minimize.
[2024-05-20 22:48:25] [INFO ] Deduced a trap composed of 42 places in 502 ms of which 5 ms to minimize.
[2024-05-20 22:48:25] [INFO ] Deduced a trap composed of 42 places in 446 ms of which 5 ms to minimize.
[2024-05-20 22:48:26] [INFO ] Deduced a trap composed of 39 places in 438 ms of which 5 ms to minimize.
[2024-05-20 22:48:26] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 5 ms to minimize.
[2024-05-20 22:48:26] [INFO ] Deduced a trap composed of 43 places in 412 ms of which 4 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 37 places in 409 ms of which 5 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 39 places in 397 ms of which 4 ms to minimize.
[2024-05-20 22:48:28] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 4 ms to minimize.
[2024-05-20 22:48:28] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 5 ms to minimize.
[2024-05-20 22:48:29] [INFO ] Deduced a trap composed of 41 places in 371 ms of which 4 ms to minimize.
[2024-05-20 22:48:29] [INFO ] Deduced a trap composed of 42 places in 352 ms of which 4 ms to minimize.
[2024-05-20 22:48:29] [INFO ] Deduced a trap composed of 51 places in 350 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-20 22:48:30] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 4 ms to minimize.
[2024-05-20 22:48:30] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 4 ms to minimize.
[2024-05-20 22:48:30] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 4 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 3 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 4 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 3 ms to minimize.
[2024-05-20 22:48:32] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 3 ms to minimize.
[2024-05-20 22:48:32] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 4 ms to minimize.
[2024-05-20 22:48:32] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 3 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 4 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 3 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 3 ms to minimize.
[2024-05-20 22:48:33] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 2 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 2 ms to minimize.
[2024-05-20 22:48:34] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-05-20 22:48:35] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 2 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-20 22:48:35] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-05-20 22:48:35] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-20 22:48:35] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-05-20 22:48:35] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 2 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-05-20 22:48:36] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:48:37] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-20 22:48:37] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-20 22:48:37] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-20 22:48:37] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-05-20 22:48:37] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-20 22:48:37] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-20 22:48:38] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-20 22:48:38] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-20 22:48:38] [INFO ] Deduced a trap composed of 42 places in 111 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-20 22:48:38] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2024-05-20 22:48:38] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-05-20 22:48:38] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2024-05-20 22:48:38] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 2 ms to minimize.
[2024-05-20 22:48:40] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-20 22:48:40] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-20 22:48:40] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-05-20 22:48:40] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-20 22:48:40] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-20 22:48:40] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-20 22:48:41] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 2 ms to minimize.
[2024-05-20 22:48:41] [INFO ] Deduced a trap composed of 39 places in 167 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-20 22:48:41] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-05-20 22:48:41] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-05-20 22:48:41] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2024-05-20 22:48:41] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2024-05-20 22:48:42] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:48:42] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-20 22:48:42] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-20 22:48:42] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
[2024-05-20 22:48:42] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-20 22:48:43] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-20 22:48:44] [INFO ] Deduced a trap composed of 39 places in 132 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-20 22:48:44] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-05-20 22:48:45] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-20 22:48:45] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2024-05-20 22:48:45] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-20 22:48:45] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 3 ms to minimize.
[2024-05-20 22:48:45] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-20 22:48:46] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-05-20 22:48:46] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-05-20 22:48:46] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2024-05-20 22:48:46] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-20 22:48:47] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2024-05-20 22:48:47] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3694/4774 variables, 1080/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4774 variables, 3604/4832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4774 variables, 1/4833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4774 variables, 0/4833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4776 variables, 2/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4776 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4776 variables, 0/4835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4776/4776 variables, and 4835 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29095 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: 116/116 constraints]
After SMT, in 31424ms 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 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 66 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-20 22:48:49] [INFO ] Invariant cache hit.
[2024-05-20 22:48:50] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-20 22:48:50] [INFO ] Invariant cache hit.
[2024-05-20 22:48:50] [INFO ] State equation strengthened by 3604 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 64 ms
[2024-05-20 22:48:56] [INFO ] Applying decomposition
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7879623820208885189.txt' '-o' '/tmp/graph7879623820208885189.bin' '-w' '/tmp/graph7879623820208885189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7879623820208885189.bin' '-l' '-1' '-v' '-w' '/tmp/graph7879623820208885189.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:48:56] [INFO ] Decomposing Gal with order
[2024-05-20 22:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:48:56] [INFO ] Removed a total of 2820 redundant transitions.
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 163 ms
[2024-05-20 22:48:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3224 labels/synchronizations in 87 ms.
[2024-05-20 22:48:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16120037954607880482.gal : 24 ms
[2024-05-20 22:48:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18168724566059937433.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16120037954607880482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18168724566059937433.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18168724566059937433.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1783
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1783 after 1783
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1783 after 1817
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1817 after 1834
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1834 after 6754
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6754 after 537879
[2024-05-20 22:49:09] [INFO ] Implicit Places using invariants and state equation in 19600 ms returned []
Implicit Place search using SMT with State Equation took 20512 ms to find 0 implicit places.
[2024-05-20 22:49:09] [INFO ] Redundant transitions in 106 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:49:09] [INFO ] Invariant cache hit.
[2024-05-20 22:49:09] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :537879 after 5.67855e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.67855e+07 after 5.76931e+07
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 32190ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52915 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 0 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 13 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-20 22:49:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:49:42] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:49:42] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:49:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:49:42] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:49:42] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:49:42] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:49:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6920527569930674996.gal : 1 ms
[2024-05-20 22:49:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality376486248968143405.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6920527569930674996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality376486248968143405.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality376486248968143405.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001936,3516,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002242,3892,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 83 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 169280 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-20 22:49:42] [INFO ] Computed 32 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (70 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-20 22:49:42] [INFO ] Invariant cache hit.
[2024-05-20 22:49:42] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:49:42] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:49:43] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2024-05-20 22:49:43] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:49:43] [INFO ] [Real]Added 3582 Read/Feed constraints in 263 ms returned sat
[2024-05-20 22:49:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:49:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:49:43] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:49:44] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-05-20 22:49:44] [INFO ] [Nat]Added 3582 Read/Feed constraints in 319 ms returned sat
[2024-05-20 22:49:44] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 206 ms.
[2024-05-20 22:49:45] [INFO ] Added : 9 causal constraints over 2 iterations in 697 ms. Result :sat
Minimization took 913 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 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 238 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:49:46] [INFO ] Computed 32 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7160 resets) in 7983 ms. (125 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 1092 ms. (914 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:49:55] [INFO ] Invariant cache hit.
[2024-05-20 22:49:55] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:49:55] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:49:56] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-05-20 22:49:56] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:49:56] [INFO ] [Real]Added 3603 Read/Feed constraints in 277 ms returned sat
[2024-05-20 22:49:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:49:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 22:49:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-20 22:49:57] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-20 22:49:57] [INFO ] [Nat]Added 3603 Read/Feed constraints in 265 ms returned sat
[2024-05-20 22:49:58] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 177 ms.
[2024-05-20 22:49:58] [INFO ] Added : 7 causal constraints over 2 iterations in 650 ms. Result :sat
Minimization took 4505 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:50:03] [INFO ] Invariant cache hit.
[2024-05-20 22:50:04] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-20 22:50:04] [INFO ] Invariant cache hit.
[2024-05-20 22:50:04] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:50:24] [INFO ] Implicit Places using invariants and state equation in 20534 ms returned []
Implicit Place search using SMT with State Equation took 21422 ms to find 0 implicit places.
[2024-05-20 22:50:24] [INFO ] Redundant transitions in 116 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:50:24] [INFO ] Invariant cache hit.
[2024-05-20 22:50:24] [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 32211ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53852 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:50:57] [INFO ] Flatten gal took : 100 ms
RANDOM walk for 40000 steps (283 resets) in 595 ms. (67 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
[2024-05-20 22:50:57] [INFO ] Flatten gal took : 101 ms
[2024-05-20 22:50:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3085474711848504587.gal : 13 ms
[2024-05-20 22:50:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13846902470900677363.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3085474711848504587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13846902470900677363.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13846902470900677363.prop.
Interrupted probabilistic random walk after 189372 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189372 steps, saw 33281 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-20 22:51:00] [INFO ] Invariant cache hit.
[2024-05-20 22:51:00] [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-20 22:51:00] [INFO ] Deduced a trap composed of 2 places in 43 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-20 22:51:01] [INFO ] Deduced a trap composed of 52 places in 631 ms of which 6 ms to minimize.
[2024-05-20 22:51:01] [INFO ] Deduced a trap composed of 39 places in 601 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:51:02] [INFO ] Deduced a trap composed of 40 places in 603 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
[2024-05-20 22:51:03] [INFO ] Deduced a trap composed of 37 places in 570 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:51:03] [INFO ] Deduced a trap composed of 44 places in 577 ms of which 6 ms to minimize.
[2024-05-20 22:51:04] [INFO ] Deduced a trap composed of 37 places in 589 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:51:04] [INFO ] Deduced a trap composed of 35 places in 528 ms of which 6 ms to minimize.
[2024-05-20 22:51:05] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 6 ms to minimize.
SMT process timed out in 5084ms, 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 69 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 69 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 469 ms. (85 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
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 196666 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 196666 steps, saw 34238 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-20 22:51:08] [INFO ] Invariant cache hit.
[2024-05-20 22:51: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-20 22:51:08] [INFO ] Deduced a trap composed of 2 places in 36 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-20 22:51:09] [INFO ] Deduced a trap composed of 38 places in 629 ms of which 6 ms to minimize.
[2024-05-20 22:51:10] [INFO ] Deduced a trap composed of 39 places in 651 ms of which 6 ms to minimize.
[2024-05-20 22:51:10] [INFO ] Deduced a trap composed of 38 places in 659 ms of which 7 ms to minimize.
[2024-05-20 22:51:11] [INFO ] Deduced a trap composed of 36 places in 634 ms of which 6 ms to minimize.
[2024-05-20 22:51:12] [INFO ] Deduced a trap composed of 47 places in 593 ms of which 6 ms to minimize.
[2024-05-20 22:51:12] [INFO ] Deduced a trap composed of 44 places in 595 ms of which 6 ms to minimize.
[2024-05-20 22:51:13] [INFO ] Deduced a trap composed of 44 places in 580 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3050
[2024-05-20 22:51:13] [INFO ] Deduced a trap composed of 44 places in 591 ms of which 7 ms to minimize.
[2024-05-20 22:51:14] [INFO ] Deduced a trap composed of 38 places in 607 ms of which 6 ms to minimize.
[2024-05-20 22:51:15] [INFO ] Deduced a trap composed of 40 places in 593 ms of which 6 ms to minimize.
[2024-05-20 22:51:15] [INFO ] Deduced a trap composed of 39 places in 577 ms of which 6 ms to minimize.
[2024-05-20 22:51:16] [INFO ] Deduced a trap composed of 47 places in 547 ms of which 5 ms to minimize.
[2024-05-20 22:51:16] [INFO ] Deduced a trap composed of 35 places in 520 ms of which 6 ms to minimize.
[2024-05-20 22:51:17] [INFO ] Deduced a trap composed of 48 places in 509 ms of which 5 ms to minimize.
[2024-05-20 22:51:17] [INFO ] Deduced a trap composed of 44 places in 508 ms of which 5 ms to minimize.
[2024-05-20 22:51:18] [INFO ] Deduced a trap composed of 43 places in 499 ms of which 5 ms to minimize.
[2024-05-20 22:51:19] [INFO ] Deduced a trap composed of 45 places in 513 ms of which 6 ms to minimize.
[2024-05-20 22:51:19] [INFO ] Deduced a trap composed of 45 places in 486 ms of which 6 ms to minimize.
[2024-05-20 22:51:20] [INFO ] Deduced a trap composed of 48 places in 469 ms of which 5 ms to minimize.
[2024-05-20 22:51:20] [INFO ] Deduced a trap composed of 44 places in 471 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-20 22:51:21] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 5 ms to minimize.
[2024-05-20 22:51:21] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 5 ms to minimize.
[2024-05-20 22:51:21] [INFO ] Deduced a trap composed of 47 places in 439 ms of which 5 ms to minimize.
[2024-05-20 22:51:22] [INFO ] Deduced a trap composed of 45 places in 441 ms of which 5 ms to minimize.
[2024-05-20 22:51:22] [INFO ] Deduced a trap composed of 46 places in 457 ms of which 5 ms to minimize.
[2024-05-20 22:51:23] [INFO ] Deduced a trap composed of 45 places in 449 ms of which 5 ms to minimize.
[2024-05-20 22:51:23] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 5 ms to minimize.
[2024-05-20 22:51:24] [INFO ] Deduced a trap composed of 45 places in 448 ms of which 5 ms to minimize.
[2024-05-20 22:51:24] [INFO ] Deduced a trap composed of 45 places in 425 ms of which 5 ms to minimize.
[2024-05-20 22:51:25] [INFO ] Deduced a trap composed of 45 places in 425 ms of which 5 ms to minimize.
[2024-05-20 22:51:25] [INFO ] Deduced a trap composed of 43 places in 437 ms of which 5 ms to minimize.
[2024-05-20 22:51:26] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 5 ms to minimize.
[2024-05-20 22:51:26] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 5 ms to minimize.
[2024-05-20 22:51:26] [INFO ] Deduced a trap composed of 43 places in 352 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 19522 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-20 22:51:28] [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, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:51:28] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 4 ms to minimize.
[2024-05-20 22:51:29] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 4 ms to minimize.
[2024-05-20 22:51:29] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 4 ms to minimize.
[2024-05-20 22:51:29] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 4 ms to minimize.
[2024-05-20 22:51:30] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 3 ms to minimize.
[2024-05-20 22:51:30] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 3 ms to minimize.
[2024-05-20 22:51:30] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 4 ms to minimize.
[2024-05-20 22:51:31] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2024-05-20 22:51:31] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 3 ms to minimize.
[2024-05-20 22:51:31] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 3 ms to minimize.
[2024-05-20 22:51:31] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-05-20 22:51:32] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 3 ms to minimize.
[2024-05-20 22:51:32] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-05-20 22:51:32] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-05-20 22:51:32] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-20 22:51:32] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 19 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 41 places in 113 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-20 22:51:33] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-20 22:51:33] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:51:34] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-20 22:51:34] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-20 22:51:34] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 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 8650 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 28207ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 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 62 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:51:37] [INFO ] Invariant cache hit.
[2024-05-20 22:51:37] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-20 22:51:37] [INFO ] Invariant cache hit.
[2024-05-20 22:51:38] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:51:47] [INFO ] Flatten gal took : 62 ms
[2024-05-20 22:51:47] [INFO ] Applying decomposition
[2024-05-20 22:51:47] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3771498434015079855.txt' '-o' '/tmp/graph3771498434015079855.bin' '-w' '/tmp/graph3771498434015079855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3771498434015079855.bin' '-l' '-1' '-v' '-w' '/tmp/graph3771498434015079855.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:51:47] [INFO ] Decomposing Gal with order
[2024-05-20 22:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:51:47] [INFO ] Removed a total of 2824 redundant transitions.
[2024-05-20 22:51:47] [INFO ] Flatten gal took : 159 ms
[2024-05-20 22:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 86 ms.
[2024-05-20 22:51:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9151736208243029522.gal : 21 ms
[2024-05-20 22:51:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5955576491622039612.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9151736208243029522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5955576491622039612.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5955576491622039612.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 128
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :128 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 9066
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9066 after 20457
[2024-05-20 22:52:00] [INFO ] Implicit Places using invariants and state equation in 22926 ms returned []
Implicit Place search using SMT with State Equation took 23831 ms to find 0 implicit places.
[2024-05-20 22:52:00] [INFO ] Redundant transitions in 105 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:52:01] [INFO ] Invariant cache hit.
[2024-05-20 22:52:01] [INFO ] State equation strengthened by 3603 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :20457 after 7.71233e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.71233e+07 after 8.12127e+07
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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32212ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56252 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 8 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-20 22:52:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:52:33] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:52:33] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:52:33] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:52:33] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:52:33] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:52:33] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:52:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11345869417611297980.gal : 1 ms
[2024-05-20 22:52:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality306789173202626559.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11345869417611297980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality306789173202626559.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality306789173202626559.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001592,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.001866,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 66 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 171173 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-20 22:52:33] [INFO ] Computed 32 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (72 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-20 22:52:33] [INFO ] Invariant cache hit.
[2024-05-20 22:52:33] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:52:33] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:52:34] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2024-05-20 22:52:34] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:52:34] [INFO ] [Real]Added 3582 Read/Feed constraints in 253 ms returned sat
[2024-05-20 22:52:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:52:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:52:34] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:52:35] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-20 22:52:35] [INFO ] [Nat]Added 3582 Read/Feed constraints in 296 ms returned sat
[2024-05-20 22:52:35] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 166 ms.
[2024-05-20 22:52:36] [INFO ] Added : 10 causal constraints over 2 iterations in 632 ms. Result :sat
Minimization took 936 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 243 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 243 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:52:37] [INFO ] Computed 32 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7154 resets) in 7584 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 927 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:52:46] [INFO ] Invariant cache hit.
[2024-05-20 22:52:46] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 22:52:46] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-20 22:52:46] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-20 22:52:46] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:52:47] [INFO ] [Real]Added 3603 Read/Feed constraints in 256 ms returned sat
[2024-05-20 22:52:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:52:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:52:47] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:52:47] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2024-05-20 22:52:48] [INFO ] [Nat]Added 3603 Read/Feed constraints in 267 ms returned sat
[2024-05-20 22:52:48] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:52:48] [INFO ] Added : 7 causal constraints over 2 iterations in 632 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 75 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-20 22:52:53] [INFO ] Invariant cache hit.
[2024-05-20 22:52:54] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-20 22:52:54] [INFO ] Invariant cache hit.
[2024-05-20 22:52:55] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:53:11] [INFO ] Implicit Places using invariants and state equation in 16899 ms returned []
Implicit Place search using SMT with State Equation took 17747 ms to find 0 implicit places.
[2024-05-20 22:53:11] [INFO ] Redundant transitions in 114 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:53:11] [INFO ] Invariant cache hit.
[2024-05-20 22:53:11] [INFO ] State equation strengthened by 3603 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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 32163ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50127 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:53:43] [INFO ] Flatten gal took : 99 ms
RANDOM walk for 40000 steps (283 resets) in 586 ms. (68 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
[2024-05-20 22:53:43] [INFO ] Flatten gal took : 69 ms
[2024-05-20 22:53:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5915112645786204324.gal : 13 ms
[2024-05-20 22:53:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10662617973694617108.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5915112645786204324.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10662617973694617108.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10662617973694617108.prop.
Interrupted probabilistic random walk after 181299 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 181299 steps, saw 32461 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-20 22:53:46] [INFO ] Invariant cache hit.
[2024-05-20 22:53:46] [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-20 22:53:47] [INFO ] Deduced a trap composed of 2 places in 43 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-20 22:53:47] [INFO ] Deduced a trap composed of 47 places in 642 ms of which 6 ms to minimize.
[2024-05-20 22:53:48] [INFO ] Deduced a trap composed of 41 places in 616 ms of which 5 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
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
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 2798 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
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1328
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-20 22:53:49] [INFO ] Deduced a trap composed of 2 places in 39 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
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1328 after 1552
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
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1552 after 1720
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1720 after 1733
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1733 after 1773
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1773 after 1873
[2024-05-20 22:53:50] [INFO ] Deduced a trap composed of 41 places in 682 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1873 after 2124
[2024-05-20 22:53:51] [INFO ] Deduced a trap composed of 38 places in 619 ms of which 6 ms to minimize.
[2024-05-20 22:53:51] [INFO ] Deduced a trap composed of 38 places in 52 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 3500 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 6344ms 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 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.
RANDOM walk for 40000 steps (285 resets) in 451 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
Interrupted probabilistic random walk after 199942 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199942 steps, saw 34670 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:53:56] [INFO ] Invariant cache hit.
[2024-05-20 22:53:56] [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-20 22:53:56] [INFO ] Deduced a trap composed of 2 places in 46 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-20 22:53:57] [INFO ] Deduced a trap composed of 59 places in 692 ms of which 7 ms to minimize.
[2024-05-20 22:53:58] [INFO ] Deduced a trap composed of 62 places in 689 ms of which 7 ms to minimize.
[2024-05-20 22:53:58] [INFO ] Deduced a trap composed of 43 places in 660 ms of which 6 ms to minimize.
[2024-05-20 22:53:59] [INFO ] Deduced a trap composed of 44 places in 661 ms of which 6 ms to minimize.
[2024-05-20 22:54:00] [INFO ] Deduced a trap composed of 43 places in 649 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
[2024-05-20 22:54:00] [INFO ] Deduced a trap composed of 44 places in 665 ms of which 6 ms to minimize.
[2024-05-20 22:54:01] [INFO ] Deduced a trap composed of 44 places in 562 ms of which 6 ms to minimize.
[2024-05-20 22:54:02] [INFO ] Deduced a trap composed of 45 places in 603 ms of which 6 ms to minimize.
[2024-05-20 22:54:02] [INFO ] Deduced a trap composed of 42 places in 618 ms of which 6 ms to minimize.
[2024-05-20 22:54:03] [INFO ] Deduced a trap composed of 38 places in 614 ms of which 6 ms to minimize.
[2024-05-20 22:54:04] [INFO ] Deduced a trap composed of 39 places in 617 ms of which 6 ms to minimize.
[2024-05-20 22:54:04] [INFO ] Deduced a trap composed of 47 places in 588 ms of which 6 ms to minimize.
[2024-05-20 22:54:05] [INFO ] Deduced a trap composed of 43 places in 576 ms of which 6 ms to minimize.
[2024-05-20 22:54:05] [INFO ] Deduced a trap composed of 36 places in 579 ms of which 6 ms to minimize.
[2024-05-20 22:54:06] [INFO ] Deduced a trap composed of 43 places in 577 ms of which 6 ms to minimize.
[2024-05-20 22:54:06] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 6 ms to minimize.
[2024-05-20 22:54:07] [INFO ] Deduced a trap composed of 43 places in 544 ms of which 6 ms to minimize.
[2024-05-20 22:54:08] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 6 ms to minimize.
[2024-05-20 22:54:08] [INFO ] Deduced a trap composed of 41 places in 550 ms of which 6 ms to minimize.
[2024-05-20 22:54:09] [INFO ] Deduced a trap composed of 40 places in 534 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-20 22:54:09] [INFO ] Deduced a trap composed of 40 places in 545 ms of which 6 ms to minimize.
[2024-05-20 22:54:10] [INFO ] Deduced a trap composed of 35 places in 489 ms of which 5 ms to minimize.
[2024-05-20 22:54:10] [INFO ] Deduced a trap composed of 52 places in 492 ms of which 5 ms to minimize.
[2024-05-20 22:54:11] [INFO ] Deduced a trap composed of 49 places in 478 ms of which 5 ms to minimize.
[2024-05-20 22:54:11] [INFO ] Deduced a trap composed of 48 places in 447 ms of which 5 ms to minimize.
[2024-05-20 22:54:12] [INFO ] Deduced a trap composed of 35 places in 426 ms of which 4 ms to minimize.
[2024-05-20 22:54:12] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 5 ms to minimize.
[2024-05-20 22:54:13] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 4 ms to minimize.
[2024-05-20 22:54:13] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 5 ms to minimize.
[2024-05-20 22:54:14] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 4 ms to minimize.
[2024-05-20 22:54:14] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 5 ms to minimize.
[2024-05-20 22:54:14] [INFO ] Deduced a trap composed of 50 places in 404 ms of which 4 ms to minimize.
[2024-05-20 22:54:15] [INFO ] Deduced a trap composed of 45 places in 360 ms of which 5 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 19990 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-20 22:54:16] [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, 33/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 22:54:17] [INFO ] Deduced a trap composed of 41 places in 678 ms of which 6 ms to minimize.
[2024-05-20 22:54:18] [INFO ] Deduced a trap composed of 41 places in 644 ms of which 7 ms to minimize.
[2024-05-20 22:54:18] [INFO ] Deduced a trap composed of 38 places in 618 ms of which 7 ms to minimize.
[2024-05-20 22:54:19] [INFO ] Deduced a trap composed of 43 places in 600 ms of which 6 ms to minimize.
[2024-05-20 22:54:19] [INFO ] Deduced a trap composed of 34 places in 562 ms of which 6 ms to minimize.
[2024-05-20 22:54:20] [INFO ] Deduced a trap composed of 40 places in 553 ms of which 13 ms to minimize.
[2024-05-20 22:54:21] [INFO ] Deduced a trap composed of 41 places in 537 ms of which 6 ms to minimize.
[2024-05-20 22:54:21] [INFO ] Deduced a trap composed of 42 places in 526 ms of which 6 ms to minimize.
[2024-05-20 22:54:22] [INFO ] Deduced a trap composed of 42 places in 529 ms of which 6 ms to minimize.
[2024-05-20 22:54:22] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 6 ms to minimize.
[2024-05-20 22:54:23] [INFO ] Deduced a trap composed of 39 places in 523 ms of which 6 ms to minimize.
[2024-05-20 22:54:23] [INFO ] Deduced a trap composed of 39 places in 524 ms of which 5 ms to minimize.
[2024-05-20 22:54:24] [INFO ] Deduced a trap composed of 41 places in 526 ms of which 5 ms to minimize.
[2024-05-20 22:54:24] [INFO ] Deduced a trap composed of 38 places in 526 ms of which 6 ms to minimize.
[2024-05-20 22:54:25] [INFO ] Deduced a trap composed of 38 places in 524 ms of which 6 ms to minimize.
[2024-05-20 22:54:25] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 6 ms to minimize.
[2024-05-20 22:54:26] [INFO ] Deduced a trap composed of 42 places in 532 ms of which 6 ms to minimize.
[2024-05-20 22:54:27] [INFO ] Deduced a trap composed of 41 places in 521 ms of which 6 ms to minimize.
[2024-05-20 22:54:27] [INFO ] Deduced a trap composed of 37 places in 563 ms of which 6 ms to minimize.
[2024-05-20 22:54:28] [INFO ] Deduced a trap composed of 38 places in 516 ms of which 5 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-20 22:54:28] [INFO ] Deduced a trap composed of 40 places in 524 ms of which 6 ms to minimize.
[2024-05-20 22:54:29] [INFO ] Deduced a trap composed of 39 places in 518 ms of which 5 ms to minimize.
[2024-05-20 22:54:29] [INFO ] Deduced a trap composed of 41 places in 530 ms of which 6 ms to minimize.
[2024-05-20 22:54:30] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 5 ms to minimize.
[2024-05-20 22:54:30] [INFO ] Deduced a trap composed of 37 places in 520 ms of which 5 ms to minimize.
[2024-05-20 22:54:31] [INFO ] Deduced a trap composed of 36 places in 515 ms of which 5 ms to minimize.
[2024-05-20 22:54:31] [INFO ] Deduced a trap composed of 39 places in 514 ms of which 6 ms to minimize.
[2024-05-20 22:54:32] [INFO ] Deduced a trap composed of 38 places in 514 ms of which 5 ms to minimize.
[2024-05-20 22:54:33] [INFO ] Deduced a trap composed of 37 places in 512 ms of which 6 ms to minimize.
[2024-05-20 22:54:33] [INFO ] Deduced a trap composed of 41 places in 492 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2024-05-20 22:54:34] [INFO ] Flatten gal took : 65 ms
[2024-05-20 22:54:34] [INFO ] Applying decomposition
[2024-05-20 22:54:34] [INFO ] Deduced a trap composed of 50 places in 480 ms of which 5 ms to minimize.
[2024-05-20 22:54:34] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13148798224449111612.txt' '-o' '/tmp/graph13148798224449111612.bin' '-w' '/tmp/graph13148798224449111612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13148798224449111612.bin' '-l' '-1' '-v' '-w' '/tmp/graph13148798224449111612.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:54:34] [INFO ] Decomposing Gal with order
[2024-05-20 22:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:54:34] [INFO ] Removed a total of 2824 redundant transitions.
[2024-05-20 22:54:34] [INFO ] Flatten gal took : 163 ms
[2024-05-20 22:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 3398 labels/synchronizations in 86 ms.
[2024-05-20 22:54:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3398022025880086050.gal : 20 ms
[2024-05-20 22:54:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7188635620991199315.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3398022025880086050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7188635620991199315.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-20 22:54:34] [INFO ] Deduced a trap composed of 45 places in 499 ms of which 5 ms to minimize.
Loading property file /tmp/ReachabilityCardinality7188635620991199315.prop.
[2024-05-20 22:54:35] [INFO ] Deduced a trap composed of 47 places in 459 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 160
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :160 after 160
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :160 after 160
[2024-05-20 22:54:35] [INFO ] Deduced a trap composed of 43 places in 446 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :160 after 8566
[2024-05-20 22:54:35] [INFO ] Deduced a trap composed of 44 places in 448 ms of which 5 ms to minimize.
[2024-05-20 22:54:36] [INFO ] Deduced a trap composed of 46 places in 448 ms of which 5 ms to minimize.
[2024-05-20 22:54:36] [INFO ] Deduced a trap composed of 42 places in 449 ms of which 5 ms to minimize.
[2024-05-20 22:54:37] [INFO ] Deduced a trap composed of 42 places in 443 ms of which 5 ms to minimize.
[2024-05-20 22:54:37] [INFO ] Deduced a trap composed of 46 places in 427 ms of which 4 ms to minimize.
[2024-05-20 22:54:38] [INFO ] Deduced a trap composed of 47 places in 421 ms of which 5 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-20 22:54:38] [INFO ] Deduced a trap composed of 43 places in 445 ms of which 5 ms to minimize.
[2024-05-20 22:54:39] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 5 ms to minimize.
[2024-05-20 22:54:39] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 4 ms to minimize.
[2024-05-20 22:54:40] [INFO ] Deduced a trap composed of 44 places in 396 ms of which 4 ms to minimize.
[2024-05-20 22:54:40] [INFO ] Deduced a trap composed of 44 places in 397 ms of which 4 ms to minimize.
[2024-05-20 22:54:40] [INFO ] Deduced a trap composed of 42 places in 381 ms of which 5 ms to minimize.
[2024-05-20 22:54:41] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 5 ms to minimize.
[2024-05-20 22:54:41] [INFO ] Deduced a trap composed of 45 places in 394 ms of which 4 ms to minimize.
[2024-05-20 22:54:42] [INFO ] Deduced a trap composed of 45 places in 386 ms of which 5 ms to minimize.
[2024-05-20 22:54:42] [INFO ] Deduced a trap composed of 45 places in 386 ms of which 4 ms to minimize.
[2024-05-20 22:54:42] [INFO ] Deduced a trap composed of 43 places in 402 ms of which 4 ms to minimize.
[2024-05-20 22:54:43] [INFO ] Deduced a trap composed of 46 places in 395 ms of which 5 ms to minimize.
[2024-05-20 22:54:43] [INFO ] Deduced a trap composed of 40 places in 356 ms of which 4 ms to minimize.
[2024-05-20 22:54:44] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 5 ms to minimize.
[2024-05-20 22:54:44] [INFO ] Deduced a trap composed of 35 places in 305 ms of which 4 ms to minimize.
[2024-05-20 22:54:44] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 4 ms to minimize.
[2024-05-20 22:54:44] [INFO ] Deduced a trap composed of 47 places in 292 ms of which 4 ms to minimize.
[2024-05-20 22:54:45] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 4 ms to minimize.
[2024-05-20 22:54:45] [INFO ] Deduced a trap composed of 47 places in 294 ms of which 4 ms to minimize.
[2024-05-20 22:54:45] [INFO ] Deduced a trap composed of 47 places in 293 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
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8566 after 717731
[2024-05-20 22:54:46] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 3 ms to minimize.
[2024-05-20 22:54:46] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 3 ms to minimize.
[2024-05-20 22:54:46] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 4 ms to minimize.
[2024-05-20 22:54:47] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 4 ms to minimize.
[2024-05-20 22:54:47] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 4 ms to minimize.
[2024-05-20 22:54:47] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 4 ms to minimize.
[2024-05-20 22:54:47] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 3 ms to minimize.
[2024-05-20 22:54:48] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 3 ms to minimize.
[2024-05-20 22:54:48] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 4 ms to minimize.
[2024-05-20 22:54:48] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 4 ms to minimize.
[2024-05-20 22:54:49] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-05-20 22:54:49] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
[2024-05-20 22:54:49] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-05-20 22:54:49] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-20 22:54:49] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-05-20 22:54:50] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-20 22:54:50] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-05-20 22:54:50] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-05-20 22:54:50] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-20 22:54:50] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 2 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-20 22:54:51] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 2 ms to minimize.
[2024-05-20 22:54:51] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-05-20 22:54:51] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-20 22:54:51] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-20 22:54:51] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-20 22:54:51] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-20 22:54:52] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-20 22:54:52] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:54:52] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-05-20 22:54:52] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-05-20 22:54:52] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-20 22:54:52] [INFO ] Deduced a trap composed of 44 places in 84 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 38706 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 58740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 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-20 22:54:55] [INFO ] Invariant cache hit.
[2024-05-20 22:54:56] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-20 22:54:56] [INFO ] Invariant cache hit.
[2024-05-20 22:54:56] [INFO ] State equation strengthened by 3603 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :717731 after 6.21353e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.21353e+07 after 6.31066e+07
[2024-05-20 22:55:14] [INFO ] Implicit Places using invariants and state equation in 18305 ms returned []
Implicit Place search using SMT with State Equation took 19193 ms to find 0 implicit places.
[2024-05-20 22:55:14] [INFO ] Redundant transitions in 107 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:55:14] [INFO ] Invariant cache hit.
[2024-05-20 22:55:14] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
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 32182ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51587 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 193497 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-20 22:55:46] [INFO ] Computed 32 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 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-20 22:55:47] [INFO ] Invariant cache hit.
[2024-05-20 22:55:47] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:55:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:55:47] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-20 22:55:47] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:55:48] [INFO ] [Real]Added 3582 Read/Feed constraints in 243 ms returned sat
[2024-05-20 22:55:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:55:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:55:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:55:48] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2024-05-20 22:55:49] [INFO ] [Nat]Added 3582 Read/Feed constraints in 267 ms returned sat
[2024-05-20 22:55:49] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 169 ms.
[2024-05-20 22:55:49] [INFO ] Added : 8 causal constraints over 2 iterations in 639 ms. Result :sat
Minimization took 929 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 237 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 238 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 22:55:51] [INFO ] Computed 32 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[30]
RANDOM walk for 1000000 steps (7141 resets) in 7695 ms. (129 steps per ms)
BEST_FIRST walk for 1000001 steps (202 resets) in 958 ms. (1042 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:55:59] [INFO ] Invariant cache hit.
[2024-05-20 22:55:59] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 22:55:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:56:00] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-20 22:56:00] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:56:00] [INFO ] [Real]Added 3603 Read/Feed constraints in 253 ms returned sat
[2024-05-20 22:56:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:56:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-20 22:56:00] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:56:01] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2024-05-20 22:56:01] [INFO ] [Nat]Added 3603 Read/Feed constraints in 277 ms returned sat
[2024-05-20 22:56:02] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 192 ms.
[2024-05-20 22:56:02] [INFO ] Added : 8 causal constraints over 2 iterations in 656 ms. Result :sat
Minimization took 4503 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 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:56:07] [INFO ] Invariant cache hit.
[2024-05-20 22:56:08] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-20 22:56:08] [INFO ] Invariant cache hit.
[2024-05-20 22:56:08] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 22:56:25] [INFO ] Implicit Places using invariants and state equation in 17481 ms returned []
Implicit Place search using SMT with State Equation took 18338 ms to find 0 implicit places.
[2024-05-20 22:56:25] [INFO ] Redundant transitions in 108 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:56:25] [INFO ] Invariant cache hit.
[2024-05-20 22:56:25] [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 32315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50840 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 22:56:58] [INFO ] Flatten gal took : 161 ms
RANDOM walk for 40000 steps (286 resets) in 577 ms. (69 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 55 ms. (714 steps per ms) remains 2/2 properties
[2024-05-20 22:56:58] [INFO ] Flatten gal took : 64 ms
[2024-05-20 22:56:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12301458395633642208.gal : 12 ms
[2024-05-20 22:56:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13188620590283661809.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12301458395633642208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13188620590283661809.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13188620590283661809.prop.
Interrupted probabilistic random walk after 178403 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 178403 steps, saw 32162 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-20 22:57:01] [INFO ] Invariant cache hit.
[2024-05-20 22:57:01] [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-20 22:57:01] [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-20 22:57:02] [INFO ] Deduced a trap composed of 52 places in 671 ms of which 6 ms to minimize.
[2024-05-20 22:57:02] [INFO ] Deduced a trap composed of 37 places in 621 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:57:03] [INFO ] Deduced a trap composed of 40 places in 621 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
[2024-05-20 22:57:04] [INFO ] Deduced a trap composed of 36 places in 594 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:57:04] [INFO ] Deduced a trap composed of 35 places in 592 ms of which 6 ms to minimize.
[2024-05-20 22:57:05] [INFO ] Deduced a trap composed of 37 places in 563 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:57:05] [INFO ] Deduced a trap composed of 37 places in 556 ms of which 6 ms to minimize.
[2024-05-20 22:57:06] [INFO ] Deduced a trap composed of 42 places in 539 ms of which 6 ms to minimize.
SMT process timed out in 5253ms, 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 69 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 69 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 198610 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198610 steps, saw 34488 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:57:09] [INFO ] Invariant cache hit.
[2024-05-20 22:57:09] [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-20 22:57:09] [INFO ] Deduced a trap composed of 2 places in 47 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-20 22:57:10] [INFO ] Deduced a trap composed of 38 places in 671 ms of which 6 ms to minimize.
[2024-05-20 22:57:11] [INFO ] Deduced a trap composed of 39 places in 658 ms of which 6 ms to minimize.
[2024-05-20 22:57:12] [INFO ] Deduced a trap composed of 38 places in 605 ms of which 6 ms to minimize.
[2024-05-20 22:57:12] [INFO ] Deduced a trap composed of 36 places in 641 ms of which 7 ms to minimize.
[2024-05-20 22:57:13] [INFO ] Deduced a trap composed of 47 places in 604 ms of which 7 ms to minimize.
[2024-05-20 22:57:13] [INFO ] Deduced a trap composed of 44 places in 599 ms of which 6 ms to minimize.
[2024-05-20 22:57:14] [INFO ] Deduced a trap composed of 40 places in 584 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3061
[2024-05-20 22:57:15] [INFO ] Deduced a trap composed of 39 places in 620 ms of which 6 ms to minimize.
[2024-05-20 22:57:15] [INFO ] Deduced a trap composed of 41 places in 597 ms of which 6 ms to minimize.
[2024-05-20 22:57:16] [INFO ] Deduced a trap composed of 43 places in 599 ms of which 6 ms to minimize.
[2024-05-20 22:57:17] [INFO ] Deduced a trap composed of 39 places in 561 ms of which 6 ms to minimize.
[2024-05-20 22:57:17] [INFO ] Deduced a trap composed of 43 places in 530 ms of which 5 ms to minimize.
[2024-05-20 22:57:18] [INFO ] Deduced a trap composed of 43 places in 527 ms of which 6 ms to minimize.
[2024-05-20 22:57:18] [INFO ] Deduced a trap composed of 41 places in 526 ms of which 5 ms to minimize.
[2024-05-20 22:57:19] [INFO ] Deduced a trap composed of 42 places in 523 ms of which 5 ms to minimize.
[2024-05-20 22:57:19] [INFO ] Deduced a trap composed of 40 places in 538 ms of which 5 ms to minimize.
[2024-05-20 22:57:20] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 5 ms to minimize.
[2024-05-20 22:57:20] [INFO ] Deduced a trap composed of 37 places in 463 ms of which 5 ms to minimize.
[2024-05-20 22:57:21] [INFO ] Deduced a trap composed of 36 places in 457 ms of which 5 ms to minimize.
[2024-05-20 22:57:21] [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-20 22:57:22] [INFO ] Deduced a trap composed of 46 places in 432 ms of which 5 ms to minimize.
[2024-05-20 22:57:22] [INFO ] Deduced a trap composed of 35 places in 379 ms of which 4 ms to minimize.
[2024-05-20 22:57:22] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 4 ms to minimize.
[2024-05-20 22:57:23] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 4 ms to minimize.
[2024-05-20 22:57:23] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 4 ms to minimize.
[2024-05-20 22:57:23] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 4 ms to minimize.
[2024-05-20 22:57:24] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 4 ms to minimize.
[2024-05-20 22:57:24] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 4 ms to minimize.
[2024-05-20 22:57:24] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 3 ms to minimize.
[2024-05-20 22:57:25] [INFO ] Deduced a trap composed of 43 places in 313 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 16671 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-20 22:57:26] [INFO ] Deduced a trap composed of 2 places in 38 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-20 22:57:27] [INFO ] Deduced a trap composed of 38 places in 658 ms of which 7 ms to minimize.
[2024-05-20 22:57:28] [INFO ] Deduced a trap composed of 37 places in 656 ms of which 7 ms to minimize.
[2024-05-20 22:57:28] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:57:28] [INFO ] Deduced a trap composed of 34 places in 60 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 3541 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 20246ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 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 63 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 22:57:30] [INFO ] Invariant cache hit.
[2024-05-20 22:57:31] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-20 22:57:31] [INFO ] Invariant cache hit.
[2024-05-20 22:57:31] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 22:57:48] [INFO ] Flatten gal took : 63 ms
[2024-05-20 22:57:48] [INFO ] Applying decomposition
[2024-05-20 22:57:48] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1538959564682449749.txt' '-o' '/tmp/graph1538959564682449749.bin' '-w' '/tmp/graph1538959564682449749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1538959564682449749.bin' '-l' '-1' '-v' '-w' '/tmp/graph1538959564682449749.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:57:48] [INFO ] Decomposing Gal with order
[2024-05-20 22:57:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:57:48] [INFO ] Removed a total of 2824 redundant transitions.
[2024-05-20 22:57:48] [INFO ] Flatten gal took : 160 ms
[2024-05-20 22:57:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3452 labels/synchronizations in 87 ms.
[2024-05-20 22:57:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13358971643181971740.gal : 22 ms
[2024-05-20 22:57:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16865059981705170808.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13358971643181971740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16865059981705170808.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16865059981705170808.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 88
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :88 after 88
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :88 after 4356
[2024-05-20 22:57:51] [INFO ] Implicit Places using invariants and state equation in 20416 ms returned []
Implicit Place search using SMT with State Equation took 21367 ms to find 0 implicit places.
[2024-05-20 22:57:51] [INFO ] Redundant transitions in 108 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 22:57:51] [INFO ] Invariant cache hit.
[2024-05-20 22:57:51] [INFO ] State equation strengthened by 3603 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4356 after 11958
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :11958 after 6.93342e+07
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 1.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 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 1.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 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 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 1.0)
(s436 1.0)
(s437 0.0)
(s438 0.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 1.0)
(s526 1.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 1.0)
(s557 0.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 1.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 1.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 1.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 1.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 1.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 1.0)
(s736 0.0)
(s737 1.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 0.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 1.0)
(s797 0.0)
(s798 0.0)
(s799 0.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 1.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 0.0)
(s856 0.0)
(s857 1.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 1.0)
(s888 1.0)
(s889 0.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 0.0)
(s918 1.0)
(s919 0.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 1.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)timeout
(s975 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 32375ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53952 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-20 22:58:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:58:24] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:58:24] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 22:58:24] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:58:24] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 22:58:24] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:58:24] [INFO ] Flatten gal took : 0 ms
[2024-05-20 22:58:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16391787697373470833.gal : 0 ms
[2024-05-20 22:58:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17537926899246697606.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16391787697373470833.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17537926899246697606.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17537926899246697606.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002533,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002982,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 61 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 157303 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-20 22:58:24] [INFO ] Computed 32 invariants in 114 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (71 resets) in 87 ms. (113 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:58:24] [INFO ] Invariant cache hit.
[2024-05-20 22:58:24] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:58:24] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:58:25] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-20 22:58:25] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 22:58:25] [INFO ] [Real]Added 3582 Read/Feed constraints in 290 ms returned sat
[2024-05-20 22:58:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:58:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:58:25] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:58:26] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-20 22:58:26] [INFO ] [Nat]Added 3582 Read/Feed constraints in 365 ms returned sat
[2024-05-20 22:58:26] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 170 ms.
[2024-05-20 22:58:27] [INFO ] Added : 9 causal constraints over 2 iterations in 647 ms. Result :sat
Minimization took 940 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-20 22:58:28] [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 (7152 resets) in 7695 ms. (129 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 928 ms. (1076 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 22:58:37] [INFO ] Invariant cache hit.
[2024-05-20 22:58:37] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-20 22:58:37] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 22:58:38] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-20 22:58:38] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:58:38] [INFO ] [Real]Added 3604 Read/Feed constraints in 243 ms returned sat
[2024-05-20 22:58:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:58:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 22:58:38] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 22:58:39] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2024-05-20 22:58:39] [INFO ] [Nat]Added 3604 Read/Feed constraints in 384 ms returned sat
[2024-05-20 22:58:39] [INFO ] Computed and/alt/rep : 2620/6956/2620 causal constraints (skipped 1044 transitions) in 174 ms.
[2024-05-20 22:58:40] [INFO ] Added : 13 causal constraints over 3 iterations in 791 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 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 66 ms. Remains 1082 /1082 variables (removed 0) and now considering 3694/3694 (removed 0) transitions.
[2024-05-20 22:58:45] [INFO ] Invariant cache hit.
[2024-05-20 22:58:46] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-20 22:58:46] [INFO ] Invariant cache hit.
[2024-05-20 22:58:46] [INFO ] State equation strengthened by 3604 read => feed constraints.
[2024-05-20 22:59:04] [INFO ] Implicit Places using invariants and state equation in 18534 ms returned []
Implicit Place search using SMT with State Equation took 19442 ms to find 0 implicit places.
[2024-05-20 22:59:04] [INFO ] Redundant transitions in 104 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 22:59:04] [INFO ] Invariant cache hit.
[2024-05-20 22:59:04] [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 1.0)
(s195 0.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 1.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 0.0)
(s256 0.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 1.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 1.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 1.0)
(s346 1.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 1.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 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 1.0)
(s407 0.0)
(s408 0.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 1.0)
(s436 1.0)
(s437 0.0)
(s438 0.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 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.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 1.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 1.0)
(s525 1.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)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 32617ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52272 ms. Remains : 1082/1082 places, 3694/3694 transitions.
[2024-05-20 22:59:37] [INFO ] Flatten gal took : 93 ms
[2024-05-20 22:59:37] [INFO ] Flatten gal took : 63 ms
[2024-05-20 22:59:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2534449753433439455.gal : 12 ms
[2024-05-20 22:59:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6711756875505400228.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2534449753433439455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6711756875505400228.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (286 resets) in 628 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 54 ms. (727 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
Loading property file /tmp/ReachabilityCardinality6711756875505400228.prop.
Interrupted probabilistic random walk after 180382 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 180382 steps, saw 32375 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-20 22:59:40] [INFO ] Invariant cache hit.
[2024-05-20 22:59:40] [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-20 22:59:40] [INFO ] Deduced a trap composed of 2 places in 44 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-20 22:59:41] [INFO ] Deduced a trap composed of 37 places in 662 ms of which 7 ms to minimize.
[2024-05-20 22:59:42] [INFO ] Deduced a trap composed of 38 places in 632 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 22:59:42] [INFO ] Deduced a trap composed of 38 places in 643 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
[2024-05-20 22:59:43] [INFO ] Deduced a trap composed of 46 places in 610 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 22:59:44] [INFO ] Deduced a trap composed of 45 places in 630 ms of which 6 ms to minimize.
[2024-05-20 22:59:44] [INFO ] Deduced a trap composed of 49 places in 618 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2123
[2024-05-20 22:59:45] [INFO ] Deduced a trap composed of 70 places in 619 ms of which 7 ms to minimize.
[2024-05-20 22:59:46] [INFO ] Deduced a trap composed of 52 places in 583 ms of which 6 ms to minimize.
SMT process timed out in 5516ms, 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 (284 resets) in 552 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2123 after 2503
Interrupted probabilistic random walk after 200838 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200838 steps, saw 34800 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-20 22:59:49] [INFO ] Invariant cache hit.
[2024-05-20 22:59: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-20 22:59:49] [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-20 22:59:50] [INFO ] Deduced a trap composed of 38 places in 661 ms of which 7 ms to minimize.
[2024-05-20 22:59:51] [INFO ] Deduced a trap composed of 37 places in 644 ms of which 7 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 2776 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-20 22:59:52] [INFO ] Deduced a trap composed of 2 places in 44 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-20 22:59:53] [INFO ] Deduced a trap composed of 41 places in 670 ms of which 6 ms to minimize.
[2024-05-20 22:59:53] [INFO ] Deduced a trap composed of 43 places in 653 ms of which 7 ms to minimize.
[2024-05-20 22:59:54] [INFO ] Deduced a trap composed of 40 places in 652 ms of which 7 ms to minimize.
[2024-05-20 22:59:55] [INFO ] Deduced a trap composed of 46 places in 593 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2503 after 3060
[2024-05-20 22:59:55] [INFO ] Deduced a trap composed of 38 places in 652 ms of which 7 ms to minimize.
[2024-05-20 22:59:56] [INFO ] Deduced a trap composed of 52 places in 636 ms of which 6 ms to minimize.
[2024-05-20 22:59:57] [INFO ] Deduced a trap composed of 43 places in 608 ms of which 6 ms to minimize.
[2024-05-20 22:59:57] [INFO ] Deduced a trap composed of 45 places in 610 ms of which 6 ms to minimize.
[2024-05-20 22:59:58] [INFO ] Deduced a trap composed of 43 places in 607 ms of which 7 ms to minimize.
[2024-05-20 22:59:58] [INFO ] Deduced a trap composed of 44 places in 600 ms of which 6 ms to minimize.
[2024-05-20 22:59:59] [INFO ] Deduced a trap composed of 42 places in 592 ms of which 6 ms to minimize.
[2024-05-20 23:00:00] [INFO ] Deduced a trap composed of 43 places in 596 ms of which 7 ms to minimize.
[2024-05-20 23:00:00] [INFO ] Deduced a trap composed of 46 places in 609 ms of which 7 ms to minimize.
[2024-05-20 23:00:01] [INFO ] Deduced a trap composed of 45 places in 571 ms of which 7 ms to minimize.
[2024-05-20 23:00:01] [INFO ] Deduced a trap composed of 44 places in 599 ms of which 6 ms to minimize.
[2024-05-20 23:00:02] [INFO ] Deduced a trap composed of 42 places in 600 ms of which 6 ms to minimize.
[2024-05-20 23:00:03] [INFO ] Deduced a trap composed of 42 places in 596 ms of which 6 ms to minimize.
[2024-05-20 23:00:03] [INFO ] Deduced a trap composed of 39 places in 600 ms of which 6 ms to minimize.
[2024-05-20 23:00:04] [INFO ] Deduced a trap composed of 48 places in 570 ms of which 6 ms to minimize.
[2024-05-20 23:00:05] [INFO ] Deduced a trap composed of 46 places in 574 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-20 23:00:05] [INFO ] Deduced a trap composed of 46 places in 605 ms of which 6 ms to minimize.
[2024-05-20 23:00:06] [INFO ] Deduced a trap composed of 45 places in 540 ms of which 5 ms to minimize.
[2024-05-20 23:00:06] [INFO ] Deduced a trap composed of 45 places in 509 ms of which 5 ms to minimize.
[2024-05-20 23:00:07] [INFO ] Deduced a trap composed of 42 places in 512 ms of which 5 ms to minimize.
[2024-05-20 23:00:07] [INFO ] Deduced a trap composed of 47 places in 512 ms of which 5 ms to minimize.
[2024-05-20 23:00:08] [INFO ] Deduced a trap composed of 46 places in 512 ms of which 5 ms to minimize.
[2024-05-20 23:00:08] [INFO ] Deduced a trap composed of 47 places in 462 ms of which 5 ms to minimize.
[2024-05-20 23:00:09] [INFO ] Deduced a trap composed of 46 places in 477 ms of which 5 ms to minimize.
[2024-05-20 23:00:09] [INFO ] Deduced a trap composed of 47 places in 481 ms of which 5 ms to minimize.
[2024-05-20 23:00:10] [INFO ] Deduced a trap composed of 45 places in 466 ms of which 5 ms to minimize.
[2024-05-20 23:00:10] [INFO ] Deduced a trap composed of 41 places in 466 ms of which 5 ms to minimize.
[2024-05-20 23:00:11] [INFO ] Deduced a trap composed of 40 places in 469 ms of which 5 ms to minimize.
[2024-05-20 23:00:11] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 6 ms to minimize.
[2024-05-20 23:00:12] [INFO ] Deduced a trap composed of 45 places in 480 ms of which 5 ms to minimize.
[2024-05-20 23:00:12] [INFO ] Deduced a trap composed of 45 places in 483 ms of which 5 ms to minimize.
[2024-05-20 23:00:13] [INFO ] Deduced a trap composed of 45 places in 480 ms of which 5 ms to minimize.
[2024-05-20 23:00:13] [INFO ] Deduced a trap composed of 35 places in 439 ms of which 4 ms to minimize.
[2024-05-20 23:00:14] [INFO ] Deduced a trap composed of 44 places in 423 ms of which 5 ms to minimize.
[2024-05-20 23:00:14] [INFO ] Deduced a trap composed of 39 places in 415 ms of which 4 ms to minimize.
[2024-05-20 23:00:14] [INFO ] Deduced a trap composed of 41 places in 378 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-20 23:00:15] [INFO ] Deduced a trap composed of 56 places in 366 ms of which 4 ms to minimize.
[2024-05-20 23:00:15] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 4 ms to minimize.
[2024-05-20 23:00:16] [INFO ] Deduced a trap composed of 38 places in 366 ms of which 4 ms to minimize.
[2024-05-20 23:00:16] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 4 ms to minimize.
[2024-05-20 23:00:16] [INFO ] Deduced a trap composed of 41 places in 325 ms of which 4 ms to minimize.
[2024-05-20 23:00:17] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 4 ms to minimize.
[2024-05-20 23:00:17] [INFO ] Deduced a trap composed of 43 places in 334 ms of which 4 ms to minimize.
[2024-05-20 23:00:17] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 3 ms to minimize.
[2024-05-20 23:00:18] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 4 ms to minimize.
[2024-05-20 23:00:18] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 3 ms to minimize.
[2024-05-20 23:00:18] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 4 ms to minimize.
[2024-05-20 23:00:19] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 4 ms to minimize.
[2024-05-20 23:00:19] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 3 ms to minimize.
[2024-05-20 23:00:19] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 4 ms to minimize.
[2024-05-20 23:00:20] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 3 ms to minimize.
[2024-05-20 23:00:20] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 3 ms to minimize.
[2024-05-20 23:00:20] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 3 ms to minimize.
[2024-05-20 23:00:20] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-05-20 23:00:21] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 3 ms to minimize.
[2024-05-20 23:00:21] [INFO ] Deduced a trap composed of 48 places in 231 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-20 23:00:21] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-05-20 23:00:21] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-05-20 23:00:22] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2024-05-20 23:00:22] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 3 ms to minimize.
[2024-05-20 23:00:22] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 3 ms to minimize.
[2024-05-20 23:00:22] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-05-20 23:00:22] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 2 ms to minimize.
[2024-05-20 23:00:23] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 2 ms to minimize.
[2024-05-20 23:00:23] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 3 ms to minimize.
[2024-05-20 23:00:23] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-05-20 23:00:23] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-20 23:00:24] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-20 23:00:24] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-05-20 23:00:24] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-05-20 23:00:24] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2024-05-20 23:00:24] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-05-20 23:00:24] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 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-20 23:00:25] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:00:25] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-20 23:00:26] [INFO ] Deduced a trap composed of 47 places in 109 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
Detected timeout of ITS tools.
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
[2024-05-20 23:00:27] [INFO ] Flatten gal took : 67 ms
[2024-05-20 23:00:27] [INFO ] Applying decomposition
[2024-05-20 23:00:27] [INFO ] Flatten gal took : 69 ms
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.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2331878844256764165.txt' '-o' '/tmp/graph2331878844256764165.bin' '-w' '/tmp/graph2331878844256764165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2331878844256764165.bin' '-l' '-1' '-v' '-w' '/tmp/graph2331878844256764165.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:00:27] [INFO ] Decomposing Gal with order
[2024-05-20 23:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
After SMT solving in domain Int declared 4776/4776 variables, and 4809 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35730 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 38541ms 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 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 66 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-20 23:00:28] [INFO ] Invariant cache hit.
[2024-05-20 23:00:28] [INFO ] Removed a total of 2820 redundant transitions.
[2024-05-20 23:00:28] [INFO ] Flatten gal took : 163 ms
[2024-05-20 23:00:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 3224 labels/synchronizations in 86 ms.
[2024-05-20 23:00:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7424309007966676807.gal : 22 ms
[2024-05-20 23:00:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9057527525283228686.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7424309007966676807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9057527525283228686.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9057527525283228686.prop.
[2024-05-20 23:00:28] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-20 23:00:28] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 114
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114 after 14402
[2024-05-20 23:00:29] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14402 after 903415
[2024-05-20 23:00:49] [INFO ] Implicit Places using invariants and state equation in 20177 ms returned []
Implicit Place search using SMT with State Equation took 21064 ms to find 0 implicit places.
[2024-05-20 23:00:49] [INFO ] Redundant transitions in 105 ms returned []
Running 3664 sub problems to find dead transitions.
[2024-05-20 23:00:49] [INFO ] Invariant cache hit.
[2024-05-20 23:00:49] [INFO ] State equation strengthened by 3604 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :903415 after 3.32377e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.32377e+07 after 3.98893e+07
Detected timeout of ITS tools.
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 32548ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 32582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53829 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-14 in 177676 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-20 23:01:21] [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 104 ms. (95 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 23:01:22] [INFO ] Invariant cache hit.
[2024-05-20 23:01:22] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 23:01:22] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 23:01:22] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2024-05-20 23:01:22] [INFO ] State equation strengthened by 3582 read => feed constraints.
[2024-05-20 23:01:23] [INFO ] [Real]Added 3582 Read/Feed constraints in 297 ms returned sat
[2024-05-20 23:01:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:01:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-20 23:01:23] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 23:01:24] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2024-05-20 23:01:24] [INFO ] [Nat]Added 3582 Read/Feed constraints in 309 ms returned sat
[2024-05-20 23:01:24] [INFO ] Computed and/alt/rep : 2628/6928/2628 causal constraints (skipped 1044 transitions) in 221 ms.
[2024-05-20 23:01:25] [INFO ] Added : 9 causal constraints over 2 iterations in 731 ms. Result :sat
Minimization took 941 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 251 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 252 ms. Remains : 1083/1090 places, 3695/3702 transitions.
// Phase 1: matrix 3695 rows 1083 cols
[2024-05-20 23:01:26] [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 (7162 resets) in 7936 ms. (125 steps per ms)
BEST_FIRST walk for 1000001 steps (206 resets) in 934 ms. (1069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[30]
[2024-05-20 23:01:35] [INFO ] Invariant cache hit.
[2024-05-20 23:01:35] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-20 23:01:35] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 23:01:36] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-05-20 23:01:36] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 23:01:36] [INFO ] [Real]Added 3603 Read/Feed constraints in 273 ms returned sat
[2024-05-20 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:01:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-20 23:01:36] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 23:01:37] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-20 23:01:37] [INFO ] [Nat]Added 3603 Read/Feed constraints in 303 ms returned sat
[2024-05-20 23:01:37] [INFO ] Computed and/alt/rep : 2621/6954/2621 causal constraints (skipped 1044 transitions) in 171 ms.
[2024-05-20 23:01:38] [INFO ] Added : 8 causal constraints over 2 iterations in 656 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 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 23:01:42] [INFO ] Invariant cache hit.
[2024-05-20 23:01:43] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-20 23:01:43] [INFO ] Invariant cache hit.
[2024-05-20 23:01:44] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 23:02:04] [INFO ] Implicit Places using invariants and state equation in 20889 ms returned []
Implicit Place search using SMT with State Equation took 21801 ms to find 0 implicit places.
[2024-05-20 23:02:04] [INFO ] Redundant transitions in 105 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 23:02:04] [INFO ] Invariant cache hit.
[2024-05-20 23:02:04] [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 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 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 1.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 0.0)
(s406 0.0)
(s407 0.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 1.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 1.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 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 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 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 1.0)
(s678 1.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 1.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 1.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 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 0.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 1.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 0.0)timeout
(s860 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 32354ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54363 ms. Remains : 1083/1083 places, 3695/3695 transitions.
[2024-05-20 23:02:37] [INFO ] Flatten gal took : 99 ms
[2024-05-20 23:02:37] [INFO ] Flatten gal took : 70 ms
RANDOM walk for 40000 steps (284 resets) in 599 ms. (66 steps per ms) remains 2/2 properties
[2024-05-20 23:02:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2733472011635422219.gal : 12 ms
[2024-05-20 23:02:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11013913600751370167.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2733472011635422219.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11013913600751370167.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11013913600751370167.prop.
Interrupted probabilistic random walk after 181845 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 181845 steps, saw 32817 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-20 23:02:40] [INFO ] Invariant cache hit.
[2024-05-20 23:02: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-20 23:02:40] [INFO ] Deduced a trap composed of 2 places in 43 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-20 23:02:41] [INFO ] Deduced a trap composed of 52 places in 631 ms of which 7 ms to minimize.
[2024-05-20 23:02:42] [INFO ] Deduced a trap composed of 37 places in 577 ms of which 6 ms to minimize.
[2024-05-20 23:02:42] [INFO ] Deduced a trap composed of 40 places in 583 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 963
[2024-05-20 23:02:43] [INFO ] Deduced a trap composed of 42 places in 552 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :963 after 1043
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1367
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1367 after 1563
[2024-05-20 23:02:43] [INFO ] Deduced a trap composed of 42 places in 511 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1563 after 1719
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1719 after 1732
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1732 after 1772
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1772 after 1872
[2024-05-20 23:02:44] [INFO ] Deduced a trap composed of 39 places in 515 ms of which 5 ms to minimize.
[2024-05-20 23:02:44] [INFO ] Deduced a trap composed of 37 places in 497 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1872 after 2124
[2024-05-20 23:02:45] [INFO ] Deduced a trap composed of 47 places in 507 ms of which 5 ms to minimize.
[2024-05-20 23:02:45] [INFO ] Deduced a trap composed of 37 places in 480 ms of which 5 ms to minimize.
SMT process timed out in 5314ms, 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 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 64 ms. Remains : 1083/1083 places, 3695/3695 transitions.
RANDOM walk for 40000 steps (284 resets) in 514 ms. (77 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
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2124 after 2504
Interrupted probabilistic random walk after 201117 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 201117 steps, saw 35130 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-20 23:02:49] [INFO ] Invariant cache hit.
[2024-05-20 23:02:49] [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-20 23:02:49] [INFO ] Deduced a trap composed of 2 places in 40 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-20 23:02:49] [INFO ] Deduced a trap composed of 35 places in 566 ms of which 6 ms to minimize.
[2024-05-20 23:02:50] [INFO ] Deduced a trap composed of 34 places in 531 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 2589 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-20 23:02:51] [INFO ] Deduced a trap composed of 2 places in 45 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-20 23:02:52] [INFO ] Deduced a trap composed of 60 places in 586 ms of which 5 ms to minimize.
[2024-05-20 23:02:53] [INFO ] Deduced a trap composed of 37 places in 546 ms of which 6 ms to minimize.
[2024-05-20 23:02:53] [INFO ] Deduced a trap composed of 35 places in 55 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
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2504 after 3061
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 3747 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 6398ms 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 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 64 ms. Remains 1083 /1083 variables (removed 0) and now considering 3695/3695 (removed 0) transitions.
[2024-05-20 23:02:55] [INFO ] Invariant cache hit.
[2024-05-20 23:02:56] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-20 23:02:56] [INFO ] Invariant cache hit.
[2024-05-20 23:02:57] [INFO ] State equation strengthened by 3603 read => feed constraints.
[2024-05-20 23:03:16] [INFO ] Implicit Places using invariants and state equation in 20254 ms returned []
Implicit Place search using SMT with State Equation took 21144 ms to find 0 implicit places.
[2024-05-20 23:03:16] [INFO ] Redundant transitions in 105 ms returned []
Running 3665 sub problems to find dead transitions.
[2024-05-20 23:03:16] [INFO ] Invariant cache hit.
[2024-05-20 23:03:16] [INFO ] State equation strengthened by 3603 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-20 23:03:27] [INFO ] Flatten gal took : 73 ms
[2024-05-20 23:03:27] [INFO ] Applying decomposition
[2024-05-20 23:03:27] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13672718175860949023.txt' '-o' '/tmp/graph13672718175860949023.bin' '-w' '/tmp/graph13672718175860949023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13672718175860949023.bin' '-l' '-1' '-v' '-w' '/tmp/graph13672718175860949023.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:03:27] [INFO ] Decomposing Gal with order
[2024-05-20 23:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:03:28] [INFO ] Removed a total of 2824 redundant transitions.
[2024-05-20 23:03:28] [INFO ] Flatten gal took : 186 ms
[2024-05-20 23:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 3452 labels/synchronizations in 89 ms.
[2024-05-20 23:03:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5043237550335555715.gal : 22 ms
[2024-05-20 23:03:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13823203512281178734.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5043237550335555715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13823203512281178734.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13823203512281178734.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 69
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :69 after 69
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :69 after 84
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84 after 2854
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2854 after 137107
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :137107 after 317987
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :317987 after 7.88634e+06
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 32235ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 32261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53582 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-20 23:03:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 23:03:49] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 23:03:49] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 23:03:49] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 23:03:49] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 23:03:49] [INFO ] Flatten gal took : 1 ms
[2024-05-20 23:03:49] [INFO ] Flatten gal took : 0 ms
[2024-05-20 23:03:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17738900674768185175.gal : 0 ms
[2024-05-20 23:03:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5086160749005323606.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17738900674768185175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5086160749005323606.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5086160749005323606.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001625,3520,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.001885,3896,2,5,6,33,7,0,24,18,0
Over-approximation ignoring read arcs solved 0 properties in 71 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
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 147405 ms.
[2024-05-20 23:03:49] [INFO ] Flatten gal took : 54 ms
[2024-05-20 23:03:49] [INFO ] Applying decomposition
[2024-05-20 23:03:49] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3770838440085278555.txt' '-o' '/tmp/graph3770838440085278555.bin' '-w' '/tmp/graph3770838440085278555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3770838440085278555.bin' '-l' '-1' '-v' '-w' '/tmp/graph3770838440085278555.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:03:49] [INFO ] Decomposing Gal with order
[2024-05-20 23:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:03:49] [INFO ] Removed a total of 2805 redundant transitions.
[2024-05-20 23:03:49] [INFO ] Flatten gal took : 160 ms
[2024-05-20 23:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3049 labels/synchronizations in 84 ms.
[2024-05-20 23:03:49] [INFO ] Time to serialize gal into /tmp/UpperBounds10587103076658270089.gal : 23 ms
[2024-05-20 23:03:49] [INFO ] Time to serialize properties into /tmp/UpperBounds10032214255988871632.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10587103076658270089.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10032214255988871632.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds10032214255988871632.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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 itstools"
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 r070-tall-171620505200117"
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 ;