About the Execution of ITS-Tools for FunctionPointer-PT-c064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 0 0 0 ? 0 0 1 0 64 ? 0 ? ? ? ? ? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007500157.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FunctionPointer-PT-c064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007500157
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c064-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748881519066
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 16:25:20] [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]
[2025-06-02 16:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:25:21] [INFO ] Load time of PNML (sax parser for PT used): 774 ms
[2025-06-02 16:25:21] [INFO ] Transformed 2826 places.
[2025-06-02 16:25:22] [INFO ] Transformed 8960 transitions.
[2025-06-02 16:25:22] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1001 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 1198 places in 66 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:25:22] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2025-06-02 16:25:22] [INFO ] Computed 4 invariants in 152 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10040 steps (2 resets) in 268 ms. (37 steps per ms)
FORMULA FunctionPointer-PT-c064-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (34 resets) in 415 ms. (216 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 1, 0, 2, 1] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:25:23] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2025-06-02 16:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2025-06-02 16:25:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:25:25] [INFO ] [Real]Absence check using state equation in 1594 ms returned sat
[2025-06-02 16:25:25] [INFO ] State equation strengthened by 479 read => feed constraints.
[2025-06-02 16:25:26] [INFO ] [Real]Added 479 Read/Feed constraints in 275 ms returned sat
[2025-06-02 16:25:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2025-06-02 16:25:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:25:28] [INFO ] [Nat]Absence check using state equation in 1295 ms returned sat
[2025-06-02 16:25:28] [INFO ] [Nat]Added 479 Read/Feed constraints in 191 ms returned sat
[2025-06-02 16:25:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1268 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:33] [INFO ] Deduced a trap composed of 133 places in 2720 ms of which 325 ms to minimize.
[2025-06-02 16:25:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:33] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:25:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:25:34] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2025-06-02 16:25:35] [INFO ] [Real]Added 479 Read/Feed constraints in 275 ms returned sat
[2025-06-02 16:25:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2025-06-02 16:25:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:25:37] [INFO ] [Nat]Absence check using state equation in 1456 ms returned sat
[2025-06-02 16:25:37] [INFO ] [Nat]Added 479 Read/Feed constraints in 424 ms returned sat
[2025-06-02 16:25:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1360 ms.
[2025-06-02 16:25:39] [INFO ] Added : 3 causal constraints over 1 iterations in 2013 ms. Result :sat
Minimization took 603 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:40] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:25:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:25:41] [INFO ] [Real]Absence check using state equation in 1381 ms returned sat
[2025-06-02 16:25:42] [INFO ] [Real]Added 479 Read/Feed constraints in 248 ms returned sat
[2025-06-02 16:25:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2025-06-02 16:25:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:25:44] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2025-06-02 16:25:44] [INFO ] [Nat]Added 479 Read/Feed constraints in 266 ms returned sat
[2025-06-02 16:25:45] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 713 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:48] [INFO ] Deduced a trap composed of 133 places in 2845 ms of which 322 ms to minimize.
[2025-06-02 16:25:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:48] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 16:25:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:25:50] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2025-06-02 16:25:50] [INFO ] [Real]Added 479 Read/Feed constraints in 298 ms returned sat
[2025-06-02 16:25:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:25:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:25:52] [INFO ] [Nat]Absence check using state equation in 1304 ms returned sat
[2025-06-02 16:25:52] [INFO ] [Nat]Added 479 Read/Feed constraints in 165 ms returned sat
[2025-06-02 16:25:53] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 686 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:56] [INFO ] Deduced a trap composed of 133 places in 2771 ms of which 327 ms to minimize.
[2025-06-02 16:25:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:56] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:25:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:25:58] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2025-06-02 16:25:58] [INFO ] [Real]Added 479 Read/Feed constraints in 178 ms returned sat
[2025-06-02 16:25:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:25:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2025-06-02 16:25:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:00] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2025-06-02 16:26:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 251 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:03] [INFO ] Deduced a trap composed of 133 places in 2739 ms of which 323 ms to minimize.
[2025-06-02 16:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3018 ms
[2025-06-02 16:26:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:957)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:26:03] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 16:26:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:05] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2025-06-02 16:26:05] [INFO ] [Real]Added 479 Read/Feed constraints in 254 ms returned sat
[2025-06-02 16:26:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:26:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:26:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:07] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2025-06-02 16:26:07] [INFO ] [Nat]Added 479 Read/Feed constraints in 135 ms returned sat
[2025-06-02 16:26:08] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 687 ms.
[2025-06-02 16:26:08] [INFO ] Added : 1 causal constraints over 1 iterations in 1142 ms. Result :sat
Minimization took 586 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:26:09] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:26:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:26:10] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2025-06-02 16:26:11] [INFO ] [Real]Added 479 Read/Feed constraints in 292 ms returned sat
[2025-06-02 16:26:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:26:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2025-06-02 16:26:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:26:12] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2025-06-02 16:26:13] [INFO ] [Nat]Added 479 Read/Feed constraints in 273 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:15] [INFO ] Deduced a trap composed of 133 places in 2660 ms of which 320 ms to minimize.
[2025-06-02 16:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2912 ms
[2025-06-02 16:26:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:957)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:26:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:17] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2025-06-02 16:26:18] [INFO ] [Real]Added 479 Read/Feed constraints in 215 ms returned sat
[2025-06-02 16:26:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:26:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 16:26:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:20] [INFO ] [Nat]Absence check using state equation in 1316 ms returned sat
[2025-06-02 16:26:20] [INFO ] [Nat]Added 479 Read/Feed constraints in 200 ms returned sat
[2025-06-02 16:26:21] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1415 ms.
[2025-06-02 16:26:22] [INFO ] Added : 1 causal constraints over 1 iterations in 2019 ms. Result :sat
Minimization took 588 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 1, 0, 2, 1] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 1, 0, 2, 1] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.27 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 677 place count 1124 transition count 3296
Iterating global reduction 1 with 298 rules applied. Total rules applied 975 place count 1124 transition count 3296
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 1323 place count 1124 transition count 2948
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1477 place count 970 transition count 2640
Iterating global reduction 2 with 154 rules applied. Total rules applied 1631 place count 970 transition count 2640
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1691 place count 970 transition count 2580
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1705 place count 956 transition count 2552
Iterating global reduction 3 with 14 rules applied. Total rules applied 1719 place count 956 transition count 2552
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1733 place count 942 transition count 2524
Iterating global reduction 3 with 14 rules applied. Total rules applied 1747 place count 942 transition count 2524
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1761 place count 928 transition count 2496
Iterating global reduction 3 with 14 rules applied. Total rules applied 1775 place count 928 transition count 2496
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1789 place count 914 transition count 2468
Iterating global reduction 3 with 14 rules applied. Total rules applied 1803 place count 914 transition count 2468
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1817 place count 900 transition count 2440
Iterating global reduction 3 with 14 rules applied. Total rules applied 1831 place count 900 transition count 2440
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1844 place count 887 transition count 2414
Iterating global reduction 3 with 13 rules applied. Total rules applied 1857 place count 887 transition count 2414
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1869 place count 875 transition count 2390
Iterating global reduction 3 with 12 rules applied. Total rules applied 1881 place count 875 transition count 2390
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1933 place count 823 transition count 2194
Iterating global reduction 3 with 52 rules applied. Total rules applied 1985 place count 823 transition count 2194
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2043 place count 765 transition count 1962
Iterating global reduction 3 with 58 rules applied. Total rules applied 2101 place count 765 transition count 1962
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2159 place count 707 transition count 1822
Iterating global reduction 3 with 58 rules applied. Total rules applied 2217 place count 707 transition count 1822
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2275 place count 649 transition count 1706
Iterating global reduction 3 with 58 rules applied. Total rules applied 2333 place count 649 transition count 1706
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2391 place count 591 transition count 1590
Iterating global reduction 3 with 58 rules applied. Total rules applied 2449 place count 591 transition count 1590
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2507 place count 533 transition count 1474
Iterating global reduction 3 with 58 rules applied. Total rules applied 2565 place count 533 transition count 1474
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2621 place count 477 transition count 1362
Iterating global reduction 3 with 56 rules applied. Total rules applied 2677 place count 477 transition count 1362
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2689 place count 465 transition count 1338
Iterating global reduction 3 with 12 rules applied. Total rules applied 2701 place count 465 transition count 1338
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 2713 place count 465 transition count 1326
Applied a total of 2713 rules in 1643 ms. Remains 465 /1628 variables (removed 1163) and now considering 1326/5962 (removed 4636) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1656 ms. Remains : 465/1628 places, 1326/5962 transitions.
[2025-06-02 16:26:24] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 8) seen :[1, 1, 1, 2, 2, 3, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 1, 2, 2, 3, 2, 3] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:26:25] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 16:26:25] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 2, 2, 3, 2, 3] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 4577 ms. (218 steps per ms)
BEST_FIRST walk for 8000008 steps (19 resets) in 16269 ms. (491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[68, 4, 62, 238, 9, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:26:46] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:46] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:46] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-06-02 16:26:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:26:46] [INFO ] [Real]Added 94 Read/Feed constraints in 70 ms returned sat
[2025-06-02 16:26:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:47] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-06-02 16:26:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:26:47] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:26:47] [INFO ] Added : 19 causal constraints over 6 iterations in 454 ms. Result :sat
Minimization took 612 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:48] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:26:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:48] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2025-06-02 16:26:48] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:26:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:49] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-02 16:26:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 59 ms returned sat
[2025-06-02 16:26:49] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:26:49] [INFO ] Added : 1 causal constraints over 1 iterations in 227 ms. Result :sat
Minimization took 599 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:50] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:50] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-06-02 16:26:50] [INFO ] [Real]Added 94 Read/Feed constraints in 55 ms returned sat
[2025-06-02 16:26:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:51] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:26:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 50 ms returned sat
[2025-06-02 16:26:51] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 116 ms.
[2025-06-02 16:26:51] [INFO ] Added : 14 causal constraints over 4 iterations in 369 ms. Result :sat
Minimization took 598 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:52] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:26:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:52] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:26:52] [INFO ] [Real]Added 94 Read/Feed constraints in 49 ms returned sat
[2025-06-02 16:26:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:52] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-02 16:26:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:26:53] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:26:53] [INFO ] Added : 5 causal constraints over 2 iterations in 285 ms. Result :sat
Minimization took 561 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:54] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:54] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-06-02 16:26:54] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2025-06-02 16:26:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:54] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-02 16:26:54] [INFO ] [Nat]Added 94 Read/Feed constraints in 77 ms returned sat
[2025-06-02 16:26:55] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:26:55] [INFO ] Added : 2 causal constraints over 1 iterations in 226 ms. Result :sat
Minimization took 597 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:55] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:56] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:26:56] [INFO ] [Real]Added 94 Read/Feed constraints in 58 ms returned sat
[2025-06-02 16:26:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:56] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-06-02 16:26:56] [INFO ] [Nat]Added 94 Read/Feed constraints in 40 ms returned sat
[2025-06-02 16:26:56] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 115 ms.
[2025-06-02 16:26:56] [INFO ] Added : 1 causal constraints over 1 iterations in 225 ms. Result :sat
Minimization took 559 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:57] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:57] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 16:26:58] [INFO ] [Real]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:26:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:26:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:26:58] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:26:58] [INFO ] [Nat]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:26:58] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:26:58] [INFO ] Added : 7 causal constraints over 3 iterations in 308 ms. Result :sat
Minimization took 561 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:26:59] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:26:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-02 16:26:59] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-06-02 16:26:59] [INFO ] [Real]Added 94 Read/Feed constraints in 56 ms returned sat
[2025-06-02 16:26:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:27:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:27:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:27:00] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:27:00] [INFO ] [Nat]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:27:00] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 108 ms.
[2025-06-02 16:27:00] [INFO ] Added : 1 causal constraints over 1 iterations in 218 ms. Result :sat
Minimization took 564 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[68, 4, 62, 238, 9, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[68, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 72 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 72 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:27:02] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:03] [INFO ] Implicit Places using invariants in 729 ms returned []
[2025-06-02 16:27:03] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:27:03] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:27:08] [INFO ] Implicit Places using invariants and state equation in 4991 ms returned []
Implicit Place search using SMT with State Equation took 5723 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:27:08] [INFO ] Redundant transitions in 122 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:27:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:27:08] [INFO ] Invariant cache hit.
[2025-06-02 16:27:08] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31234 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63991ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 64025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69973 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-02 16:28:12] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :[2, 5, 2, 1, 1, 2, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[68, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:28:12] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:28:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[68, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 4439 ms. (225 steps per ms)
BEST_FIRST walk for 8000008 steps (19 resets) in 16317 ms. (490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[131, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:28:33] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:33] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:33] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-02 16:28:33] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:28:33] [INFO ] [Real]Added 94 Read/Feed constraints in 44 ms returned sat
[2025-06-02 16:28:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:34] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2025-06-02 16:28:34] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2025-06-02 16:28:34] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 136 ms.
[2025-06-02 16:28:34] [INFO ] Added : 19 causal constraints over 6 iterations in 486 ms. Result :sat
Minimization took 608 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:35] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:35] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:28:36] [INFO ] [Real]Added 94 Read/Feed constraints in 81 ms returned sat
[2025-06-02 16:28:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:28:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:36] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:28:36] [INFO ] [Nat]Added 94 Read/Feed constraints in 64 ms returned sat
[2025-06-02 16:28:36] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 126 ms.
[2025-06-02 16:28:36] [INFO ] Added : 1 causal constraints over 1 iterations in 244 ms. Result :sat
Minimization took 574 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:37] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:28:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:37] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:28:37] [INFO ] [Real]Added 94 Read/Feed constraints in 58 ms returned sat
[2025-06-02 16:28:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:28:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:38] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:28:38] [INFO ] [Nat]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:28:38] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:28:38] [INFO ] Added : 14 causal constraints over 4 iterations in 354 ms. Result :sat
Minimization took 573 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:39] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:28:39] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-02 16:28:39] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2025-06-02 16:28:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:40] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2025-06-02 16:28:40] [INFO ] [Nat]Added 94 Read/Feed constraints in 60 ms returned sat
[2025-06-02 16:28:40] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:28:40] [INFO ] Added : 5 causal constraints over 2 iterations in 292 ms. Result :sat
Minimization took 560 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:41] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:28:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:28:41] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:28:41] [INFO ] [Real]Added 94 Read/Feed constraints in 68 ms returned sat
[2025-06-02 16:28:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:42] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2025-06-02 16:28:42] [INFO ] [Nat]Added 94 Read/Feed constraints in 81 ms returned sat
[2025-06-02 16:28:42] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 112 ms.
[2025-06-02 16:28:42] [INFO ] Added : 2 causal constraints over 1 iterations in 230 ms. Result :sat
Minimization took 590 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:43] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:43] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:28:43] [INFO ] [Real]Added 94 Read/Feed constraints in 58 ms returned sat
[2025-06-02 16:28:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:28:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:43] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:28:44] [INFO ] [Nat]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:28:44] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:28:44] [INFO ] Added : 1 causal constraints over 1 iterations in 221 ms. Result :sat
Minimization took 561 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:44] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:28:45] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-06-02 16:28:45] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:28:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:45] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2025-06-02 16:28:45] [INFO ] [Nat]Added 94 Read/Feed constraints in 50 ms returned sat
[2025-06-02 16:28:45] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:28:46] [INFO ] Added : 7 causal constraints over 3 iterations in 313 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:46] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:28:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:47] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:28:47] [INFO ] [Real]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:28:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:28:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:28:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:28:47] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:28:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 44 ms returned sat
[2025-06-02 16:28:47] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:28:47] [INFO ] Added : 1 causal constraints over 1 iterations in 220 ms. Result :sat
Minimization took 567 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[131, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[131, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 73 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 74 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:28:49] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:50] [INFO ] Implicit Places using invariants in 653 ms returned []
[2025-06-02 16:28:50] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:28:55] [INFO ] Implicit Places using invariants and state equation in 5029 ms returned []
Implicit Place search using SMT with State Equation took 5704 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:28:55] [INFO ] Redundant transitions in 92 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:28:55] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:28:55] [INFO ] Invariant cache hit.
[2025-06-02 16:28:55] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 13.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.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 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63277ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 63283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69164 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-02 16:29:58] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :[2, 1, 2, 2, 1, 3, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[131, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:29:59] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:29:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[131, 63, 62, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4511 ms. (221 steps per ms)
BEST_FIRST walk for 8000008 steps (18 resets) in 16497 ms. (484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[131, 63, 94, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:30:20] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:20] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:20] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-06-02 16:30:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:30:20] [INFO ] [Real]Added 94 Read/Feed constraints in 50 ms returned sat
[2025-06-02 16:30:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:21] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-02 16:30:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 47 ms returned sat
[2025-06-02 16:30:21] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 107 ms.
[2025-06-02 16:30:21] [INFO ] Added : 19 causal constraints over 6 iterations in 452 ms. Result :sat
Minimization took 605 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:22] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:22] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2025-06-02 16:30:22] [INFO ] [Real]Added 94 Read/Feed constraints in 83 ms returned sat
[2025-06-02 16:30:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:23] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-06-02 16:30:23] [INFO ] [Nat]Added 94 Read/Feed constraints in 65 ms returned sat
[2025-06-02 16:30:23] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 108 ms.
[2025-06-02 16:30:23] [INFO ] Added : 1 causal constraints over 1 iterations in 220 ms. Result :sat
Minimization took 593 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:24] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:24] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:30:24] [INFO ] [Real]Added 94 Read/Feed constraints in 54 ms returned sat
[2025-06-02 16:30:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:25] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-02 16:30:25] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:30:25] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:30:25] [INFO ] Added : 6 causal constraints over 4 iterations in 338 ms. Result :sat
Minimization took 563 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:26] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:26] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-06-02 16:30:26] [INFO ] [Real]Added 94 Read/Feed constraints in 49 ms returned sat
[2025-06-02 16:30:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:26] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-02 16:30:26] [INFO ] [Nat]Added 94 Read/Feed constraints in 50 ms returned sat
[2025-06-02 16:30:27] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:30:27] [INFO ] Added : 5 causal constraints over 2 iterations in 287 ms. Result :sat
Minimization took 561 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:27] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:28] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-06-02 16:30:28] [INFO ] [Real]Added 94 Read/Feed constraints in 69 ms returned sat
[2025-06-02 16:30:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:28] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:30:28] [INFO ] [Nat]Added 94 Read/Feed constraints in 79 ms returned sat
[2025-06-02 16:30:28] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:30:29] [INFO ] Added : 2 causal constraints over 1 iterations in 229 ms. Result :sat
Minimization took 590 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:29] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:30:30] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 16:30:30] [INFO ] [Real]Added 94 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:30:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:30] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:30:30] [INFO ] [Nat]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:30:30] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:30:30] [INFO ] Added : 1 causal constraints over 1 iterations in 221 ms. Result :sat
Minimization took 565 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:31] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:31] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:30:31] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:30:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:32] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:30:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:30:32] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:30:32] [INFO ] Added : 7 causal constraints over 3 iterations in 314 ms. Result :sat
Minimization took 561 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:33] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:30:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:33] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 16:30:33] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:30:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:30:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:30:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:30:34] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:30:34] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2025-06-02 16:30:34] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:30:34] [INFO ] Added : 1 causal constraints over 1 iterations in 222 ms. Result :sat
Minimization took 559 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[131, 63, 94, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[131, 63, 94, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 76 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 71 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:30:36] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:30:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:30:36] [INFO ] Implicit Places using invariants in 744 ms returned []
[2025-06-02 16:30:36] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:30:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:30:37] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:30:42] [INFO ] Implicit Places using invariants and state equation in 5128 ms returned []
Implicit Place search using SMT with State Equation took 5874 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:30:42] [INFO ] Redundant transitions in 44 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:30:42] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:30:42] [INFO ] Invariant cache hit.
[2025-06-02 16:30:42] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63284ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 63288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69286 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-02 16:31:45] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :[3, 0, 1, 0, 0, 2, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[131, 63, 94, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:31:45] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:31:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[131, 63, 94, 238, 63, 186, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4363 ms. (229 steps per ms)
BEST_FIRST walk for 8000008 steps (21 resets) in 16377 ms. (488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[131, 63, 94, 238, 63, 187, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:32:06] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:32:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:06] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:32:07] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2025-06-02 16:32:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:32:07] [INFO ] [Real]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:32:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:07] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:32:07] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2025-06-02 16:32:07] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 116 ms.
[2025-06-02 16:32:08] [INFO ] Added : 19 causal constraints over 6 iterations in 469 ms. Result :sat
Minimization took 602 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:08] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:32:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:09] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-02 16:32:09] [INFO ] [Real]Added 94 Read/Feed constraints in 86 ms returned sat
[2025-06-02 16:32:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:32:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:09] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:32:09] [INFO ] [Nat]Added 94 Read/Feed constraints in 67 ms returned sat
[2025-06-02 16:32:09] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:32:10] [INFO ] Added : 1 causal constraints over 1 iterations in 227 ms. Result :sat
Minimization took 572 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:10] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:11] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-06-02 16:32:11] [INFO ] [Real]Added 94 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:32:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:32:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:11] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-06-02 16:32:11] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:32:11] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 101 ms.
[2025-06-02 16:32:12] [INFO ] Added : 6 causal constraints over 4 iterations in 341 ms. Result :sat
Minimization took 563 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:12] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-02 16:32:13] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-06-02 16:32:13] [INFO ] [Real]Added 94 Read/Feed constraints in 50 ms returned sat
[2025-06-02 16:32:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:32:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:13] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:32:13] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2025-06-02 16:32:13] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:32:13] [INFO ] Added : 5 causal constraints over 2 iterations in 291 ms. Result :sat
Minimization took 555 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:14] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:14] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:32:14] [INFO ] [Real]Added 94 Read/Feed constraints in 64 ms returned sat
[2025-06-02 16:32:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:32:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:15] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:32:15] [INFO ] [Nat]Added 94 Read/Feed constraints in 79 ms returned sat
[2025-06-02 16:32:15] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 108 ms.
[2025-06-02 16:32:15] [INFO ] Added : 2 causal constraints over 1 iterations in 226 ms. Result :sat
Minimization took 588 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:16] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:16] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-02 16:32:16] [INFO ] [Real]Added 94 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:32:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:17] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-02 16:32:17] [INFO ] [Nat]Added 94 Read/Feed constraints in 42 ms returned sat
[2025-06-02 16:32:17] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:32:17] [INFO ] Added : 1 causal constraints over 1 iterations in 224 ms. Result :sat
Minimization took 554 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:18] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:18] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 16:32:18] [INFO ] [Real]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:32:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:18] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2025-06-02 16:32:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:32:19] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 112 ms.
[2025-06-02 16:32:19] [INFO ] Added : 7 causal constraints over 3 iterations in 322 ms. Result :sat
Minimization took 559 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:20] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:32:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:20] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-06-02 16:32:20] [INFO ] [Real]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:32:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:32:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:32:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:32:20] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:32:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 44 ms returned sat
[2025-06-02 16:32:21] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 115 ms.
[2025-06-02 16:32:21] [INFO ] Added : 1 causal constraints over 1 iterations in 228 ms. Result :sat
Minimization took 573 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[131, 63, 94, 238, 63, 187, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[131, 63, 94, 238, 63, 187, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 70 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 70 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:32:22] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:23] [INFO ] Implicit Places using invariants in 732 ms returned []
[2025-06-02 16:32:23] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:32:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:32:28] [INFO ] Implicit Places using invariants and state equation in 5138 ms returned []
Implicit Place search using SMT with State Equation took 5872 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:32:28] [INFO ] Redundant transitions in 36 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:32:28] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:32:28] [INFO ] Invariant cache hit.
[2025-06-02 16:32:28] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63340ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 63344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69331 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-02 16:33:32] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :[2, 3, 2, 2, 1, 2, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[131, 63, 94, 238, 63, 187, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:33:32] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:33:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[131, 63, 94, 238, 63, 187, 90, 88] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4321 ms. (231 steps per ms)
BEST_FIRST walk for 8000008 steps (19 resets) in 17919 ms. (446 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:33:54] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:33:54] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:33:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:33:55] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-06-02 16:33:55] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:33:55] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:33:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:33:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:33:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:33:55] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:33:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 46 ms returned sat
[2025-06-02 16:33:55] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:33:56] [INFO ] Added : 19 causal constraints over 6 iterations in 455 ms. Result :sat
Minimization took 585 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:33:57] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:33:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:33:57] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-06-02 16:33:57] [INFO ] [Real]Added 94 Read/Feed constraints in 84 ms returned sat
[2025-06-02 16:33:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:33:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:33:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:33:57] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-06-02 16:33:57] [INFO ] [Nat]Added 94 Read/Feed constraints in 70 ms returned sat
[2025-06-02 16:33:58] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 112 ms.
[2025-06-02 16:33:58] [INFO ] Added : 1 causal constraints over 1 iterations in 227 ms. Result :sat
Minimization took 590 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:33:58] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:33:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:33:59] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:33:59] [INFO ] [Real]Added 94 Read/Feed constraints in 55 ms returned sat
[2025-06-02 16:33:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:33:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:33:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:33:59] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:33:59] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:33:59] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 123 ms.
[2025-06-02 16:34:00] [INFO ] Added : 6 causal constraints over 4 iterations in 361 ms. Result :sat
Minimization took 568 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:00] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:01] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:34:01] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2025-06-02 16:34:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:01] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-06-02 16:34:01] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:34:01] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 118 ms.
[2025-06-02 16:34:02] [INFO ] Added : 5 causal constraints over 2 iterations in 296 ms. Result :sat
Minimization took 575 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:02] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:34:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:03] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:34:03] [INFO ] [Real]Added 94 Read/Feed constraints in 68 ms returned sat
[2025-06-02 16:34:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:03] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:34:03] [INFO ] [Nat]Added 94 Read/Feed constraints in 82 ms returned sat
[2025-06-02 16:34:03] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:34:03] [INFO ] Added : 2 causal constraints over 1 iterations in 233 ms. Result :sat
Minimization took 611 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:04] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:04] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-06-02 16:34:05] [INFO ] [Real]Added 94 Read/Feed constraints in 60 ms returned sat
[2025-06-02 16:34:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:34:05] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2025-06-02 16:34:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2025-06-02 16:34:05] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:34:05] [INFO ] Added : 1 causal constraints over 1 iterations in 230 ms. Result :sat
Minimization took 673 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:06] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:06] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 16:34:06] [INFO ] [Real]Added 94 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:34:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:34:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-02 16:34:07] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:34:07] [INFO ] [Nat]Added 94 Read/Feed constraints in 49 ms returned sat
[2025-06-02 16:34:07] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 109 ms.
[2025-06-02 16:34:07] [INFO ] Added : 7 causal constraints over 3 iterations in 321 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:08] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:34:08] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-06-02 16:34:08] [INFO ] [Real]Added 94 Read/Feed constraints in 63 ms returned sat
[2025-06-02 16:34:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:34:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:34:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:34:09] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 16:34:09] [INFO ] [Nat]Added 94 Read/Feed constraints in 47 ms returned sat
[2025-06-02 16:34:09] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 121 ms.
[2025-06-02 16:34:09] [INFO ] Added : 1 causal constraints over 1 iterations in 236 ms. Result :sat
Minimization took 588 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 72 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 74 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:34:11] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:34:12] [INFO ] Implicit Places using invariants in 722 ms returned []
[2025-06-02 16:34:12] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:34:12] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:34:17] [INFO ] Implicit Places using invariants and state equation in 5036 ms returned []
Implicit Place search using SMT with State Equation took 5767 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:34:17] [INFO ] Redundant transitions in 36 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:34:17] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:34:17] [INFO ] Invariant cache hit.
[2025-06-02 16:34:17] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63651ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 63656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69544 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-02 16:35:20] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 8) seen :[2, 2, 2, 1, 0, 2, 2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:35:21] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:35:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4549 ms. (219 steps per ms)
BEST_FIRST walk for 8000008 steps (26 resets) in 16802 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 16:35:42] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:42] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:43] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-06-02 16:35:43] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:35:43] [INFO ] [Real]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:35:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:43] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-06-02 16:35:43] [INFO ] [Nat]Added 94 Read/Feed constraints in 44 ms returned sat
[2025-06-02 16:35:43] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:35:44] [INFO ] Added : 19 causal constraints over 6 iterations in 468 ms. Result :sat
Minimization took 589 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:45] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:35:45] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-06-02 16:35:45] [INFO ] [Real]Added 94 Read/Feed constraints in 82 ms returned sat
[2025-06-02 16:35:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-02 16:35:45] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-06-02 16:35:45] [INFO ] [Nat]Added 94 Read/Feed constraints in 69 ms returned sat
[2025-06-02 16:35:46] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 112 ms.
[2025-06-02 16:35:46] [INFO ] Added : 1 causal constraints over 1 iterations in 224 ms. Result :sat
Minimization took 592 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:46] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:47] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-02 16:35:47] [INFO ] [Real]Added 94 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:35:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:47] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-02 16:35:47] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:35:47] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 115 ms.
[2025-06-02 16:35:48] [INFO ] Added : 6 causal constraints over 4 iterations in 347 ms. Result :sat
Minimization took 582 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:48] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2025-06-02 16:35:49] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-02 16:35:49] [INFO ] [Real]Added 94 Read/Feed constraints in 56 ms returned sat
[2025-06-02 16:35:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:49] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:35:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 16:35:49] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 111 ms.
[2025-06-02 16:35:50] [INFO ] Added : 5 causal constraints over 2 iterations in 288 ms. Result :sat
Minimization took 594 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:50] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:51] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 16:35:51] [INFO ] [Real]Added 94 Read/Feed constraints in 67 ms returned sat
[2025-06-02 16:35:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:51] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-06-02 16:35:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 82 ms returned sat
[2025-06-02 16:35:51] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 111 ms.
[2025-06-02 16:35:51] [INFO ] Added : 2 causal constraints over 1 iterations in 228 ms. Result :sat
Minimization took 600 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:52] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:53] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:35:53] [INFO ] [Real]Added 94 Read/Feed constraints in 59 ms returned sat
[2025-06-02 16:35:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:53] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:35:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:35:53] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 113 ms.
[2025-06-02 16:35:53] [INFO ] Added : 1 causal constraints over 1 iterations in 225 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:54] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-02 16:35:54] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:35:54] [INFO ] [Real]Added 94 Read/Feed constraints in 56 ms returned sat
[2025-06-02 16:35:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-02 16:35:55] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-06-02 16:35:55] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:35:55] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 116 ms.
[2025-06-02 16:35:55] [INFO ] Added : 7 causal constraints over 3 iterations in 320 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:56] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:35:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:56] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-06-02 16:35:56] [INFO ] [Real]Added 94 Read/Feed constraints in 59 ms returned sat
[2025-06-02 16:35:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:35:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:35:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:35:57] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-02 16:35:57] [INFO ] [Nat]Added 94 Read/Feed constraints in 48 ms returned sat
[2025-06-02 16:35:57] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:35:57] [INFO ] Added : 1 causal constraints over 1 iterations in 224 ms. Result :sat
Minimization took 570 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 75 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 72 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:35:59] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:59] [INFO ] Implicit Places using invariants in 716 ms returned []
[2025-06-02 16:35:59] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:36:00] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:36:04] [INFO ] Implicit Places using invariants and state equation in 5056 ms returned []
Implicit Place search using SMT with State Equation took 5774 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:36:04] [INFO ] Redundant transitions in 35 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:36:05] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:36:05] [INFO ] Invariant cache hit.
[2025-06-02 16:36:05] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 94/561 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 31153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63749ms problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 63752ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69644 ms. Remains : 465/465 places, 1326/1326 transitions.
[2025-06-02 16:37:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {214=1, 348=1, 551=1, 749=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 387=1, 590=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :[1, 1, 1, 1, 2, 1, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 1691 ms. (23 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
[2025-06-02 16:37:10] [INFO ] Flatten gal took : 377 ms
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
[2025-06-02 16:37:10] [INFO ] Flatten gal took : 233 ms
[2025-06-02 16:37:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4816947277943263396.gal : 120 ms
[2025-06-02 16:37:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5664761586039826404.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4816947277943263396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5664761586039826404.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5664761586039826404.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :31 after 1993
Interrupted probabilistic random walk after 140683 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 9
Probabilistic random walk after 140683 steps, saw 86283 distinct states, run finished after 3014 ms. (steps per millisecond=46 ) properties seen :0
[2025-06-02 16:37:13] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:37:13] [INFO ] Invariant cache hit.
[2025-06-02 16:37:13] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1993 after 1.24037e+06
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 81/1215 variables, 45/539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1215 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 9/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 15/1230 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 561 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 9/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:16] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:17] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1134 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:19] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/1230 variables, and 563 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 408/465 constraints, ReadFeed: 85/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 60/60 constraints]
After SMT, in 6604ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 69 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 465/465 places, 1326/1326 transitions.
RANDOM walk for 40001 steps (8 resets) in 376 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :1.24037e+06 after 3.71064e+10
Interrupted probabilistic random walk after 187164 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 9
Probabilistic random walk after 187164 steps, saw 114783 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2025-06-02 16:37:23] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:37:23] [INFO ] Invariant cache hit.
[2025-06-02 16:37:23] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 81/1215 variables, 45/539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1215 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 9/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 15/1230 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1230 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 561 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 657/1048 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 86/1134 variables, 17/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 85/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 9/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:26] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1134 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:29] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:30] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:30] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:30] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1134 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 81/1215 variables, 45/611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1215 variables, 9/621 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1215 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 15/1230 variables, 12/633 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1230 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1230 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 633 constraints, problems are : Problem set: 0 solved, 9 unsolved in 9175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 63/63 constraints]
After SMT, in 10768ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Detected timeout of ITS tools.
[2025-06-02 16:38:00] [INFO ] Flatten gal took : 125 ms
[2025-06-02 16:38:00] [INFO ] Applying decomposition
[2025-06-02 16:38:01] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1132216034779542060.txt' '-o' '/tmp/graph1132216034779542060.bin' '-w' '/tmp/graph1132216034779542060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1132216034779542060.bin' '-l' '-1' '-v' '-w' '/tmp/graph1132216034779542060.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:38:01] [INFO ] Decomposing Gal with order
[2025-06-02 16:38:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:38:02] [INFO ] Removed a total of 2279 redundant transitions.
[2025-06-02 16:38:02] [INFO ] Flatten gal took : 502 ms
[2025-06-02 16:38:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1084 labels/synchronizations in 140 ms.
[2025-06-02 16:38:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5388601746836867953.gal : 35 ms
[2025-06-02 16:38:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2023302411807586702.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5388601746836867953.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2023302411807586702.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2023302411807586702.prop.
Parikh walk visited 0 properties in 33654 ms.
Support contains 8 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 85 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 465/465 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Applied a total of 0 rules in 74 ms. Remains 465 /465 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2025-06-02 16:38:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:08] [INFO ] Implicit Places using invariants in 747 ms returned []
[2025-06-02 16:38:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:09] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:38:13] [INFO ] Implicit Places using invariants and state equation in 4942 ms returned []
Implicit Place search using SMT with State Equation took 5691 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:38:14] [INFO ] Redundant transitions in 258 ms returned []
Running 1324 sub problems to find dead transitions.
[2025-06-02 16:38:14] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:38:14] [INFO ] Invariant cache hit.
[2025-06-02 16:38:14] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 13.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.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 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.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 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1230 variables, and 2 constraints, problems are : Problem set: 0 solved, 1324 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
At refinement iteration 3 (OVERLAPS) 765/1230 variables, 465/467 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
SMT process timed out in 63003ms, After SMT, problems are : Problem set: 0 solved, 1324 unsolved
Search for dead transitions found 0 dead transitions in 63019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69078 ms. Remains : 465/465 places, 1326/1326 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[131, 63, 106, 238, 63, 187, 90, 137] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:39:17] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:39:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 44 ms. (222 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:[11] Max Struct:[+inf]
[2025-06-02 16:39:17] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:39:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:39:17] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:39:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:39:17] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-06-02 16:39:17] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:39:17] [INFO ] [Real]Added 94 Read/Feed constraints in 69 ms returned sat
[2025-06-02 16:39:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:39:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:39:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:39:18] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:39:18] [INFO ] [Nat]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-06-02 16:39:18] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 114 ms.
[2025-06-02 16:39:18] [INFO ] Added : 19 causal constraints over 6 iterations in 474 ms. Result :sat
Minimization took 529 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 451 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 448 transition count 1278
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 448 transition count 1278
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 445 transition count 1272
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 445 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 441 transition count 1260
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 441 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 437 transition count 1252
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 437 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 433 transition count 1244
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 433 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 429 transition count 1236
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 427 transition count 1232
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 425 transition count 1228
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 425 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 423 transition count 1224
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 423 transition count 1224
Applied a total of 95 rules in 233 ms. Remains 423 /465 variables (removed 42) and now considering 1224/1326 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 423/465 places, 1224/1326 transitions.
[2025-06-02 16:39:19] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
[2025-06-02 16:39:19] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2025-06-02 16:39:19] [INFO ] Computed 3 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 4015 ms. (249 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1652 ms. (604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[173] Max Struct:[+inf]
[2025-06-02 16:39:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:39:25] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:39:25] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-02 16:39:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:39:26] [INFO ] [Real]Added 75 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:39:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:39:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 16:39:26] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-06-02 16:39:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 53 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 70 places in 484 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:27] [INFO ] Deduced a trap composed of 77 places in 500 ms of which 47 ms to minimize.
[2025-06-02 16:39:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1066 ms
[2025-06-02 16:39:27] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 103 ms.
[2025-06-02 16:39:28] [INFO ] Added : 28 causal constraints over 7 iterations in 828 ms. Result :sat
Minimization took 361 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[173] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[173] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 76 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 65 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-02 16:39:31] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:39:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:39:32] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-06-02 16:39:32] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:39:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:39:35] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 3971 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:39:35] [INFO ] Redundant transitions in 30 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-02 16:39:35] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:39:35] [INFO ] Invariant cache hit.
[2025-06-02 16:39:35] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:00] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1114 variables, and 4 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 62588ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 62592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66669 ms. Remains : 423/423 places, 1224/1224 transitions.
[2025-06-02 16:40:38] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[173] Max Struct:[+inf]
[2025-06-02 16:40:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:40:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[173] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3893 ms. (256 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1769 ms. (564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[173] Max Struct:[+inf]
[2025-06-02 16:40:44] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:40:44] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:40:45] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-06-02 16:40:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:40:45] [INFO ] [Real]Added 75 Read/Feed constraints in 48 ms returned sat
[2025-06-02 16:40:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:40:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:40:45] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-02 16:40:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:46] [INFO ] Deduced a trap composed of 70 places in 523 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:46] [INFO ] Deduced a trap composed of 77 places in 494 ms of which 47 ms to minimize.
[2025-06-02 16:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1099 ms
[2025-06-02 16:40:46] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 105 ms.
[2025-06-02 16:40:47] [INFO ] Added : 28 causal constraints over 7 iterations in 823 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[173] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[173] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 69 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 61 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-02 16:40:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:40:51] [INFO ] Implicit Places using invariants in 644 ms returned []
[2025-06-02 16:40:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:40:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:40:55] [INFO ] Implicit Places using invariants and state equation in 3459 ms returned []
Implicit Place search using SMT with State Equation took 4112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:40:55] [INFO ] Redundant transitions in 30 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-02 16:40:55] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:40:55] [INFO ] Invariant cache hit.
[2025-06-02 16:40:55] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1114 variables, and 4 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 62453ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 62457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66669 ms. Remains : 423/423 places, 1224/1224 transitions.
[2025-06-02 16:41:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[173] Max Struct:[+inf]
[2025-06-02 16:41:58] [INFO ] Flatten gal took : 74 ms
RANDOM walk for 40001 steps (8 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
[2025-06-02 16:41:58] [INFO ] Flatten gal took : 105 ms
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2025-06-02 16:41:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16955737833609626662.gal : 28 ms
[2025-06-02 16:41:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11682437853624554662.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16955737833609626662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11682437853624554662.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11682437853624554662.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1973
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1973 after 1.19798e+06
Interrupted probabilistic random walk after 332489 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332489 steps, saw 203888 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
[2025-06-02 16:42:01] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:42:01] [INFO ] Invariant cache hit.
[2025-06-02 16:42:01] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:02] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:02] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1113 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:02] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:02] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:02] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:02] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1113 variables, 5/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:03] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1113 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1113 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/1114 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1114 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1114 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 1883ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2033 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 57 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.19798e+06 after 3.35877e+10
Interrupted probabilistic random walk after 347859 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 347859 steps, saw 213313 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-02 16:42:08] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:42:08] [INFO ] Invariant cache hit.
[2025-06-02 16:42:08] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:09] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:09] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1113 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:09] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:09] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:09] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:09] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:10] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1113 variables, 5/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:10] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1113 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1113 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/1114 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1114 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1114 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 1791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2023 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 57 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 57 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2025-06-02 16:42:12] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:42:12] [INFO ] Implicit Places using invariants in 511 ms returned []
[2025-06-02 16:42:12] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:42:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:42:16] [INFO ] Implicit Places using invariants and state equation in 3281 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:42:16] [INFO ] Redundant transitions in 31 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-02 16:42:16] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2025-06-02 16:42:16] [INFO ] Invariant cache hit.
[2025-06-02 16:42:16] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.35877e+10 after 4.41559e+17
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1114 variables, and 4 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/423 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
[2025-06-02 16:42:48] [INFO ] Flatten gal took : 48 ms
[2025-06-02 16:42:48] [INFO ] Applying decomposition
[2025-06-02 16:42:48] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph924458909644324267.txt' '-o' '/tmp/graph924458909644324267.bin' '-w' '/tmp/graph924458909644324267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph924458909644324267.bin' '-l' '-1' '-v' '-w' '/tmp/graph924458909644324267.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:42:48] [INFO ] Decomposing Gal with order
[2025-06-02 16:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:42:48] [INFO ] Removed a total of 2101 redundant transitions.
[2025-06-02 16:42:49] [INFO ] Flatten gal took : 105 ms
[2025-06-02 16:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 882 labels/synchronizations in 62 ms.
[2025-06-02 16:42:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15427833391250059096.gal : 11 ms
[2025-06-02 16:42:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18332403118713720231.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15427833391250059096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18332403118713720231.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18332403118713720231.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 62138ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 62142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66048 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
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 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 157 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-02 16:43:18] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:43:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:43:18] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 16:43:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 16:43:18] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 16:43:18] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:43:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 16:43:18] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 16:43:18] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 16:43:18] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:43:18] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:43:18] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:43:18] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:43:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11472357648167458719.gal : 1 ms
[2025-06-02 16:43:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8994017385855093152.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11472357648167458719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8994017385855093152.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8994017385855093152.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 326755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326755 after 2.38474e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.38474e+07 after 7.07972e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.07972e+07 after 1.64605e+08
Detected timeout of ITS tools.
[2025-06-02 16:43:33] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:43:33] [INFO ] Applying decomposition
[2025-06-02 16:43:33] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1829306427834192362.txt' '-o' '/tmp/graph1829306427834192362.bin' '-w' '/tmp/graph1829306427834192362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1829306427834192362.bin' '-l' '-1' '-v' '-w' '/tmp/graph1829306427834192362.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:43:33] [INFO ] Decomposing Gal with order
[2025-06-02 16:43:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:43:33] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 16:43:33] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:43:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-02 16:43:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17875330151491055450.gal : 1 ms
[2025-06-02 16:43:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7772781444272268046.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17875330151491055450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7772781444272268046.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7772781444272268046.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30409 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[173] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-03 in 271768 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
[2025-06-02 16:43:48] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 16:43:48] [INFO ] Computed 2 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2 resets) in 46 ms. (212 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:[0] Max Struct:[64]
[2025-06-02 16:43:48] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:43:49] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:43:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:43:49] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-06-02 16:43:49] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:43:49] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2025-06-02 16:43:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:43:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:43:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:43:49] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-06-02 16:43:49] [INFO ] [Nat]Added 94 Read/Feed constraints in 60 ms returned sat
[2025-06-02 16:43:49] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 106 ms.
[2025-06-02 16:43:50] [INFO ] Added : 1 causal constraints over 1 iterations in 217 ms. Result :sat
Minimization took 504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 456 transition count 1308
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 456 transition count 1308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 456 transition count 1300
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 449 transition count 1282
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 449 transition count 1282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 445 transition count 1270
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 445 transition count 1270
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 440 transition count 1256
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 435 transition count 1244
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 435 transition count 1244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 430 transition count 1234
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 430 transition count 1234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 425 transition count 1224
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 425 transition count 1224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 420 transition count 1214
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 420 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 417 transition count 1208
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 417 transition count 1208
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 414 transition count 1202
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 413 transition count 1200
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 413 transition count 1200
Applied a total of 117 rules in 300 ms. Remains 413 /465 variables (removed 52) and now considering 1200/1326 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 413/465 places, 1200/1326 transitions.
[2025-06-02 16:43:50] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2025-06-02 16:43:50] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000002 steps (2 resets) in 3637 ms. (274 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1775 ms. (563 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[64]
[2025-06-02 16:43:56] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-02 16:43:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:56] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:43:56] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-02 16:43:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 16:43:56] [INFO ] [Real]Added 72 Read/Feed constraints in 55 ms returned sat
[2025-06-02 16:43:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:43:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:43:57] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2025-06-02 16:43:57] [INFO ] [Nat]Added 72 Read/Feed constraints in 70 ms returned sat
[2025-06-02 16:43:57] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 117 ms.
[2025-06-02 16:43:57] [INFO ] Added : 2 causal constraints over 1 iterations in 219 ms. Result :sat
Minimization took 345 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[64]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 87 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 78 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2025-06-02 16:43:58] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-02 16:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:43:58] [INFO ] Implicit Places using invariants in 542 ms returned []
[2025-06-02 16:43:58] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-02 16:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:43:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 16:44:01] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:44:01] [INFO ] Redundant transitions in 30 ms returned []
Running 1198 sub problems to find dead transitions.
[2025-06-02 16:44:01] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-02 16:44:01] [INFO ] Invariant cache hit.
[2025-06-02 16:44:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:22] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/1088 variables, and 4 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/413 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 72/489 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1687 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 31002 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63425ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 63430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66695 ms. Remains : 413/413 places, 1200/1200 transitions.
[2025-06-02 16:45:04] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2025-06-02 16:45:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[64]
FORMULA FunctionPointer-PT-c064-UpperBounds-08 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 3820 ms. (261 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 16:45:08] [INFO ] Flatten gal took : 39 ms
[2025-06-02 16:45:08] [INFO ] Flatten gal took : 39 ms
[2025-06-02 16:45:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10569989789468433615.gal : 9 ms
[2025-06-02 16:45:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16212444039813447073.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10569989789468433615.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16212444039813447073.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
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:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-08 in 79992 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:45:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 16:45:08] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 44 ms. (222 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:45:08] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:45:09] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2025-06-02 16:45:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 32 ms returned sat
[2025-06-02 16:45:09] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2025-06-02 16:45:09] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:45:09] [INFO ] [Real]Added 94 Read/Feed constraints in 52 ms returned sat
[2025-06-02 16:45:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:45:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:45:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:45:09] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-06-02 16:45:09] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2025-06-02 16:45:10] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 111 ms.
[2025-06-02 16:45:10] [INFO ] Added : 14 causal constraints over 4 iterations in 355 ms. Result :sat
Minimization took 536 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 457 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 451 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 448 transition count 1278
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 448 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 444 transition count 1266
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 444 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 440 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 440 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 432 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 428 transition count 1232
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 428 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 425 transition count 1226
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 425 transition count 1226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 422 transition count 1220
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 421 transition count 1218
Applied a total of 101 rules in 209 ms. Remains 421 /465 variables (removed 44) and now considering 1218/1326 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 421/465 places, 1218/1326 transitions.
[2025-06-02 16:45:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-02 16:45:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2025-06-02 16:45:11] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3927 ms. (254 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1739 ms. (574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[438] Max Struct:[+inf]
[2025-06-02 16:45:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:45:17] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:45:17] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2025-06-02 16:45:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:45:17] [INFO ] [Real]Added 75 Read/Feed constraints in 61 ms returned sat
[2025-06-02 16:45:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:45:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 16:45:18] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-02 16:45:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 49 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:18] [INFO ] Deduced a trap composed of 70 places in 476 ms of which 34 ms to minimize.
[2025-06-02 16:45:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2025-06-02 16:45:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 106 ms.
[2025-06-02 16:45:19] [INFO ] Added : 10 causal constraints over 3 iterations in 348 ms. Result :sat
Minimization took 372 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[438] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[438] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 64 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 66 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:45:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:20] [INFO ] Implicit Places using invariants in 651 ms returned []
[2025-06-02 16:45:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:45:23] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 3851 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:45:23] [INFO ] Redundant transitions in 31 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:45:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:45:23] [INFO ] Invariant cache hit.
[2025-06-02 16:45:23] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:47] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 62474ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66434 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 16:46:25] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[438] Max Struct:[+inf]
[2025-06-02 16:46:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:46:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[438] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3979 ms. (251 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1730 ms. (577 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[479] Max Struct:[+inf]
[2025-06-02 16:46:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:46:32] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2025-06-02 16:46:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:46:32] [INFO ] [Real]Added 75 Read/Feed constraints in 58 ms returned sat
[2025-06-02 16:46:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:46:33] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-06-02 16:46:33] [INFO ] [Nat]Added 75 Read/Feed constraints in 50 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:46:33] [INFO ] Deduced a trap composed of 70 places in 490 ms of which 34 ms to minimize.
[2025-06-02 16:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2025-06-02 16:46:33] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 101 ms.
[2025-06-02 16:46:33] [INFO ] Added : 10 causal constraints over 3 iterations in 337 ms. Result :sat
Minimization took 367 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[479] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[479] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 58 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 58 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:46:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:46:34] [INFO ] Implicit Places using invariants in 505 ms returned []
[2025-06-02 16:46:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:46:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:46:38] [INFO ] Implicit Places using invariants and state equation in 3262 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:46:38] [INFO ] Redundant transitions in 30 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:46:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:46:38] [INFO ] Invariant cache hit.
[2025-06-02 16:46:38] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:47:03] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 62336ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66204 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 16:47:40] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[479] Max Struct:[+inf]
[2025-06-02 16:47:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:47:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[479] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3920 ms. (255 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1594 ms. (626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[479] Max Struct:[+inf]
[2025-06-02 16:47:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:47:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:47:46] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-06-02 16:47:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:47:47] [INFO ] [Real]Added 75 Read/Feed constraints in 61 ms returned sat
[2025-06-02 16:47:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:47:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:47:47] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-02 16:47:47] [INFO ] [Nat]Added 75 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:47:48] [INFO ] Deduced a trap composed of 70 places in 481 ms of which 33 ms to minimize.
[2025-06-02 16:47:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 535 ms
[2025-06-02 16:47:48] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 97 ms.
[2025-06-02 16:47:48] [INFO ] Added : 10 causal constraints over 3 iterations in 337 ms. Result :sat
Minimization took 356 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[479] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[479] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 58 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 57 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:47:48] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:47:49] [INFO ] Implicit Places using invariants in 654 ms returned []
[2025-06-02 16:47:49] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:47:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:47:50] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:47:52] [INFO ] Implicit Places using invariants and state equation in 3336 ms returned []
Implicit Place search using SMT with State Equation took 3992 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:47:52] [INFO ] Redundant transitions in 30 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:47:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:47:52] [INFO ] Invariant cache hit.
[2025-06-02 16:47:52] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:48:17] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 62462ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66557 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 16:48:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[479] Max Struct:[+inf]
[2025-06-02 16:48:55] [INFO ] Flatten gal took : 55 ms
RANDOM walk for 40001 steps (8 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
[2025-06-02 16:48:55] [INFO ] Flatten gal took : 55 ms
[2025-06-02 16:48:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17779892153928619259.gal : 7 ms
[2025-06-02 16:48:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17589419446943718168.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17779892153928619259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17589419446943718168.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality17589419446943718168.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 341338 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341338 steps, saw 209314 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2025-06-02 16:48:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:48:58] [INFO ] Invariant cache hit.
[2025-06-02 16:48:59] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:00] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1109 variables, 13/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1109 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1109 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 2016ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Parikh walk visited 0 properties in 4421 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 58 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40002 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344219 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344219 steps, saw 211079 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-02 16:49:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:49:08] [INFO ] Invariant cache hit.
[2025-06-02 16:49:08] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:09] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:09] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:09] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:10] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1109 variables, 13/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1109 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1109 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 2037ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4684 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 60 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 55 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:49:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:49:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:49:16] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-06-02 16:49:16] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:49:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:49:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:49:19] [INFO ] Implicit Places using invariants and state equation in 3184 ms returned []
Implicit Place search using SMT with State Equation took 3779 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:49:19] [INFO ] Redundant transitions in 31 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:49:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:49:19] [INFO ] Invariant cache hit.
[2025-06-02 16:49:19] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:49:45] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 16:49:46] [INFO ] Flatten gal took : 43 ms
[2025-06-02 16:49:46] [INFO ] Applying decomposition
[2025-06-02 16:49:46] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14252473834337436716.txt' '-o' '/tmp/graph14252473834337436716.bin' '-w' '/tmp/graph14252473834337436716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14252473834337436716.bin' '-l' '-1' '-v' '-w' '/tmp/graph14252473834337436716.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:49:46] [INFO ] Decomposing Gal with order
[2025-06-02 16:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:49:46] [INFO ] Removed a total of 2082 redundant transitions.
[2025-06-02 16:49:46] [INFO ] Flatten gal took : 88 ms
[2025-06-02 16:49:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 862 labels/synchronizations in 78 ms.
[2025-06-02 16:49:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14792438815372759397.gal : 10 ms
[2025-06-02 16:49:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10412953511549556275.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14792438815372759397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10412953511549556275.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10412953511549556275.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 62687ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66564 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 69 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-02 16:50:22] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-02 16:50:22] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 16:50:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 16:50:22] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 16:50:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 16:50:22] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 16:50:22] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 16:50:22] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:50:22] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:50:22] [INFO ] Flatten gal took : 5 ms
[2025-06-02 16:50:22] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:50:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14197651090173780690.gal : 0 ms
[2025-06-02 16:50:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6634945994908160377.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14197651090173780690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6634945994908160377.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6634945994908160377.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2025-06-02 16:50:37] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:50:37] [INFO ] Applying decomposition
[2025-06-02 16:50:37] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16435340766525843273.txt' '-o' '/tmp/graph16435340766525843273.bin' '-w' '/tmp/graph16435340766525843273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16435340766525843273.bin' '-l' '-1' '-v' '-w' '/tmp/graph16435340766525843273.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:50:37] [INFO ] Decomposing Gal with order
[2025-06-02 16:50:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:50:37] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 16:50:37] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:50:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-02 16:50:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16053625967530695842.gal : 2 ms
[2025-06-02 16:50:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1931445415093100447.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16053625967530695842.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1931445415093100447.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1931445415093100447.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 27364
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30251 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[479] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-09 in 343383 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:50:52] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 16:50:52] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 42 ms. (232 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:50:52] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:50:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:50:52] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:50:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 16:50:52] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:50:52] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:50:52] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2025-06-02 16:50:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:50:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:50:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:50:53] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-02 16:50:53] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2025-06-02 16:50:53] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 111 ms.
[2025-06-02 16:50:53] [INFO ] Added : 5 causal constraints over 2 iterations in 299 ms. Result :sat
Minimization took 508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 457 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 451 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 448 transition count 1278
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 448 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 444 transition count 1266
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 444 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 59 place count 440 transition count 1256
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 440 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 436 transition count 1248
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 436 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 432 transition count 1240
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 432 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 428 transition count 1232
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 428 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 425 transition count 1226
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 425 transition count 1226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 422 transition count 1220
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 421 transition count 1218
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 421 transition count 1218
Applied a total of 101 rules in 178 ms. Remains 421 /465 variables (removed 44) and now considering 1218/1326 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 421/465 places, 1218/1326 transitions.
[2025-06-02 16:50:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 16:50:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2025-06-02 16:50:54] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3894 ms. (256 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1616 ms. (618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[477] Max Struct:[+inf]
[2025-06-02 16:51:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:51:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:51:00] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:51:00] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-02 16:51:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:51:00] [INFO ] [Real]Added 75 Read/Feed constraints in 57 ms returned sat
[2025-06-02 16:51:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:51:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:51:01] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-06-02 16:51:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:51:01] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 33 ms to minimize.
[2025-06-02 16:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2025-06-02 16:51:01] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 97 ms.
[2025-06-02 16:51:02] [INFO ] Added : 9 causal constraints over 3 iterations in 493 ms. Result :sat
Minimization took 347 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[477] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[477] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 62 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 56 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:51:02] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:51:03] [INFO ] Implicit Places using invariants in 669 ms returned []
[2025-06-02 16:51:03] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:51:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:51:06] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 3692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:51:06] [INFO ] Redundant transitions in 30 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:51:06] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:51:06] [INFO ] Invariant cache hit.
[2025-06-02 16:51:06] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:51:31] [INFO ] Deduced a trap composed of 131 places in 200 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 31035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63428ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 63444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67232 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 16:52:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[477] Max Struct:[+inf]
[2025-06-02 16:52:10] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:52:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[477] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3914 ms. (255 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1614 ms. (619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[477] Max Struct:[+inf]
[2025-06-02 16:52:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:52:16] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-06-02 16:52:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:52:16] [INFO ] [Real]Added 75 Read/Feed constraints in 59 ms returned sat
[2025-06-02 16:52:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:52:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:52:16] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-06-02 16:52:16] [INFO ] [Nat]Added 75 Read/Feed constraints in 43 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:52:17] [INFO ] Deduced a trap composed of 70 places in 432 ms of which 34 ms to minimize.
[2025-06-02 16:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2025-06-02 16:52:17] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 98 ms.
[2025-06-02 16:52:17] [INFO ] Added : 9 causal constraints over 3 iterations in 495 ms. Result :sat
Minimization took 354 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[477] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[477] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 57 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 56 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:52:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:52:18] [INFO ] Implicit Places using invariants in 660 ms returned []
[2025-06-02 16:52:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:52:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:52:22] [INFO ] Implicit Places using invariants and state equation in 3142 ms returned []
Implicit Place search using SMT with State Equation took 3804 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:52:22] [INFO ] Redundant transitions in 30 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:52:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:52:22] [INFO ] Invariant cache hit.
[2025-06-02 16:52:22] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:52:46] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 62140ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66042 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 16:53:24] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[477] Max Struct:[+inf]
[2025-06-02 16:53:24] [INFO ] Flatten gal took : 51 ms
[2025-06-02 16:53:24] [INFO ] Flatten gal took : 49 ms
RANDOM walk for 40010 steps (8 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
[2025-06-02 16:53:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14638020155306069742.gal : 6 ms
[2025-06-02 16:53:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8813337350659565481.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14638020155306069742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8813337350659565481.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8813337350659565481.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 338024 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 338024 steps, saw 207281 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-02 16:53:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:53:27] [INFO ] Invariant cache hit.
[2025-06-02 16:53:27] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1155ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Parikh walk visited 0 properties in 5005 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 64 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324320 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324320 steps, saw 198880 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 16:53:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:53:37] [INFO ] Invariant cache hit.
[2025-06-02 16:53:37] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5182 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 59 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 73 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 16:53:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:53:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:53:44] [INFO ] Implicit Places using invariants in 603 ms returned []
[2025-06-02 16:53:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:53:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:53:47] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 3419 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:53:47] [INFO ] Redundant transitions in 31 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 16:53:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 16:53:47] [INFO ] Invariant cache hit.
[2025-06-02 16:53:47] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:54:12] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 16:54:14] [INFO ] Flatten gal took : 33 ms
[2025-06-02 16:54:14] [INFO ] Applying decomposition
[2025-06-02 16:54:15] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph496587154407187982.txt' '-o' '/tmp/graph496587154407187982.bin' '-w' '/tmp/graph496587154407187982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph496587154407187982.bin' '-l' '-1' '-v' '-w' '/tmp/graph496587154407187982.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:54:15] [INFO ] Decomposing Gal with order
[2025-06-02 16:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:54:15] [INFO ] Removed a total of 2078 redundant transitions.
[2025-06-02 16:54:15] [INFO ] Flatten gal took : 66 ms
[2025-06-02 16:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 840 labels/synchronizations in 27 ms.
[2025-06-02 16:54:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12464444558654846940.gal : 8 ms
[2025-06-02 16:54:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8482936269939307475.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12464444558654846940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8482936269939307475.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8482936269939307475.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.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 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 62455ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65992 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 32 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-02 16:54:49] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:54:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 16:54:49] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 16:54:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 16:54:49] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 16:54:49] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:54:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 16:54:49] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 16:54:49] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 16:54:49] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:54:49] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:54:49] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:54:49] [INFO ] Flatten gal took : 0 ms
[2025-06-02 16:54:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1651701854952846052.gal : 1 ms
[2025-06-02 16:54:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10359168332094800974.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1651701854952846052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10359168332094800974.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10359168332094800974.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 35107
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35107 after 6.2298e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.2298e+06 after 1.79901e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.79901e+07 after 4.1465e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.1465e+07 after 8.8369e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8369e+07 after 1.82131e+08
Detected timeout of ITS tools.
[2025-06-02 16:55:04] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:55:04] [INFO ] Applying decomposition
[2025-06-02 16:55:04] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7907544829119027074.txt' '-o' '/tmp/graph7907544829119027074.bin' '-w' '/tmp/graph7907544829119027074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7907544829119027074.bin' '-l' '-1' '-v' '-w' '/tmp/graph7907544829119027074.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:55:04] [INFO ] Decomposing Gal with order
[2025-06-02 16:55:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:55:04] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 16:55:04] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-02 16:55:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10448622002780651202.gal : 1 ms
[2025-06-02 16:55:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9994059254285302836.prop : 4 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10448622002780651202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9994059254285302836.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9994059254285302836.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30252 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[477] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-11 in 267632 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:55:19] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 16:55:19] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 43 ms. (227 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 16:55:19] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:55:20] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:55:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:55:20] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2025-06-02 16:55:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:55:20] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-06-02 16:55:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:55:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:55:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:55:20] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-06-02 16:55:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 79 ms returned sat
[2025-06-02 16:55:21] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 113 ms.
[2025-06-02 16:55:21] [INFO ] Added : 2 causal constraints over 1 iterations in 230 ms. Result :sat
Minimization took 512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 459 transition count 1314
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 459 transition count 1314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 459 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 452 transition count 1288
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 452 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 452 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 448 transition count 1276
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 448 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 443 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 443 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 438 transition count 1250
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 438 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 433 transition count 1240
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 433 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 428 transition count 1230
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 428 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 423 transition count 1220
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 423 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 420 transition count 1214
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 420 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 417 transition count 1208
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 416 transition count 1206
Applied a total of 110 rules in 172 ms. Remains 416 /465 variables (removed 49) and now considering 1206/1326 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 416/465 places, 1206/1326 transitions.
[2025-06-02 16:55:21] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 16:55:22] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2025-06-02 16:55:22] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3866 ms. (258 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1687 ms. (592 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-02 16:55:27] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:55:27] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:55:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:55:28] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-02 16:55:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:55:28] [INFO ] [Real]Added 75 Read/Feed constraints in 42 ms returned sat
[2025-06-02 16:55:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:55:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:55:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:55:28] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2025-06-02 16:55:28] [INFO ] [Nat]Added 75 Read/Feed constraints in 113 ms returned sat
[2025-06-02 16:55:28] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 141 ms.
[2025-06-02 16:55:29] [INFO ] Added : 5 causal constraints over 2 iterations in 292 ms. Result :sat
Minimization took 571 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 61 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 56 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 16:55:30] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:55:30] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-06-02 16:55:30] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:55:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:55:34] [INFO ] Implicit Places using invariants and state equation in 3396 ms returned []
Implicit Place search using SMT with State Equation took 4036 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:55:34] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 16:55:34] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:55:34] [INFO ] Invariant cache hit.
[2025-06-02 16:55:34] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 3.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1097 variables, and 2 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 75/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62786ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62789ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66919 ms. Remains : 416/416 places, 1206/1206 transitions.
[2025-06-02 16:56:37] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
[2025-06-02 16:56:37] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:56:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 4078 ms. (245 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1790 ms. (558 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[64] Max Struct:[+inf]
[2025-06-02 16:56:43] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:56:43] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:56:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:56:43] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-02 16:56:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:56:44] [INFO ] [Real]Added 75 Read/Feed constraints in 77 ms returned sat
[2025-06-02 16:56:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:56:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:56:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:56:44] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-02 16:56:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:56:44] [INFO ] Deduced a trap composed of 131 places in 365 ms of which 10 ms to minimize.
[2025-06-02 16:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2025-06-02 16:56:45] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 109 ms.
[2025-06-02 16:56:45] [INFO ] Added : 6 causal constraints over 2 iterations in 276 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[64] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 57 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 70 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 16:56:46] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:56:46] [INFO ] Implicit Places using invariants in 609 ms returned []
[2025-06-02 16:56:46] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:56:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 16:56:50] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 3980 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:56:50] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 16:56:50] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:56:50] [INFO ] Invariant cache hit.
[2025-06-02 16:56:50] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 3.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.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 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.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 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1097 variables, and 2 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 75/493 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63024ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 63027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67116 ms. Remains : 416/416 places, 1206/1206 transitions.
[2025-06-02 16:57:53] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[64] Max Struct:[+inf]
[2025-06-02 16:57:53] [INFO ] Flatten gal took : 32 ms
[2025-06-02 16:57:53] [INFO ] Flatten gal took : 33 ms
RANDOM walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
[2025-06-02 16:57:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8994405730295297790.gal : 5 ms
[2025-06-02 16:57:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17901761982730969595.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8994405730295297790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17901761982730969595.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality17901761982730969595.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 343416 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 343416 steps, saw 210589 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-02 16:57:56] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:57:56] [INFO ] Invariant cache hit.
[2025-06-02 16:57:56] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:57:57] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:57:58] [INFO ] Deduced a trap composed of 131 places in 335 ms of which 10 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1097 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1907ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 423 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 54 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40006 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 337302 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337302 steps, saw 206841 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-02 16:58:02] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 16:58:02] [INFO ] Invariant cache hit.
[2025-06-02 16:58:02] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:58:03] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:58:03] [INFO ] Deduced a trap composed of 131 places in 340 ms of which 10 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1097 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1097 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1862ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1382 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=106 )
Parikh walk visited 1 properties in 21 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:[64] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-12 in 164287 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:58:04] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 16:58:04] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 42 ms. (232 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 16:58:04] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 16:58:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:58:04] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 16:58:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:58:04] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 16:58:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 16:58:04] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2025-06-02 16:58:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 16:58:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 16:58:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 16:58:05] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2025-06-02 16:58:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 41 ms returned sat
[2025-06-02 16:58:05] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 16:58:05] [INFO ] Added : 1 causal constraints over 1 iterations in 223 ms. Result :sat
Minimization took 510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 447 transition count 1276
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 62 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 432 transition count 1240
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 432 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 427 transition count 1230
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 427 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 422 transition count 1220
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 422 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 419 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 419 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 416 transition count 1208
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 415 transition count 1206
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 415 transition count 1206
Applied a total of 111 rules in 173 ms. Remains 415 /465 variables (removed 50) and now considering 1206/1326 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 415/465 places, 1206/1326 transitions.
[2025-06-02 16:58:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2025-06-02 16:58:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-02 16:58:06] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 3989 ms. (250 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1715 ms. (582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[675] Max Struct:[+inf]
[2025-06-02 16:58:12] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:58:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:58:12] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:58:12] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-06-02 16:58:12] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 16:58:12] [INFO ] [Real]Added 74 Read/Feed constraints in 39 ms returned sat
[2025-06-02 16:58:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:58:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:58:13] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-06-02 16:58:13] [INFO ] [Nat]Added 74 Read/Feed constraints in 38 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:58:13] [INFO ] Deduced a trap composed of 70 places in 480 ms of which 37 ms to minimize.
[2025-06-02 16:58:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2025-06-02 16:58:13] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 109 ms.
[2025-06-02 16:58:14] [INFO ] Added : 7 causal constraints over 4 iterations in 365 ms. Result :sat
Minimization took 342 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[675] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[675] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 64 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 66 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 16:58:19] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:58:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:58:20] [INFO ] Implicit Places using invariants in 653 ms returned []
[2025-06-02 16:58:20] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:58:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:58:20] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 16:58:23] [INFO ] Implicit Places using invariants and state equation in 3193 ms returned []
Implicit Place search using SMT with State Equation took 3853 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:58:23] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 16:58:23] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:58:23] [INFO ] Invariant cache hit.
[2025-06-02 16:58:23] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:58:47] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 62418ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66381 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-02 16:59:26] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[675] Max Struct:[+inf]
[2025-06-02 16:59:26] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:59:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[675] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 4131 ms. (242 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1656 ms. (603 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[675] Max Struct:[+inf]
[2025-06-02 16:59:32] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:59:32] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 16:59:32] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2025-06-02 16:59:33] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 16:59:33] [INFO ] [Real]Added 74 Read/Feed constraints in 36 ms returned sat
[2025-06-02 16:59:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 16:59:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 16:59:33] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-02 16:59:33] [INFO ] [Nat]Added 74 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:59:33] [INFO ] Deduced a trap composed of 70 places in 479 ms of which 36 ms to minimize.
[2025-06-02 16:59:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2025-06-02 16:59:34] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 97 ms.
[2025-06-02 16:59:34] [INFO ] Added : 7 causal constraints over 4 iterations in 345 ms. Result :sat
Minimization took 335 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[675] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[675] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 69 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 60 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 16:59:39] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:59:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:59:40] [INFO ] Implicit Places using invariants in 648 ms returned []
[2025-06-02 16:59:40] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:59:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 16:59:43] [INFO ] Implicit Places using invariants and state equation in 3047 ms returned []
Implicit Place search using SMT with State Equation took 3697 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:59:43] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 16:59:43] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 16:59:43] [INFO ] Invariant cache hit.
[2025-06-02 16:59:43] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:00:07] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 62420ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66217 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-02 17:00:46] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 339=1, 664=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[675] Max Struct:[+inf]
[2025-06-02 17:00:46] [INFO ] Flatten gal took : 31 ms
[2025-06-02 17:00:46] [INFO ] Flatten gal took : 34 ms
[2025-06-02 17:00:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15904304949149609862.gal : 5 ms
[2025-06-02 17:00:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6227454426609088760.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15904304949149609862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6227454426609088760.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40009 steps (8 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality6227454426609088760.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 346985 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346985 steps, saw 212776 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-02 17:00:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:00:49] [INFO ] Invariant cache hit.
[2025-06-02 17:00:49] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1364ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1518 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 59 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 349793 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349793 steps, saw 214498 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2025-06-02 17:00:56] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:00:56] [INFO ] Invariant cache hit.
[2025-06-02 17:00:56] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1476 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 55 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 53 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 17:00:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:00:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:00:59] [INFO ] Implicit Places using invariants in 554 ms returned []
[2025-06-02 17:00:59] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:00:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:00:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 17:01:02] [INFO ] Implicit Places using invariants and state equation in 3096 ms returned []
Implicit Place search using SMT with State Equation took 3669 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:01:02] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 17:01:02] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:01:02] [INFO ] Invariant cache hit.
[2025-06-02 17:01:02] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
[2025-06-02 17:01:26] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Detected timeout of ITS tools.
[2025-06-02 17:01:37] [INFO ] Flatten gal took : 38 ms
[2025-06-02 17:01:37] [INFO ] Applying decomposition
[2025-06-02 17:01:37] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16245532286449030068.txt' '-o' '/tmp/graph16245532286449030068.bin' '-w' '/tmp/graph16245532286449030068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16245532286449030068.bin' '-l' '-1' '-v' '-w' '/tmp/graph16245532286449030068.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:01:37] [INFO ] Decomposing Gal with order
[2025-06-02 17:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:01:37] [INFO ] Removed a total of 2062 redundant transitions.
[2025-06-02 17:01:37] [INFO ] Flatten gal took : 68 ms
[2025-06-02 17:01:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 817 labels/synchronizations in 27 ms.
[2025-06-02 17:01:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1508312716854595060.gal : 9 ms
[2025-06-02 17:01:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16823660485301247561.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1508312716854595060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16823660485301247561.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Loading property file /tmp/ReachabilityCardinality16823660485301247561.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 680/1095 variables, 415/419 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 62719ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62722ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66484 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 31 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2025-06-02 17:02:05] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:02:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 17:02:05] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 17:02:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:02:05] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 17:02:05] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:02:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 17:02:05] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 17:02:05] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 17:02:05] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:02:05] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:02:05] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:02:05] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:02:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13046671696823258667.gal : 0 ms
[2025-06-02 17:02:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4975632277514689152.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13046671696823258667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4975632277514689152.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4975632277514689152.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2025-06-02 17:02:20] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:02:20] [INFO ] Applying decomposition
[2025-06-02 17:02:20] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4868038710033545448.txt' '-o' '/tmp/graph4868038710033545448.bin' '-w' '/tmp/graph4868038710033545448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4868038710033545448.bin' '-l' '-1' '-v' '-w' '/tmp/graph4868038710033545448.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:02:20] [INFO ] Decomposing Gal with order
[2025-06-02 17:02:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:02:20] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-02 17:02:20] [INFO ] Flatten gal took : 2 ms
[2025-06-02 17:02:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 17:02:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10388093397660841859.gal : 4 ms
[2025-06-02 17:02:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17984885072242758742.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10388093397660841859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17984885072242758742.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17984885072242758742.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 14817
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14817 after 482288
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :482288 after 3.92852e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.92852e+09 after 1.76435e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.76435e+11 after 2.51976e+12
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30226 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[675] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-13 in 271361 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 17:02:35] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 17:02:35] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 41 ms. (238 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2025-06-02 17:02:35] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 17:02:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:02:35] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 17:02:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 17:02:35] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-02 17:02:35] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 17:02:36] [INFO ] [Real]Added 94 Read/Feed constraints in 50 ms returned sat
[2025-06-02 17:02:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:02:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 17:02:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 17:02:36] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-06-02 17:02:36] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2025-06-02 17:02:36] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 110 ms.
[2025-06-02 17:02:36] [INFO ] Added : 7 causal constraints over 3 iterations in 309 ms. Result :sat
Minimization took 512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 452 transition count 1290
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 452 transition count 1290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 449 transition count 1284
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 449 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 445 transition count 1272
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 445 transition count 1272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 441 transition count 1264
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 441 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 437 transition count 1256
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 437 transition count 1256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 433 transition count 1248
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 433 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 429 transition count 1240
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 429 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 427 transition count 1236
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 427 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 425 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 425 transition count 1232
Applied a total of 87 rules in 171 ms. Remains 425 /465 variables (removed 40) and now considering 1232/1326 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 425/465 places, 1232/1326 transitions.
[2025-06-02 17:02:37] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2025-06-02 17:02:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2025-06-02 17:02:38] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 4091 ms. (244 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1748 ms. (571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[115] Max Struct:[+inf]
[2025-06-02 17:02:43] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:02:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:02:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 17:02:44] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 17:02:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:02:44] [INFO ] [Real]Added 75 Read/Feed constraints in 58 ms returned sat
[2025-06-02 17:02:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:02:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 17:02:44] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-02 17:02:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 74 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:02:45] [INFO ] Deduced a trap composed of 70 places in 494 ms of which 57 ms to minimize.
[2025-06-02 17:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 551 ms
[2025-06-02 17:02:45] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 101 ms.
[2025-06-02 17:02:45] [INFO ] Added : 36 causal constraints over 9 iterations in 599 ms. Result :sat
Minimization took 367 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[115] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[115] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 57 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 56 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-02 17:02:48] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:02:48] [INFO ] Implicit Places using invariants in 664 ms returned []
[2025-06-02 17:02:48] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:02:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:02:52] [INFO ] Implicit Places using invariants and state equation in 3328 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:02:52] [INFO ] Redundant transitions in 32 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-02 17:02:52] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:02:52] [INFO ] Invariant cache hit.
[2025-06-02 17:02:52] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:03:18] [INFO ] Deduced a trap composed of 131 places in 207 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 62315ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66407 ms. Remains : 425/425 places, 1232/1232 transitions.
[2025-06-02 17:03:54] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[115] Max Struct:[+inf]
[2025-06-02 17:03:55] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:03:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[115] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3918 ms. (255 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1724 ms. (579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[129] Max Struct:[+inf]
[2025-06-02 17:04:00] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:04:00] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 17:04:01] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-06-02 17:04:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:04:01] [INFO ] [Real]Added 75 Read/Feed constraints in 60 ms returned sat
[2025-06-02 17:04:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:04:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 17:04:01] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-02 17:04:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 66 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:02] [INFO ] Deduced a trap composed of 70 places in 509 ms of which 57 ms to minimize.
[2025-06-02 17:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2025-06-02 17:04:02] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 107 ms.
[2025-06-02 17:04:02] [INFO ] Added : 36 causal constraints over 9 iterations in 598 ms. Result :sat
Minimization took 368 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[129] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[129] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 58 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 69 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-02 17:04:05] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:04:06] [INFO ] Implicit Places using invariants in 677 ms returned []
[2025-06-02 17:04:06] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:04:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:04:09] [INFO ] Implicit Places using invariants and state equation in 3208 ms returned []
Implicit Place search using SMT with State Equation took 3887 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:04:09] [INFO ] Redundant transitions in 31 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-02 17:04:09] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:04:09] [INFO ] Invariant cache hit.
[2025-06-02 17:04:09] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:40] [INFO ] Deduced a trap composed of 131 places in 267 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 75/504 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 1734 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30964 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63454ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 63457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67453 ms. Remains : 425/425 places, 1232/1232 transitions.
[2025-06-02 17:05:12] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[129] Max Struct:[+inf]
[2025-06-02 17:05:13] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:05:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[129] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3836 ms. (260 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1625 ms. (615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[129] Max Struct:[+inf]
[2025-06-02 17:05:18] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:05:18] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 17:05:19] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-02 17:05:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:05:19] [INFO ] [Real]Added 75 Read/Feed constraints in 51 ms returned sat
[2025-06-02 17:05:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:05:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 17:05:19] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-02 17:05:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 60 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:05:20] [INFO ] Deduced a trap composed of 70 places in 462 ms of which 53 ms to minimize.
[2025-06-02 17:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2025-06-02 17:05:20] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 96 ms.
[2025-06-02 17:05:20] [INFO ] Added : 36 causal constraints over 9 iterations in 570 ms. Result :sat
Minimization took 346 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[129] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[129] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 55 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 63 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-02 17:05:23] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:05:23] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-06-02 17:05:23] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:05:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:05:26] [INFO ] Implicit Places using invariants and state equation in 2912 ms returned []
Implicit Place search using SMT with State Equation took 3532 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:05:26] [INFO ] Redundant transitions in 30 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-02 17:05:26] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:05:26] [INFO ] Invariant cache hit.
[2025-06-02 17:05:26] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:05:51] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 62265ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62268ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65901 ms. Remains : 425/425 places, 1232/1232 transitions.
[2025-06-02 17:06:29] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {203=1, 301=1, 499=1, 690=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 350=1, 676=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[129] Max Struct:[+inf]
[2025-06-02 17:06:29] [INFO ] Flatten gal took : 61 ms
RANDOM walk for 40001 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2025-06-02 17:06:29] [INFO ] Flatten gal took : 32 ms
[2025-06-02 17:06:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14690627617059629377.gal : 5 ms
[2025-06-02 17:06:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9594443389373381226.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14690627617059629377.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9594443389373381226.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9594443389373381226.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1975
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1975 after 1.20219e+06
Interrupted probabilistic random walk after 345448 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345448 steps, saw 211834 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-02 17:06:32] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:06:32] [INFO ] Invariant cache hit.
[2025-06-02 17:06:32] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1687 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 55 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 425/425 places, 1232/1232 transitions.
RANDOM walk for 40005 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.20219e+06 after 3.3929e+10
Interrupted probabilistic random walk after 349034 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349034 steps, saw 214031 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2025-06-02 17:06:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:06:38] [INFO ] Invariant cache hit.
[2025-06-02 17:06:38] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/379 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/983 variables, 338/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1045 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1045 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 70/1115 variables, 68/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1115 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/1119 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1120 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/369 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/379 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/983 variables, 338/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1045 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1045 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/1115 variables, 68/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1115 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1119 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1120 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1580 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 52 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 54 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-02 17:06:41] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:06:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:06:42] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-02 17:06:42] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:06:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:06:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 17:06:45] [INFO ] Implicit Places using invariants and state equation in 2948 ms returned []
Implicit Place search using SMT with State Equation took 3403 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:06:45] [INFO ] Redundant transitions in 31 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-02 17:06:45] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2025-06-02 17:06:45] [INFO ] Invariant cache hit.
[2025-06-02 17:06:45] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.3929e+10 after 4.52909e+17
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:15] [INFO ] Deduced a trap composed of 131 places in 237 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Detected timeout of ITS tools.
[2025-06-02 17:07:19] [INFO ] Flatten gal took : 32 ms
[2025-06-02 17:07:19] [INFO ] Applying decomposition
[2025-06-02 17:07:19] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12305443866077679635.txt' '-o' '/tmp/graph12305443866077679635.bin' '-w' '/tmp/graph12305443866077679635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12305443866077679635.bin' '-l' '-1' '-v' '-w' '/tmp/graph12305443866077679635.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:07:19] [INFO ] Decomposing Gal with order
[2025-06-02 17:07:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:07:19] [INFO ] Removed a total of 2118 redundant transitions.
[2025-06-02 17:07:19] [INFO ] Flatten gal took : 68 ms
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2025-06-02 17:07:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 937 labels/synchronizations in 32 ms.
[2025-06-02 17:07:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15062399414977421401.gal : 9 ms
[2025-06-02 17:07:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18197694491287509194.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15062399414977421401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18197694491287509194.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18197694491287509194.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 62679ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66179 ms. Remains : 425/425 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 425 transition count 686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 555 place count 416 transition count 686
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 555 place count 416 transition count 613
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 701 place count 343 transition count 613
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 961 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 149 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 86 transition count 227
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 23 transition count 101
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 23 transition count 101
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 23 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 23 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 22 transition count 37
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 4 with 2 rules applied. Total rules applied 1410 place count 21 transition count 36
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 4 with 2 rules applied. Total rules applied 1412 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1415 place count 20 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1416 place count 19 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 1417 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1419 place count 19 transition count 31
Applied a total of 1419 rules in 57 ms. Remains 19 /425 variables (removed 406) and now considering 31/1232 (removed 1201) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2025-06-02 17:07:47] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:07:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 17:07:48] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 17:07:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:07:48] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 17:07:48] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:07:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 17:07:48] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 17:07:48] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 17:07:48] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:07:48] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:07:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 17:07:48] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:07:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7853743661943727308.gal : 0 ms
[2025-06-02 17:07:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality609461162326679027.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7853743661943727308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality609461162326679027.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality609461162326679027.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 326755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326755 after 2.38474e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.38474e+07 after 7.07972e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.07972e+07 after 1.64605e+08
Detected timeout of ITS tools.
[2025-06-02 17:08:03] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:08:03] [INFO ] Applying decomposition
[2025-06-02 17:08:03] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13255299784483914581.txt' '-o' '/tmp/graph13255299784483914581.bin' '-w' '/tmp/graph13255299784483914581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13255299784483914581.bin' '-l' '-1' '-v' '-w' '/tmp/graph13255299784483914581.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:08:03] [INFO ] Decomposing Gal with order
[2025-06-02 17:08:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:08:03] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-02 17:08:03] [INFO ] Flatten gal took : 3 ms
[2025-06-02 17:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2025-06-02 17:08:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8708850312783349625.gal : 1 ms
[2025-06-02 17:08:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17565057784723485830.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8708850312783349625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17565057784723485830.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17565057784723485830.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30224 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[129] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-14 in 342622 ms.
Starting property specific reduction for FunctionPointer-PT-c064-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 17:08:18] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
// Phase 1: matrix 765 rows 465 cols
[2025-06-02 17:08:18] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 17:08:18] [INFO ] Flow matrix only has 765 transitions (discarded 561 similar events)
[2025-06-02 17:08:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:08:18] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 17:08:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 17:08:18] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-02 17:08:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 17:08:18] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2025-06-02 17:08:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:08:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-02 17:08:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 17:08:19] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-06-02 17:08:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 42 ms returned sat
[2025-06-02 17:08:19] [INFO ] Computed and/alt/rep : 108/211/96 causal constraints (skipped 667 transitions) in 106 ms.
[2025-06-02 17:08:19] [INFO ] Added : 1 causal constraints over 1 iterations in 212 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1326/1326 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 462 transition count 1320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 457 transition count 1310
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 457 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 457 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 451 transition count 1288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 447 transition count 1276
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 442 transition count 1262
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 442 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 62 place count 437 transition count 1250
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 437 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 432 transition count 1240
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 432 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 427 transition count 1230
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 427 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 422 transition count 1220
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 422 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 419 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 419 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 416 transition count 1208
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 415 transition count 1206
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 415 transition count 1206
Applied a total of 111 rules in 164 ms. Remains 415 /465 variables (removed 50) and now considering 1206/1326 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 415/465 places, 1206/1326 transitions.
[2025-06-02 17:08:19] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-02 17:08:20] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-02 17:08:20] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3674 ms. (272 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1553 ms. (643 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642] Max Struct:[+inf]
[2025-06-02 17:08:25] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:08:25] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 17:08:26] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2025-06-02 17:08:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 17:08:26] [INFO ] [Real]Added 74 Read/Feed constraints in 36 ms returned sat
[2025-06-02 17:08:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:08:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 17:08:26] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2025-06-02 17:08:26] [INFO ] [Nat]Added 74 Read/Feed constraints in 41 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:27] [INFO ] Deduced a trap composed of 70 places in 427 ms of which 30 ms to minimize.
[2025-06-02 17:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2025-06-02 17:08:27] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 91 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:27] [INFO ] Deduced a trap composed of 70 places in 451 ms of which 47 ms to minimize.
[2025-06-02 17:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2025-06-02 17:08:27] [INFO ] Added : 5 causal constraints over 2 iterations in 809 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 63 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 64 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 17:08:31] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:08:31] [INFO ] Implicit Places using invariants in 577 ms returned []
[2025-06-02 17:08:31] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:08:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 17:08:34] [INFO ] Implicit Places using invariants and state equation in 2736 ms returned []
Implicit Place search using SMT with State Equation took 3315 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:08:34] [INFO ] Redundant transitions in 28 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 17:08:34] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:08:34] [INFO ] Invariant cache hit.
[2025-06-02 17:08:34] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:07] [INFO ] Deduced a trap composed of 131 places in 261 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63040ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 63042ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66457 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-02 17:09:37] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[642] Max Struct:[+inf]
[2025-06-02 17:09:38] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:09:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[642] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3845 ms. (260 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1662 ms. (601 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642] Max Struct:[+inf]
[2025-06-02 17:09:44] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:09:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:09:44] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 17:09:44] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2025-06-02 17:09:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 17:09:44] [INFO ] [Real]Added 74 Read/Feed constraints in 62 ms returned sat
[2025-06-02 17:09:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:09:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 17:09:45] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2025-06-02 17:09:45] [INFO ] [Nat]Added 74 Read/Feed constraints in 63 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:45] [INFO ] Deduced a trap composed of 70 places in 628 ms of which 52 ms to minimize.
[2025-06-02 17:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 708 ms
[2025-06-02 17:09:46] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 150 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:47] [INFO ] Deduced a trap composed of 70 places in 695 ms of which 77 ms to minimize.
[2025-06-02 17:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 798 ms
[2025-06-02 17:09:47] [INFO ] Added : 5 causal constraints over 2 iterations in 1267 ms. Result :sat
Minimization took 465 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642] Max Struct:[+inf]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 53 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 52 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 17:09:50] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:09:51] [INFO ] Implicit Places using invariants in 677 ms returned []
[2025-06-02 17:09:51] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:09:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 17:09:54] [INFO ] Implicit Places using invariants and state equation in 3309 ms returned []
Implicit Place search using SMT with State Equation took 3988 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:09:54] [INFO ] Redundant transitions in 28 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 17:09:54] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:09:54] [INFO ] Invariant cache hit.
[2025-06-02 17:09:54] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:24] [INFO ] Deduced a trap composed of 131 places in 198 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62112ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66191 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-02 17:10:56] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[642] Max Struct:[+inf]
[2025-06-02 17:10:57] [INFO ] Flatten gal took : 51 ms
[2025-06-02 17:10:57] [INFO ] Flatten gal took : 43 ms
[2025-06-02 17:10:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14122242644410183359.gal : 7 ms
[2025-06-02 17:10:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10733511228778675683.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14122242644410183359.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10733511228778675683.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40008 steps (8 resets) in 406 ms. (98 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10733511228778675683.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
Interrupted probabilistic random walk after 324714 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324714 steps, saw 199120 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 17:11:01] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:11:01] [INFO ] Invariant cache hit.
[2025-06-02 17:11:01] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1121 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 93 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40002 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Interrupted probabilistic random walk after 355149 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355149 steps, saw 217781 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2025-06-02 17:11:06] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:11:06] [INFO ] Invariant cache hit.
[2025-06-02 17:11:06] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/358 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/952 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 67/1081 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/355 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/358 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 594/952 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/1081 variables, 65/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1081 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1089 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1089 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1095 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1095 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1186ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1297 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 60 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 73 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 17:11:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:11:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:09] [INFO ] Implicit Places using invariants in 608 ms returned []
[2025-06-02 17:11:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:11:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 17:11:12] [INFO ] Implicit Places using invariants and state equation in 3027 ms returned []
Implicit Place search using SMT with State Equation took 3637 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:11:12] [INFO ] Redundant transitions in 28 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 17:11:12] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 17:11:12] [INFO ] Invariant cache hit.
[2025-06-02 17:11:12] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74714e+10 after 5.80652e+17
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Detected timeout of ITS tools.
[2025-06-02 17:11:48] [INFO ] Flatten gal took : 41 ms
[2025-06-02 17:11:48] [INFO ] Applying decomposition
[2025-06-02 17:11:48] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7136422778933919262.txt' '-o' '/tmp/graph7136422778933919262.bin' '-w' '/tmp/graph7136422778933919262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7136422778933919262.bin' '-l' '-1' '-v' '-w' '/tmp/graph7136422778933919262.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:11:48] [INFO ] Decomposing Gal with order
[2025-06-02 17:11:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:11:48] [INFO ] Removed a total of 2064 redundant transitions.
[2025-06-02 17:11:48] [INFO ] Flatten gal took : 89 ms
[2025-06-02 17:11:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 832 labels/synchronizations in 38 ms.
[2025-06-02 17:11:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3278651898564095570.gal : 14 ms
[2025-06-02 17:11:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14088152221321724481.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3278651898564095570.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14088152221321724481.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14088152221321724481.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1095 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/415 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62557ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66307 ms. Remains : 415/415 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 38 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2025-06-02 17:12:15] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:12:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 17:12:15] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 17:12:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:12:15] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 17:12:15] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:12:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 17:12:15] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 17:12:15] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 17:12:15] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:12:15] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 17:12:15] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:12:15] [INFO ] Flatten gal took : 2 ms
[2025-06-02 17:12:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11886533178679499516.gal : 1 ms
[2025-06-02 17:12:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11034658832964677557.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11886533178679499516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11034658832964677557.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11034658832964677557.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 12482
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12482 after 287427
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :287427 after 4.65965e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.65965e+07 after 1.40496e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.40496e+08 after 3.28112e+08
Detected timeout of ITS tools.
[2025-06-02 17:12:30] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:12:30] [INFO ] Applying decomposition
[2025-06-02 17:12:30] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18400734055052418916.txt' '-o' '/tmp/graph18400734055052418916.bin' '-w' '/tmp/graph18400734055052418916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18400734055052418916.bin' '-l' '-1' '-v' '-w' '/tmp/graph18400734055052418916.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:12:30] [INFO ] Decomposing Gal with order
[2025-06-02 17:12:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:12:30] [INFO ] Removed a total of 14 redundant transitions.
[2025-06-02 17:12:30] [INFO ] Flatten gal took : 1 ms
[2025-06-02 17:12:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 17:12:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8960080019535008889.gal : 0 ms
[2025-06-02 17:12:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4544045480696524786.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8960080019535008889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4544045480696524786.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4544045480696524786.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
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 20930
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20930 after 191618
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :191618 after 3.92843e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.92843e+09 after 1.73503e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.73503e+11 after 2.50244e+12
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30194 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[642] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c064-UpperBounds-15 in 267351 ms.
[2025-06-02 17:12:45] [INFO ] Flatten gal took : 30 ms
[2025-06-02 17:12:45] [INFO ] Applying decomposition
[2025-06-02 17:12:45] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15766259029069145227.txt' '-o' '/tmp/graph15766259029069145227.bin' '-w' '/tmp/graph15766259029069145227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15766259029069145227.bin' '-l' '-1' '-v' '-w' '/tmp/graph15766259029069145227.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:12:45] [INFO ] Decomposing Gal with order
[2025-06-02 17:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:12:45] [INFO ] Removed a total of 2278 redundant transitions.
[2025-06-02 17:12:45] [INFO ] Flatten gal took : 96 ms
[2025-06-02 17:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1001 labels/synchronizations in 48 ms.
[2025-06-02 17:12:45] [INFO ] Time to serialize gal into /tmp/UpperBounds991746551975294460.gal : 9 ms
[2025-06-02 17:12:45] [INFO ] Time to serialize properties into /tmp/UpperBounds10185884192866955283.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds991746551975294460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10185884192866955283.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds10185884192866955283.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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="FunctionPointer-PT-c064"
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-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c064, 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 r100-smll-174867007500157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 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.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 ;